Module: ppl/w3ppl Branch: master Commit: 54f8d3221dc2a3c8ad2c3df330f70468630950bf URL: http://www.cs.unipr.it/git/gitweb.cgi?p=ppl/w3ppl.git;a=commit;h=54f8d3221dc... Author: Roberto Bagnara <bagnara@cs.unipr.it> Date: Tue Apr 7 15:42:19 2009 +0200 Added BandaG09. Used the right kind of dash in other entries. --- htdocs/Documentation/ppl_citations.bib | 39 ++++++++++++++++++++++++++++++- 1 files changed, 37 insertions(+), 2 deletions(-) diff --git a/htdocs/Documentation/ppl_citations.bib b/htdocs/Documentation/ppl_citations.bib index 3529ccd..251b0f8 100644 --- a/htdocs/Documentation/ppl_citations.bib +++ b/htdocs/Documentation/ppl_citations.bib @@ -51,7 +51,7 @@ ISBN = "978-3-540-92187-5", Note = "Revised papers presented at the 6th International Symposium on Formal Methods for Components and Objects (FMCO 2007), - Amsterdam, The Netherlands, October 24-26, 2007", + Amsterdam, The Netherlands, October 24--26, 2007", Abstract = "This paper describes the architecture of COSTA, an abstract interpretation based COST and termination Analyzer for Java bytecode. The system receives as @@ -284,6 +284,41 @@ Note = "Available at \url{http://www.lsi.upc.es/dept/techreps/techreps.html}" } +@Incollection{BandaG09, + Author = "G. Banda and J. P. Gallagher", + Title = "Analysis of Linear Hybrid Systems in {CLP}", + Booktitle = "Logic-Based Program Synthesis and Transformation", + Editor = "M. Hanus", + Pages = "55--70", + Publisher = "Springer-Verlag, Berlin", + Series = "Lecture Notes in Computer Science", + Volume = 5438, + Year = 2009, + ISBN = "978-3-642-00514-5", + Note = "Revised selected papers presented at the 18th International + Symposium on Logic-Based Program Synthesis and Transformation + (LOPSTR 2008), Valencia, Spain, July 17--18, 2008", + Abstract = "In this paper we present a procedure for representing + the semantics of linear hybrid automata (LHAs) as + constraint logic programs (CLP); flexible and accurate + analysis and verification of LHAs can then be performed + using generic CLP analysis and transformation + tools. LHAs provide an expressive notation for + specifying real-time systems. The main contributions are + (i) a technique for capturing the reachable states of + the continuously changing state variables of the LHA as + CLP constraints; (ii) a way of representing events in + the LHA as constraints in CLP, along with a product + construction on the CLP representation including + synchronisation on shared events; (iii) a framework in + which various kinds of reasoning about an LHA can be + flexibly performed by combining standard CLP + transformation and analysis techniques. We give + experimental results to support the usefulness of the + approach and argue that we contribute to the general + field of using static analysis tools for verification." +} + @Inproceedings{BouchyFL08, Author = "F. Bouchy and A. Finkel and J. Leroux", Title = "Decomposition of Decidable First-Order Logics @@ -1616,7 +1651,7 @@ ISBN = "978-3-540-72520-6", Note = "Revised papers presented at the 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC 2006), - New Orleans, Louisiana, USA, November 2-4, 2006", + New Orleans, Louisiana, USA, November 2--4, 2006", Abstract = "Affine control loops (ACLs) comprise an important class of compute- and data-intensive computations. The theoretical framework for the automatic parallelization