Precise widening operators for convex polyhedra

Science of Computer Programming

Volumn 58, Issue 1-2, 2005, Pages 28-56

  Bagnara, Roberto ^a   Hill, Patricia M ^b   Ricci, Elisa ^a   Zaffanella, Enea ^a  

^a UNIVERSITY OF PARMA   (Italy)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Abstract interpretation; Convex polyhedra; Widening operators

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DATA PROCESSING; HEURISTIC METHODS;

ABSTRACT INTERPRETATION; CONVEX POLYHEDRA; FIXPOINT COMPUTATIONS; POLYHEDRA; WIDENING OPERATORS;

MATHEMATICAL OPERATORS;

EID: 23844434496     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2005.02.003     Document Type: Conference Paper

References (42)

1. R. Bagnara, Data-flow analysis for constraint logic-based languages, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, Pisa, Italy, printed as Report TD-1/97, March 1997
2. R. Bagnara, P.M. Hill, E. Ricci, and E. Zaffanella Precise widening operators for convex polyhedra R. Cousot Static Analysis: Proceedings of the 10th International Symposium Lecture Notes in Computer Science vol. 2694 2003 Springer-Verlag Berlin, San Diego, CA, USA 337 354
3. R. Bagnara, P.M. Hill, and E. Zaffanella Widening operators for powerset domains B. Steffen G. Levi Proceedings of the Fifth International Conference on Verification, Model Checking and Abstract Interpretation VMCAI 2004 Lecture Notes in Computer Science vol. 2937 2003 Springer-Verlag Berlin, Venice, Italy 135 148
4. R. Bagnara, P.M. Hill, and E. Zaffanella The Parma Polyhedra Library User's Manual, Department of Mathematics, University of Parma, Parma, Italy, Release 0.7 edition Available at http://www.cs.unipr.it/ppl/ December 2004
5. R. Bagnara, E. Ricci, E. Zaffanella, and P.M. Hill Possibly not closed convex polyhedra and the Parma Polyhedra Library M.V. Hermenegildo G. Puebla Static Analysis: Proceedings of the 9th International Symposium Lecture Notes in Computer Science vol. 2477 2002 Springer-Verlag Berlin, Madrid, Spain 213 229
6. P.M. Benoy, Polyhedral domains for abstract interpretation in logic programming, Ph.D. Thesis, Computing Laboratory, University of Kent, Canterbury, Kent, UK, January 2002
7. F. Benoy, and A. King Inferring argument size relationships with CLP (R) J.P. Gallagher Logic Program Synthesis and Transformation: Proceedings of the 6th International Workshop Lecture Notes in Computer Science vol. 1207 1997 Springer-Verlag Berlin, Stockholm, Sweden 204 223
8. F. Besson, T.P. Jensen, and J.-P. Talpin Polyhedral analysis for synchronous languages A. Cortesi G. Filé Static Analysis: Proceedings of the 6th International Symposium Lecture Notes in Computer Science vol. 1694 1999 Springer-Verlag Berlin, Venice, Italy 51 68
9. F. Bourdoncle Efficient chaotic iteration strategies with widenings D. Bjørner M. Broy I.V. Pottosin Proceedings of the International Conference on Formal Methods in Programming and Their Applications Lecture Notes in Computer Science vol. 735 1993 Springer-Verlag Berlin, Academgorodok, Novosibirsk, Russia 128 141
10. F. Bourdoncle, Sémantiques des langages impératifs d'ordre supérieur et interprétation abstraite, PRL Research Report 22, DEC Paris Research Laboratory, 1993
11. T. Bultan, R. Gerber, and W. Pugh Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results ACM Transactions on Programming Languages and Systems 21 4 1999 747 789
12. N.V. Chernikova Algorithm for finding a general formula for the non-negative solutions of system of linear equations U.S.S.R. Computational Mathematics and Mathematical Physics 4 4 1964 151 158
13. N.V. Chernikova Algorithm for finding a general formula for the non-negative solutions of system of linear inequalities U.S.S.R. Computational Mathematics and Mathematical Physics 5 2 1965 228 233
14. N.V. Chernikova Algorithm for discovering the set of all solutions of a linear programming problem U.S.S.R. Computational Mathematics and Mathematical Physics 8 6 1968 282 293
15. M.A. Colón, and H.B. Sipma Synthesis of linear ranking functions T. Margaria W. Yi Tools and Algorithms for Construction and Analysis of Systems (7th International Conference) TACAS 2001 Lecture Notes in Computer Science vol. 2031 2001 Springer-Verlag Berlin, Genova, Italy 67 81
16. T.H. Cormen, T.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 The MIT Press Cambridge, MA
17. P. Cousot Semantic foundations of program analysis S.S. Muchnick N.D. Jones Program Flow Analysis: Theory and Applications 1981 Prentice-Hall, Inc. Englewood Cliffs, NJ 303 342 (Chapter 10)
18. Static Analysis: 8th International Symposium P. Cousot SAS 2001 Lecture Notes in Computer Science vol. 2126 2001 Springer-Verlag Berlin, Paris, France
19. P. Cousot, and R. Cousot Static determination of dynamic properties of programs B. Robinet Proceedings of the Second International Symposium on Programming 1976 Dunod Paris, France 106 130
20. P. Cousot, and R. Cousot Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages 1977 ACM Press New York 238 252
21. P. Cousot, and R. Cousot Abstract interpretation frameworks Journal of Logic and Computation 2 4 1992 511 547
22. P. Cousot, and R. Cousot Comparing the Galois connection and widening/narrowing approaches to abstract interpretation M. Bruynooghe M. Wirsing Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming Lecture Notes in Computer Science vol. 631 1992 Springer-Verlag Berlin, Leuven, Belgium 269 295
23. P. Cousot, and N. Halbwachs Automatic discovery of linear restraints among variables of a program Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages 1978 ACM Press Tucson, Arizona 84 96
24. G. Delzanno, and A. Podelski Model checking in CLP R. Cleaveland Tools and Algorithms for Construction and Analysis of Systems (5th International Conference) TACAS'99 Lecture Notes in Computer Science vol. 1579 1999 Springer-Verlag Berlin, Amsterdam, The Netherlands 223 239
25. N. Dershowitz, and Z. Manna Proving termination with multiset orderings Communications of the ACM 22 8 1979 465 476
26. N. Dor, M. Rodeh, S. Sagiv, Cleanness checking of string manipulations in C programs via integer analysis, in: Cousot [18], pp. 194-212
27. N. Halbwachs Delay analysis in synchronous programs C. Courcoubetis Computer Aided Verification: Proceedings of the 5th International Conference Lecture Notes in Computer Science vol. 697 1993 Springer-Verlag Berlin, Elounda, Greece 333 346
28. N. Halbwachs, Détermination automatique de relations linéaires vérifiées par les variables d'un programme, Thèse de 3ème cycle d'informatique, Université scientifique et médicale de Grenoble, Grenoble, France, March 1979
29. N. Halbwachs, Y.-E. Proy, and P. Raymond Verification of linear hybrid systems by means of convex approximations B. Le Charlier Static Analysis: Proceedings of the 1st International Symposium Lecture Notes in Computer Science vol. 864 1994 Springer-Verlag Berlin, Namur, Belgium 223 237
30. N. Halbwachs, Y.-E. Proy, and P. Roumanoff Verification of real-time systems using linear relation analysis Formal Methods in System Design 11 2 1997 157 185
31. T.A. Henzinger, and P.-H. Ho A note on abstract interpretation strategies for hybrid automata P.J. Antsaklis W. Kohn A. Nerode S. Sastry Hybrid Systems II Lecture Notes in Computer Science vol. 999 1995 Springer-Verlag Berlin 252 264
32. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi HyTech: A model checker for hybrid systems Software Tools for Technology Transfer 1 1-2 1997 110 122
33. T.A. Henzinger, J. Preussig, and H. Wong-Toi Some lessons from the hytech experience Proceedings of the 40th Annual Conference on Decision and Control 2001 IEEE Computer Society Press 2887 2892
34. B. Jeannet Convex Polyhedra Library, release 1.1.3c edition Documentation of the "New Polka" library available at http://www.irisa.fr/prive/Bertrand.Jeannet/newpolka.html March 2002
35. H. Le Verge, A note on Chernikova's algorithm, Publication interne 635, IRISA, Campus de Beaulieu, Rennes, France, 1992
36. V. Loechner PolyLib: A library for manipulating parameterized polyhedra Available at http://icps.u-strasbg.fr/~loechner/polylib/ declares itself to be a continuation of [31], March 1999
37. Z. Manna, N.S. Bjørner, A. Browne, M. Colón, B. Finkbeiner, M. Pichora, H.B. Sipma, and T.E. Uribe An update on STeP: Deductive-algorithmic verification of reactive systems R. Berghammer Y. Lakhnech Tool Support for System Specification, Development and Verification, Advances in Computing Sciences 1999 Springer-Verlag Berlin 174 188
38. F. Mesnard, U. Neumerkel, Applying static analysis techniques for inferring termination conditions of logic programs, in: Cousot [18], pp. 93-110
39. T.S. Motzkin, H. Raiffa, G.L. Thompson, and R.M. Thrall The double description method H.W. Kuhn A.W. Tucker Contributions to the Theory of Games Annals of Mathematics Studies vol. II 1953 Princeton University Press Princeton, NJ 51 73
40. W. Pugh A practical algorithm for exact array dependence analysis Communications of the ACM 35 8 1992 102 114
41. D.K. Wilde, A library for doing polyhedral operations, Master's Thesis, Oregon State University, Corvallis, Oregon
42. Also published as IRISA Publication interne 785, Rennes, France, 1993 (Dec. 1993)