[PPL-devel] [GIT] ppl/ppl(master): Fixed several typos.

[Roberto Bagnara]

Module: ppl/ppl
Branch: master
Commit: cdb6ec47f9cb79e3b3d8af4aee9b8c4c97195e5e
URL:    http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/ppl.git;a=commit;h=cdb6ec47f9cb79e3b3d8af4aee9b8c4c97195e5e

Author: Roberto Bagnara <roberto.bagnara at bugseng.com>
Date:   Sat Dec 28 08:43:25 2013 +0100

Fixed several typos.

---

 doc/ppl_citations.bib |   22 ++++++++++++----------
 1 files changed, 12 insertions(+), 10 deletions(-)

diff --git a/doc/ppl_citations.bib b/doc/ppl_citations.bib
index d6f4673..7543961 100644
--- a/doc/ppl_citations.bib
+++ b/doc/ppl_citations.bib
@@ -190,18 +190,18 @@ Summarizing:
 }
 
 @Article{AlbertGM13,
-  Author    = "E. Albert and S. Genaim and A. N. Masud",
-  Title     = "On the Inference of Resource Usage Upper and Lower Bounds",
-  Journal   = "ACM Transactions on Computational Logic (TOCL)",
-  Volume    = 14,
-  Number    = 3,
-  Year      = 2013,
+  Author = "E. Albert and S. Genaim and A. N. Masud",
+  Title = "On the Inference of Resource Usage Upper and Lower Bounds",
+  Journal = "ACM Transactions on Computational Logic",
+  Volume = 14,
+  Number = 3,
+  Year = 2013,
   Abstract = "Cost analysis aims at determining the amount of
               resources required to run a program in terms of its
               input data sizes. The most challenging step is to infer
               the cost of executing the loops in the program. This
               requires bounding the number of iterations of each loop
-              and finding tight bounds for the cost of each of its
+              and findig tight bounds for the cost of each of its
               iterations. This article presents a novel approach to
               infer upper and lower bounds from cost relations. These
               relations are an extended form of standard recurrence
@@ -258,8 +258,10 @@ Summarizing:
 
 @Inproceedings{AlthoffK12,
   Author = "M. Althoff and B. H. Krogh",
-  Title = "Avoiding Geometric Intersection Operations in Reachability Analysis of Hybrid Systems",
-  Booktitle = "Proceedings of the 15th {ACM} International Conference on Hybrid Systems: Computation and Control, (HSCC '12)",
+  Title = "Avoiding Geometric Intersection Operations
+           in Reachability Analysis of Hybrid Systems",
+  Booktitle = "Proceedings of the 15th ACM International Conference
+               on Hybrid Systems: Computation and Control (HSCC '12)",
   Year = 2012,
   ISBN = "978-1-4503-1220-2",
   Address = "Beijing, China",
@@ -346,7 +348,7 @@ Summarizing:
               demo model from Mathworks."
 }
 
- at Inproceedings {AmatoPS10,
+ at Inproceedings{AmatoPS10,
   Author = "G. Amato and M. Parton and F. Scozzari",
   Title = "A Tool Which Mines Partial Execution Traces to Improve
            Static Analysis",