The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming

Volumn 72, Issue 1-2, 2008, Pages 3-21

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

^a UNIVERSITY OF PARMA   (Italy)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Abstract interpretation; Computer aided verification; Formal methods; Numerical properties; Static analysis

Indexed keywords

ABSTRACTING; COMPUTER SOFTWARE SELECTION AND EVALUATION; LIBRARIES; SET THEORY; VERIFICATION;

CONVEX POLYHEDRONS; ELSEVIER (CO); HARDWARE AND SOFTWARE; SOFTWARE DEVELOPMENT;

COMPUTER SOFTWARE;

EID: 45849140560     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2007.08.001     Document Type: Article

References (86)

1. Allen J.F., and Kautz H.A. A model of naive temporal reasoning. In: Hobbs J.R., and Moore R. (Eds). Formal Theories of the Commonsense World (1985), Ablex, Norwood, NJ 251-268
2. C. Ancourt, Génération automatique de codes de transfert pour multiprocesseurs à mémoires locales, Ph.D. Thesis, Université de Paris VI, Paris, France, March 1991
3. Avis D. Computational experience with the reverse search vertex enumeration algorithm. Optimization Methods and Software 10 (1998) 107-124
4. Avis D. lrs: A revised implementation of the reverse search vertex enumeration algorithm. In: Kalai G., and Ziegler G.M. (Eds). Polytopes - Combinatorics and Computation. Oberwolfach Seminars vol. 29 (2000), Birkhäuser-Verlag 177-198
5. Badros G.J., Borning A., and Stuckey P.J. The Cassowary linear arithmetic constraint solving algorithm. ACM Transactions on Computer-Human Interaction 8 4 (2001) 267-306
6. 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
7. Bagnara R. A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages. Science of Computer Programming 30 1-2 (1998) 119-155
8. R. Bagnara, K. Dobson, P.M. Hill, M. Mundell, E. Zaffanella, A practical tool for analyzing the distribution of numerical values, 2006. Available at: http://www.comp.leeds.ac.uk/hill/Papers/papers.html
9. Bagnara R., Dobson K., Hill P.M., Mundell M., and Zaffanella E. Grids: A domain for analyzing the distribution of numerical values. In: Puebla G. (Ed). Logic-based Program Synthesis and Transformation, 16th International Symposium. Lecture Notes in Computer Science vol. 4407 (2007), Springer-Verlag, Berlin, Venice, Italy
10. Bagnara R., Hill P.M., Mazzi E., and Zaffanella E. Widening operators for weakly-relational numeric abstractions. In: Hankin C., and Siveroni I. (Eds). Static Analysis: Proceedings of the 12th International Symposium. Lecture Notes in Computer Science vol. 3672 (2005), Springer-Verlag, Berlin, London, UK
11. Bagnara R., Hill P.M., Ricci E., and Zaffanella E. Precise widening operators for convex polyhedra. In: Cousot R. (Ed). Static Analysis: Proceedings of the 10th International Symposium. Lecture Notes in Computer Science vol. 2694 (2003), Springer-Verlag, Berlin, San Diego, California, USA
12. Bagnara R., Hill P.M., Ricci E., and Zaffanella E. Precise widening operators for convex polyhedra. Science of Computer Programming 58 1-2 (2005) 28-56
13. Bagnara R., Hill P.M., and Zaffanella E. Not necessarily closed convex polyhedra and the double description method. Formal Aspects of Computing 17 2 (2005) 222-257
14. R. Bagnara, P.M. Hill, E. Zaffanella, The Parma Polyhedra Library developer's manual, Department of Mathematics, University of Parma, Parma, Italy, release 0.9 ed., March 2006. Available at: http://www.cs.unipr.it/ppl/
15. R. Bagnara, P.M. Hill, E. Zaffanella, The Parma Polyhedra Library user's manual, Department of Mathematics, University of Parma, Parma, Italy, release 0.9 ed., March 2006. Available at: http://www.cs.unipr.it/ppl/
16. Bagnara R., Hill P.M., and Zaffanella E. Widening operators for powerset domains. Software Tools for Technology Transfer 8 4-5 (2006) 449-466 As the figures in the journal version of this paper have been improperly printed (rendering them useless), we recommend that interested readers download an electronic copy from this web site or contact one of the authors for a printed copy
17. R. Bagnara, P.M. Hill, E. Zaffanella, Applications of polyhedral computations to the analysis and verification of hardware and software systems, Quaderno 458, Dipartimento di Matematica, Università di Parma, Italy. Available at: http://www.cs.unipr.it/Publications/. Also published as arXiv:cs.CG/0701122, available from http://arxiv.org/, 2007
18. Bagnara R., Ricci E., Zaffanella E., and Hill P.M. Possibly not closed convex polyhedra and the Parma Polyhedra Library. In: Hermenegildo M.V., and Puebla G. (Eds). Static Analysis: Proceedings of the 9th International Symposium. Lecture Notes in Computer Science vol. 2477 (2002), Springer-Verlag, Berlin, Madrid, Spain
19. Bagnara R., Rodríguez-Carbonell E., and Zaffanella E. Generation of basic semi-algebraic invariants using convex polyhedra. In: Hankin C., and Siveroni I. (Eds). Static Analysis: Proceedings of the 12th International Symposium. Lecture Notes in Computer Science vol. 3672 (2005), Springer-Verlag, Berlin, London, UK
20. Balasundaram V., and Kennedy K. A technique for summarizing data access and its use in parallelism enhancing transformations. In: Knobe B. (Ed). Proceedings of the ACM SIGPLAN'89 Conference on Programming Language Design and Implementation (PLDI). ACM SIGPLAN Notices vol. 24(7) (1989), ACM Press, Portland, Oregon, USA
21. Bellman R. Dynamic Programming (1957), Princeton University Press
22. Bérard B., and Fribourg L. Reachability analysis of (timed) Petri nets using real arithmetic. In: Baeten J.C.M., and Mauw S. (Eds). CONCUR'99: Concurrency Theory, Proceedings of the 10th International Conference. Lecture Notes in Computer Science vol. 1664 (1999), Springer-Verlag, Berlin, Eindhoven, The Netherlands
23. Blanchet B., Cousot P., Cousot R., Feret J., Mauborgne L., Miné A., Monniaux D., and Rival X. A static analyzer for large safety-critical software. Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation. PLDI'03 (2003), ACM Press, San Diego, California, USA
24. Bozzano M., Bruttomesso R., Cimatti A., Junttila T.A., van Rossum P., Schulz S., and Sebastiani R. The MathSAT 3 system. In: Nieuwenhuis R. (Ed). Automated Deduction: Proceedings of the 20th International Conference. Lecture Notes in Computer Science vol. 3632 (2005), Springer-Verlag, Berlin, Tallinn, Estonia
25. Bremner D., Fukuda K., and Marzetta A. Primal-dual methods for vertex and facet enumeration. Discrete and Computational Geometry 20 3 (1998) 333-357
26. Bultan T., Gerber R., and Pugh W. 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
27. Chernikova N.V. Algorithm for finding a general formula for the non-negative solutions of system of linear equations. USSR Computational Mathematics and Mathematical Physics 4 4 (1964) 151-158
28. Chernikova N.V. Algorithm for finding a general formula for the non-negative solutions of system of linear inequalities. USSR Computational Mathematics and Mathematical Physics 5 2 (1965) 228-233
29. Chernikova N.V. Algorithm for discovering the set of all solutions of a linear programming problem. USSR Computational Mathematics and Mathematical Physics 8 6 (1968) 282-293
30. Cousot P. Semantic foundations of program analysis. In: Muchnick S.S., and Jones N.D. (Eds). Program Flow Analysis: Theory and Applications (1981), Prentice Hall, Englewood Cliffs, NJ, USA 303-342 (Chapter 10)
31. Cousot P., and Cousot R. Static determination of dynamic properties of programs. In: Robinet B. (Ed). Proceedings of the Second International Symposium on Programming (1976), Dunod, Paris, France, Paris, France
32. Cousot P., and Cousot R. 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
33. Cousot P., and Cousot R. Systematic design of program analysis frameworks. Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages (1979), ACM Press, New York
34. Cousot P., and Cousot R. Abstract interpretation frameworks. Journal of Logic and Computation 2 4 (1992) 511-547
35. Cousot P., and Cousot R. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In: Bruynooghe M., and Wirsing M. (Eds). 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
36. Cousot P., Cousot R., Feret J., Mauborgne L., Miné A., Monniaux D., and Rival X. The Astrée analyzer. In: Sagiv M. (Ed). Programming Languages and Systems, Proceedings of the 14th European Symposium on Programming. Lecture Notes in Computer Science vol. 3444 (2005), Springer-Verlag, Berlin, Edinburgh, UK
37. Cousot P., and Halbwachs N. 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
38. Davis E. Constraint propagation with interval labels. Artificial Intelligence 32 3 (1987) 281-331
39. Dill D.L. Timing assumptions and verification of finite-state concurrent systems. In: Sifakis J. (Ed). Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science vol. 407 (1989), Springer-Verlag, Berlin, Grenoble, France
40. Doose D., and Mammeri Z. Polyhedra-based approach for incremental validation of real-time systems. In: Yang L.T., Amamiya M., Liu Z., Guo M., and Rammig F.J. (Eds). Proceedings of the International Conference on Embedded and Ubiquitous Computing. EUC 2005. Lecture Notes in Computer Science vol. 3824 (2005), Springer-Verlag, Berlin, Nagasaki, Japan
41. Doyen L., Henzinger T.A., and Raskin J.-F. Automatic rectangular refinement of affine hybrid systems. In: Pettersson P., and Yi W. (Eds). Proceedings of the 3rd International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS 2005. Lecture Notes in Computer Science vol. 3829 (2005), Springer-Verlag, Berlin, Uppsala, Sweden
42. R. Ellenbogen, Fully automatic verification of absence of errors via interprocedural integer analysis, Master's Thesis, School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel, December 2004
43. G. Frehse, Compositional verification of hybrid systems with discrete interaction using simulation relations, in: Proceedings of the IEEE Conference on Computer Aided Control Systems Design, CACSD 2004, Taipei, Taiwan, 2004
44. Frehse G. PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Morari M., and Thiele L. (Eds). Hybrid Systems: Computation and Control: Proceedings of the 8th International Workshop. HSCC 2005. Lecture Notes in Computer Science vol. 3414 (2005), Springer-Verlag, Berlin, Zürich, Switzerland
45. G. Frehse, Z. Han, B. Krogh, Assume-guarantee reasoning for hybrid I/O-automata by over-approximation of continuous interaction, in: Proceedings of the 43rd IEEE Conference on Decision and Control, CDC 2004, Atlantis, Paradise Island, Bahamas, 2004
46. Frehse G., Krogh B.H., and Rutenbar R.A. Verifying analog oscillator circuits using forward/backward refinement. Proceedings of the 9th Conference on Design, Automation and Test in Europe. DATE 06 (2006), ACM SIGDA, Munich, Germany CD-ROM publication
47. Frehse G., Krogh B.H., Rutenbar R.A., and Maler O. Time domain verification of oscillator circuit properties. Proceedings of the First Workshop on Formal Verification of Analog Circuits. FAC 2005. Electronic Notes in Theoretical Computer Science vol. 153 (2006), Elsevier Science B.V, Edinburgh, Scotland
48. Fukuda K., and Prodon A. Double description method revisited. In: Deza M., Euler R., and Manoussakis Y. (Eds). Combinatorics and Computer Science, 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3-5, 1995, Selected Papers. Lecture Notes in Computer Science vol. 1120 (1996), Springer-Verlag, Berlin
49. Gopan D., DiMaio F., Dor N., Reps T., and Sagiv M. Numeric domains with summarized dimensions. In: Jensen K., and Podelski A. (Eds). Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference. TACAS 2004. Lecture Notes in Computer Science vol. 2988 (2004), Springer-Verlag, Berlin, Barcelona, Spain
50. D. Gopan, T.W. Reps, M. Sagiv, A framework for numeric analysis of array operations, in: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Long Beach, California, USA, 2005
51. Granger P. Static analysis of linear congruence equalities among variables of a program. In: Abramsky S., and Maibaum T.S.E. (Eds). TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming. CAAP'91. Lecture Notes in Computer Science vol. 493 (1991), Springer-Verlag, Berlin, Brighton, UK
52. Granger P. Static analyses of congruence properties on rational numbers (extended abstract). In: Van Hentenryck P. (Ed). Static Analysis: Proceedings of the 4th International Symposium. Lecture Notes in Computer Science vol. 1302 (1997), Springer-Verlag, Berlin, Paris, France
53. ème cycle d'informatique, Université scientifique et médicale de Grenoble, Grenoble, France, March 1979
54. Halbwachs N. Delay analysis in synchronous programs. In: Courcoubetis C. (Ed). Computer Aided Verification: Proceedings of the 5th International Conference. Lecture Notes in Computer Science vol. 697 (1993), Springer-Verlag, Berlin, Elounda, Greece
55. N. Halbwachs, A. Kerbrat, Y.-E. Proy, POLyhedra INtegrated environment, Verimag, France, version 1.0 of POLINE ed., documentation taken from source code, September 1995
56. Halbwachs N., Merchat D., and Parent-Vigouroux C. Cartesian factoring of polyhedra in linear relation analysis. In: Cousot R. (Ed). Static Analysis: Proceedings of the 10th International Symposium. Lecture Notes in Computer Science vol. 2694 (2003), Springer-Verlag, Berlin, San Diego, California, USA
57. Halbwachs N., Proy Y.-E., and Raymond P. Verification of linear hybrid systems by means of convex approximations. In: Le Charlier B. (Ed). Static Analysis: Proceedings of the 1st International Symposium. Lecture Notes in Computer Science vol. 864 (1994), Springer-Verlag, Berlin, Namur, Belgium
58. Halbwachs N., Proy Y.-E., and Roumanoff P. Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11 2 (1997) 157-185
59. Henzinger T.A., and Ho P.-H. A note on abstract interpretation strategies for hybrid automata. In: Antsaklis P.J., Kohn W., Nerode A., and Sastry S. (Eds). Hybrid Systems II. Lecture Notes in Computer Science vol. 999 (1995), Springer-Verlag, Berlin
60. Henzinger T.A., Ho P.-H., and Wong-Toi H. HyTech: A model checker for hybrid systems. Software Tools for Technology Transfer 1 1 +2 (1997) 110-122
61. Henzinger T.A., Preussig J., and Wong-Toi H. Some lessons from the hytech experience. Proceedings of the 40th Annual Conference on Decision and Control (2001), IEEE Computer Society Press
62. Hymans C., and Upton E. Static analysis of gated data dependence graphs. In: Giacobazzi R. (Ed). Static Analysis: Proceedings of the 11th International Symposium. Lecture Notes in Computer Science vol. 3148 (2004), Springer-Verlag, Berlin, Verona, Italy
63. B. Jeannet, Convex polyhedra library, release 1.1.3c ed., documentation of the New Polka library, March 2002. Available at: http://www.irisa.fr/prive/Bertrand.Jeannet/newpolka.html
64. C. Kruegel, E. Kirda, D. Mutz, W. Robertson, G. Vigna, Automating mimicry attacks using static binary analysis, in: Proceedings of Security '05, the 14th USENIX Security Symposium, Baltimore, MD, USA, 2005
65. Larsen K., Larsson F., Pettersson P., and Yi W. Efficient verification of real-time systems: Compact data structure and state-space reduction. Proceedings of the 18th IEEE Real-Time Systems Symposium. RTSS'97 (1997), IEEE Computer Society Press, San Francisco, CA
66. H. Le Verge, A note on Chernikova's algorithm, Publication interne 635, IRISA, Campus de Beaulieu, Rennes, France, 1992
67. 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 [86], March 1999
68. Mesnard F., and Bagnara R. cTI: A constraint-based termination inference tool for ISO-Prolog. Theory and Practice of Logic Programming 5 1-2 (2005) 243-257
69. Miné A. The octagon abstract domain. Proceedings of the Eighth Working Conference on Reverse Engineering. WCRE'01 (2001), IEEE Computer Society Press, Stuttgart, Germany
70. A. Miné, Weakly relational numerical abstract domains, Ph.D. Thesis, École Polytechnique, Paris, France, March 2005
71. Motzkin T.S., Raiffa H., Thompson G.L., and Thrall R.M. The double description method. In: Kuhn H.W., and Tucker A.W. (Eds). Contributions to the Theory of Games-Volume II. Annals of Mathematics Studies vol. 28 (1953), Princeton University Press, Princeton, New Jersey 51-73
72. Nakanishi T., and Fukuda A. Modulo interval arithmetic and its application to program analysis. Transactions of Information Processing Society of Japan 42 4 (2001) 829-837
73. Nakanishi T., Joe K., Polychronopoulos C.D., and Fukuda A. The modulo interval: A simple and practical representation for program analysis. Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques (1999), IEEE Computer Society, Newport Beach, California, USA
74. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization (1988), John Wiley & Sons
75. P. Quinton, S. Rajopadhye, T. Risset, On manipulating Z-polyhedra, Tech. Rep. 1016, IRISA, Campus Universitaire de Bealieu, Rennes, France, July 1996
76. Quinton P., Rajopadhye S., and Risset T. On manipulating Z-polyhedra using a canonic representation. Parallel Processing Letters 7 2 (1997) 181-194
77. Sankaranarayanan S., Colón M., Sipma H.B., and Manna Z. Efficient strongly relational polyhedral analysis. In: Emerson E.A., and Namjoshi K.S. (Eds). Verification, Model Checking and Abstract Interpretation: Proceedings of the 7th International Conference. VMCAI 2006. Lecture Notes in Computer Science vol. 3855 (2006), Springer-Verlag, Berlin, Charleston, SC, USA
78. Sankaranarayanan S., Sipma H.B., and Manna Z. Constraint-based linear-relations analysis. In: Giacobazzi R. (Ed). Static Analysis: Proceedings of the 11th International Symposium. Lecture Notes in Computer Science vol. 3148 (2004), Springer-Verlag, Berlin, Verona, Italy
79. Sankaranarayanan S., Sipma H.B., and Manna Z. Scalable analysis of linear systems using mathematical programming. In: Cousot R. (Ed). Verification, Model Checking and Abstract Interpretation: Proceedings of the 6th International Conference. VMCAI 2005. Lecture Notes in Computer Science vol. 3385 (2005), Springer-Verlag, Berlin, Paris, France
80. Sankaranarayanan S., Sipma H.B., and Manna Z. Fixed point iteration for computing the time elapse operator. In: Hespanha J., and Tiwari A. (Eds). Hybrid Systems: Computation and Control: Proceedings of the 9th International Workshop. HSCC 2006. Lecture Notes in Computer Science vol. 3927 (2006), Springer-Verlag, Berlin, Santa Barbara, CA, USA
81. Shaham R., Kolodner E.K., and Sagiv S. Automatic removal of array memory leaks in Java. In: Watt D.A. (Ed). Proceedings of the 9th International Conference on Compiler Construction. CC 2000. Lecture Notes in Computer Science vol. 1781 (2000), Springer-Verlag, Berlin, Berlin, Germany
82. Song H., Compton K.J., and Rounds W.C. SPHIN: A model checker for reconfigurable hybrid systems based on SPIN. In: Lazic R., and Nagarajan R. (Eds). Proceedings of the 5th International Workshop on Automated Verification of Critical Systems. Electronic Notes in Theoretical Computer Science vol. 145 (2006), University of Warwick, UK
83. Stoer J., and Witzgall C. Convexity and Optimization in Finite Dimensions I (1970), Springer-Verlag, Berlin
84. van Hee K., Oanea O., Sidorova N., and Voorhoeve M. Verifying generalized soundness for workflow nets. In: Virbitskaite I., and Voronkov A. (Eds). Perspectives of System Informatics: Proceedings of the Sixth International Andrei Ershov Memorial Conference. Lecture Notes in Computer Science vol. 4378 (2006), Springer-Verlag, Berlin, Akademgorodok, Novosibirsk, Russia
85. Venet A., and Brat G. Precise and efficient static array bound checking for large embedded C programs. Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation. PLDI'04 (2004), ACM Press, Washington, DC, USA
86. D.K. Wilde, A library for doing polyhedral operations, Master's Thesis, Oregon State University, Corvallis, Oregon, also published as IRISA Publication interne 785, Rennes, France, 1993, December 1993