Applications of polyhedral computations to the analysis and verification of hardware and software systems

Theoretical Computer Science

Volumn 410, Issue 46, 2009, Pages 4672-4691

  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; Static analysis

Indexed keywords

ABSTRACT INTERPRETATION; CONVEX POLYHEDRONS; HARDWARE AND SOFTWARE; MISSION CRITICAL SYSTEMS; THEORETICAL INVESTIGATIONS; WIDE SPECTRUM;

ABSTRACTING; STATIC ANALYSIS; VERIFICATION;

COMPUTER AIDED ANALYSIS;

EID: 70349632198     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.07.033     Document Type: Article

References (79)

1. Alefeld G., and Herzberger J. Introduction to Interval Computation (1983), Academic Press, New York
2. Alur R., Courcoubetis C., Henzinger T.~A., and Ho P.-H. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. Hybrid Systems I. Lecture Notes in Computer Science vol. 736 (1993)
3. C. Ancourt, Génération automatique de codes de transfert pour multiprocesseurs à mémoires locales, Ph.D. Thesis, Université de Paris VI, Paris, France, Mar. 1991
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. Avis D., and Bremner D. How good are convex hull algorithms?. Proceedings of the Eleventh Annual Symposium on Computational Geometry (1995), ACM Press, Vancouver, B.C., Canada
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, Mar. 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. 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
9. R. Bagnara, P. M. Hill, A. Pescetti, E. Zaffanella, On the design of generic static analyzers for modern imperative languages, Tech. Rep. arXiv:cs.PL/0703116, Dipartimento di Matematica, Università di Parma, Italy, 2007. Available from http://arxiv.org/
10. 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
11. 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
12. Bagnara R., Hill P.~M., and Zaffanella E. Widening operators for powerset domains. Software Tools for Technology Transfer 8 4/5 (2006) 449-466. http://www.cs.unipr.it/ppl/ 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 the PPL's web site at http://www.cs.unipr.it/ppl/
13. R. Bagnara, P. M. Hill, E. Zaffanella, Applications of polyhedral computations to the analysis and verification of hardware and software systems, arXiv:cs.CG/0701122, available from http://arxiv.org/. 2007
14. Bagnara R., Hill P.~M., and Zaffanella E. 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 72 1-2 (2008) 3-21
15. 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
16. Bellman R. Dynamic Programming (1957), Princeton University Press
17. Bemporad A., Fukuda K., and Torrisi F.D. Convexity recognition of the union of polyhedra. Computational Geometry: Theory and Applications 18 3 (2001) 141-154
18. Benoy F., and King A. Inferring argument size relationships with CLP(R). In: Gallagher J.P. (Ed). Logic Program Synthesis and Transformation: Proceedings of the 6th International Workshop. Lecture Notes in Computer Science vol. 1207 (1997), Springer-Verlag, Berlin, Stockholm, Sweden
19. Besson F., Jensen T.~P., and Talpin J.-P. Polyhedral analysis for synchronous languages. In: Cortesi A., and Filé G. (Eds). Static Analysis: Proceedings of the 6th International Symposium. Lecture Notes in Computer Science vol. 1694 (1999), Springer-Verlag, Berlin, Venice, Italy
20. Birkhoff G. Lattice Theory. 3rd ed. Colloquium Publications vol. XXV (1967), American Mathematical Society, Providence, RI, USA
21. 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
22. 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
23. Chernikova N.~V. 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
24. Colón M.~A., and Sipma H.~B. Synthesis of linear ranking functions. In: Margaria T., and Yi W. (Eds). 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
25. Cortesi A., Le Charlier B., and Van Hentenryck P. Combinations of abstract domains for logic programming: Open product and generic pattern construction. Science of Computer Programming 38 1-3 (2000) 27-71
26. Cousot P. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite 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
27. 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
28. 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
29. Cousot P., and Cousot R. Abstract interpretation frameworks. Journal of Logic and Computation 2 4 (1992) 511-547
30. Cousot P., and Cousot R. Inductive definitions, semantics and abstract interpretation. Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages (1992), ACM Press, Albuquerque, New Mexico, USA
31. 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
32. Davis E. Constraint propagation with interval labels. Artificial Intelligence 32 3 (1987) 281-331
33. Delzanno G., and Podelski A. Model checking in CLP. In: Cleaveland R. (Ed). 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
34. 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
35. Dor N., Rodeh M., and Sagiv S. Cleanness checking of string manipulations in C programs via integer analysis. In: Cousot P. (Ed). Static Analysis: 8th International Symposium, SAS 2001. Lecture Notes in Computer Science vol. 2126 (2001), Springer-Verlag, Berlin, Paris, France
36. 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
37. 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, Dec. 2004
38. 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
39. 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
40. 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
41. Gopan D., Reps T.W., and Sagiv M. A framework for numeric analysis of array operations. Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2005), Long Beach, California, USA
42. Granger P. Improving the results of static analyses programs by local decreasing iteration. In: Shyamasundar R.K. (Ed). Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science vol. 652 (1992), Springer-Verlag, Berlin, New Delhi, India
43. 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
44. Gulavani B.~S., and Rajamani S.~K. Counterexample driven refinement for abstract interpretation. In: Hermanns H., and Palsberg J. (Eds). Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science vol. 3920 (2006), Springer-Verlag, Berlin, Vienna, Austria
45. 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
46. Halbwachs N., Merchat D., and Gonnord L. Some ways to reduce the space dimension in polyhedra computations. Formal Methods in System Design 29 1 (2006) 79-95
47. 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
48. Hartong W., Hedrich L., and Barke E. On discrete modeling and model checking for nonlinear analog systems. In: Brinksma E., and Larsen K.G. (Eds). Computer Aided Verification: Proceedings of the 14th International Conference. Lecture Notes in Computer Science vol. 2404 (2002), Springer-Verlag, Berlin, Copenhagen, Denmark
49. Henzinger T.A. The theory of hybrid automata. Proceedings of the 11th Annual Symposium on Logic in Computer Science. LICS (1996), IEEE Computer Society Press
50. 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
51. 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
52. 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
53. 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
54. Kahn G. Natural semantics. In: Brandenburg F.-J., Vidal-Naquet G., and Wirsing M. (Eds). Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 247 (1987), Springer-Verlag, Berlin, Passau, Germany
55. Karr M. Affine relationships among variables of a program. Acta Informatica 6 (1976) 133-151
56. Krishnan K., and Mitchell J. A unifying framework for several cutting plane methods for semidefinite programming. Optimization Methods and Software 21 1 (2006) 57-74
57. 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
58. Lassez J.-L., and Maher M.J. On Fourier's algorithm for linear arithmetic constraints. Journal of Automated Reasoning 9 3 (1992) 373-379
59. Le Verge H. A note on Chernikova's algorithm. Publication interne 635 (1992), IRISA, Campus de Beaulieu, Rennes, France
60. 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 [79], Mar. 1999
61. 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
62. A. Miné, Weakly relational numerical abstract domains, Ph.D. Thesis, École Polytechnique, Paris, France, Mar. 2005
63. 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, No. 28. Annals of Mathematics Studies (1953), Princeton University Press, Princeton, New Jersey 51-73
64. 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. IEEE Computer Society (1999), Newport Beach, California, USA
65. Nookala S.P.K., and Risset T. A library for Z-polyhedral operations. Publication Interne 1330 (2000), IRISA, Campus de Beaulieu, Rennes, France
66. G. Plotkin, A structural approach to operational semantics, Tech. Rep. DAIMI FN-19, Computer Science Department, University of Aarhus, Denmark, 1981
67. P. Quinton, S. Rajopadhye, T. Risset, On manipulating Z-polyhedra, Tech. Rep. 1016, IRISA, Campus Universitaire de Bealieu, Rennes, France, Jul. 1996
68. 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
69. 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
70. Schmidt D.A. Natural-semantics-based abstract interpretation (preliminary version). In: Mycroft A. (Ed). Static Analysis: Proceedings of the 2nd International Symposium. Lecture Notes in Computer Science vol. 983 (1995), Springer-Verlag, Berlin, Glasgow, UK
71. Schrijver A. Theory of Linear and Integer Programming, Wiley Interscience Series in Discrete Mathematics and Optimization (1999), John Wiley & Sons
72. 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
73. Simon A., King A., and Howe J.M. Two variables per linear inequality as an abstract domain. In: Leuschel M. (Ed). Logic Based Program Synthesis and Tranformation, 12th International Workshop. Lecture Notes in Computer Science vol. 2664 (2002), Springer-Verlag, Berlin, Madrid, Spain
74. Sohn K., and Van Gelder A. Termination detection in logic programs using argument sizes (extended abstract). Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1991), ACM, Association for Computing Machinery, Denver, Colorado, United States
75. 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
76. Stoer J., and Witzgall C. Convexity and Optimization in Finite Dimensions I (1970), Springer-Verlag, Berlin
77. 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
78. 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
79. 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, Dec. 1993