Exact join detection for convex polyhedra and other numerical abstractions

Computational Geometry: Theory and Applications

Volumn 43, Issue 5, 2010, Pages 453-473

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

^a UNIVERSITY OF PARMA   (Italy)

Author keywords

Abstract interpretation; Convexity; Numerical abstraction; Polyhedron; Powerset domain; Union

Indexed keywords

EID: 84867973791     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2009.09.002     Document Type: Article

References (46)

1. S. Abramsky, and A. Jung Domain theory S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, Handbook of Logic in Computer Science vol. 3 1994 Clarendon Press Oxford, UK 1 168 Ch. 1
2. R. Bagnara A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages Sci. Comput. Programming 30 1-2 1998 119 155
3. R. Bagnara, P.M. Hill, E. Mazzi, and E. Zaffanella Widening operators for weakly-relational numeric abstractions C. Hankin, I. Siveroni, Static Analysis: Proceedings of the 12th International Symposium Lecture Notes in Computer Science vol. 3672 2005 Springer-Verlag Berlin, London, UK 3 18
4. R. Bagnara, P.M. Hill, and E. Zaffanella Not necessarily closed convex polyhedra and the double description method Formal Aspects Comput. 17 2 2005 222 257
5. R. Bagnara, P.M. Hill, and E. Zaffanella Widening operators for powerset domains Software Tools Technol. Transfer 8 4/5 2006 449 466 in the printed version of this article, all the figures have been improperly printed (rendering them useless). See [6]
6. R. Bagnara, P.M. Hill, and E. Zaffanella Widening operators for powerset domains Software Tools Technol. Transfer 9 3/4 2007 413 414 erratum to [5] containing all the figures properly printed
7. R. Bagnara, P.M. Hill, and E. Zaffanella An improved tight closure algorithm for integer octagonal constraints F. Logozzo, D. Peled, L. Zuck, Verification, Model Checking and Abstract Interpretation: Proceedings of the 9th International Conference (VMCAI 2008) Lecture Notes in Computer Science vol. 4905 2008 Springer-Verlag Berlin, San Francisco, USA 8 21
8. R. Bagnara, P.M. Hill, and E. Zaffanella The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems Sci. Comput. Programming 72 1-2 2008 3 21
9. R. Bagnara, P.M. Hill, and E. Zaffanella Applications of polyhedral computations to the analysis and verification of hardware and software systems Theoret. Comput. Sci. 410 46 2009
10. R. Bagnara, P.M. Hill, and E. Zaffanella Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness Available online at http://www.springerlink.com/content/d40842574t1r5877/ Formal Methods Syst. Des., 2009, in press
11. V. Balasundaram, and K. Kennedy A technique for summarizing data access and its use in parallelism enhancing transformations B. Knobe, 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 41 53
12. I. Bárány, and K. Fukuda A case when the union of polytopes is convex Linear Algebra Appl. 397 2005 381 388
13. C. Bastoul Code generation in the polyhedral model is easier than you think Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques (PACT 2004) 2004 IEEE Computer Society Antibes Juan-les-Pins, France 7 16
14. A. Bemporad, K. Fukuda, and F.D. Torrisi Convexity recognition of the union of polyhedra Report AUT00-13 2000 Automatic Control Laboratory ETHZ, Zurich, Switzerland
15. A. Bemporad, K. Fukuda, and F.D. Torrisi Convexity recognition of the union of polyhedra Comput. Geom. Theory Appl. 18 3 2001 141 154
16. A. Bemporad, M. Morari, V. Dua, and E.N. Pistikopoulos The explicit linear quadratic regulator for constrained systems Automatica 38 1 2002 3 20 corrected in [17]
17. A. Bemporad, M. Morari, V. Dua, and E.N. Pistikopoulos Corrigendum to: The explicit linear quadratic regulator for constrained systems Automatica 38 1 2002 3 20
18. A. Bemporad, M. Morari, V. Dua, and E.N. Pistikopoulos Corrigendum to: The explicit linear quadratic regulator for constrained systems Automatica 39 10 2003 1845 1846 corrigendum to [16]
19. T. Bultan, R. Gerber, and W. Pugh Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results ACM Trans. Programming Lang. Sys. 21 4 1999 747 789
20. N.V. Chernikova Algorithm for finding a general formula for the non-negative solutions of system of linear equations Comput. Math. Math. Phys. 4 4 1964 151 158
21. N.V. Chernikova Algorithm for finding a general formula for the non-negative solutions of system of linear inequalities Comput. Math. Math. Phys. 5 2 1965 228 233
22. N.V. Chernikova Algorithm for discovering the set of all solutions of a linear programming problem Comput. Math. Math. Phys. 8 6 1968 282 293
23. R. Clarisó, and J. Cortadella The octahedron abstract domain R. Giacobazzi, Static Analysis: Proceedings of the 11th International Symposium Lecture Notes in Computer Science vol. 3148 2004 Springer-Verlag Berlin, Verona, Italy 312 327
24. 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
25. 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
26. P. Cousot, and R. Cousot Systematic design of program analysis frameworks Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages 1979 ACM Press New York 269 282
27. P. Feautrier Parametric integer programming RAIRO Recherche Opérationnelle 22 3 1988 243 268
28. G. Frehse, B.H. Krogh, and R.A. Rutenbar 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
29. K. Fukuda, T.M. Liebling, and C. Lütolf Extended convex hull Comput. Geom. Theory Appl. 20 1-2 2001 13 23
30. C.N. Jones Polyhedral tools for control Jul. 2005 Ph.D. thesis, Department of Engineering, University of Cambridge Cambridge, U.K
31. S.K. Lahiri, and M. Musuvathi An efficient decision procedure for UTVPI constraints B. Gramlich, Frontiers of Combining Systems: Proceedings of the 5th International Workshop, FroCoS 2005 Lecture Notes in Artificial Intelligence vol. 3717 2005 Springer-Verlag Berlin, Vienna, Austria 168 183
32. K. Larsen, F. Larsson, P. Pettersson, and W. Yi 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 14 24
33. H. Le Verge A Note on Chernikova's Algorithm Publication interne 635 1992 IRISA, Campus de Beaulieu Rennes, France
34. F. Logozzo, and M. Fähndrich Pentagons: A weakly relational abstract domain for the efficient validation of array accesses Proceedings of the 2008 ACM Symposium on Applied Computing (SAC 2008) 2008 ACM Press Fortaleza, Ceará, Brazil 184 188
35. A. Miné A new numerical abstract domain based on difference-bound matrices O. Danvy, A. Filinski, Proceedings of the 2nd Symposium on Programs as Data Objects (PADO 2001) Lecture Notes in Computer Science vol. 2053 2001 Springer-Verlag Berlin, Aarhus, Denmark 155 172
36. A. Miné The octagon abstract domain Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01) 2001 IEEE Computer Society Press Stuttgart, Germany 310 319
37. A. Miné Weakly relational numerical abstract domains. Ph.D. thesis Mar. 2005 École Polytechnique Paris, France
38. 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, Volume II Annals of Mathematics Studies vol. 28 1953 Princeton University Press Princeton, New Jersey 51 73
39. T. Nakanishi, and A. Fukuda Modulo interval arithmetic and its application to program analysis Trans. Inf. Process. Soc. Jpn. 42 4 2001 829 837
40. T. Nakanishi, K. Joe, C.D. Polychronopoulos, and A. Fukuda 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 91 96
41. S. Sankaranarayanan, T. Dang, and F. Ivančić Symbolic model checking of hybrid systems using template polyhedra C.R. Ramakrishnan, J. Rehof, Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008 Lecture Notes in Computer Science vol. 4963 2008 Springer-Verlag Berlin, Budapest, Hungary 188 202
42. R. Sen, and Y.N. Srikant Executable analysis using abstract interpretation with circular linear progressions Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2007) 2007 IEEE Computer Society Press Nice, France 39 48
43. A. Simon Value-Range Analysis of C Programs: Towards Proving the Absence of Buffer Overflow Vulnerabilities 2008 Springer-Verlag Berlin
44. A. Simon, A. King, and J.M. Howe Two variables per linear inequality as an abstract domain M. Leuschel, Logic Based Program Synthesis and Tranformation, 12th International Workshop Lecture Notes in Computer Science vol. 2664 2002 Springer-Verlag Berlin, Madrid, Spain 71 89
45. J. Stoer, and C. Witzgall Convexity and Optimization in Finite Dimensions I 1970 Springer-Verlag Berlin
46. F.D. Torrisi, Modeling and reach-set computation for analysis and optimal control of discrete hybrid automata, Doctoral thesis, Swiss Federal Institute of Technology, Zürich, Switzerland, 2003