Efficient strongly relational polyhedral analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3855 LNCS, Issue , 2006, Pages 111-125

  Sankaranarayanan, Sriram ^a,c   Colon, Michael A ^b   Sipma, Henny ^c   Manna, Zohar ^c  

^a NEC LABORATORIES AMERICA   (United States)

^b NAVAL RESEARCH LABORATORY   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX HULL LIMITS; LINEAR EQUALITIES; POLYHEDRAL ANALYSIS; RELATIONAL POLYHEDRAL ANALYSIS;

C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; IMAGE ANALYSIS; INVARIANCE; POLYNOMIAL APPROXIMATION; SET THEORY; USER INTERFACES;

RELATIONAL DATABASE SYSTEMS;

EID: 33745678037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. BAGNARA, R., HILL, P. M., RICCI, E., AND ZAFFANELLA, E. Precise widening operators for convex polyhedra. In Static Analysis Symposium (2003), vol. 2694 of LNCS, Springer-Verlag, pp. 337-354.
2. BAGNARA, R., RICCI, E., ZAFFANELLA, E., AND HILL, P. M. Possibly not closed convex polyhedra and the Parma Polyhedra Library. In SAS (2002), vol. 2477 of LNCS, Springer-Verlag, pp. 213-229.
3. BARDIN, S., FINKEL, A., LEROUX, J., AND PETRUCCI, L. FAST: Fast accelereation of symbolic transition systems. In Computer-aided Verification (July 2003), vol. 2725 of LNCS, Springer-Verlag.
4. BESSON, F., JENSEN, T., AND TALPIN, J.-P. Polyhedral analysis of synchronous languages. In Static Analysis Symposium (1999), vol. 1694 of LNCS, pp. 51-69.
5. CHVÁTAL, V. Linear Programming. Freeman, 1983.
6. CLARISÓ, R., AND CORTADELLA, J. The octahedron abstract domain. In Static Analysis Symposium (2004), vol. 3148 of LNCS, Springer-Verlag, pp. 312-327.
7. COUSOT, P., AND COUSOT, R. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming (1976), Dunod, Paris, France, pp. 106-130.
8. COUSOT, P., AND COUSOT, R. Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Principles of Programming Languages (1977), pp. 238-252.
9. COUSOT, P., AND HALBWACHS, N. Automatic discovery of linear restraints among the variables of a program. In ACM POPL (Jan. 1978), pp. 84-97.
10. DANTZIG, G. B. Programming in Linear Structures. USAF, 1948.
11. DOR, N., RODEH, M., AND SAGIV, M. CSSV: Towards a realistic tool for statically detecting all buffer overflows in C. In Proc. PLDI'03 (2003), ACM Press.
12. HALBWACHS, N., PROY, Y., AND ROUMANOFF, P. Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11 (1997), 157-185.
13. JEANNET, B. The convex polyhedra library NEW POLKA. Available online from http://www.irisa.fr/prive/Bertrand.Jeannet/newpolka.html.
14. KARR, M. Affine relationships among variables of a program. Acta Inf. 6 (1976), 133-151.
15. MAKHORIN, A. The GNU Linear Programming Kit (GLPK), 2000. Available online from http://www.gnu.org/software/glpk/glpk.html.
16. MANNA, Z. Mathematical Theory of Computation. McGraw-Hill, 1974.
17. MINÉ, A. A new numerical abstract domain based on difference-bound matrices. In PADO II (May 2001), vol. 2053 of LNCS, Springer-Verlag, pp. 155-172.
18. SANKARANARAYANAN, S., SIPMA, H. B., AND MANNA, Z. Scalable analysis of linear systems using mathematical programming. In Verification, Model-Checking and Abstract-Interpretation (VMCAI 2005) (January 2005), vol. 3385 of LNCS.
19. SIMON, A., KING, A., AND HOWE, J. M. Two variables per linear inequality as an abstract domain. In LOPSTR (2003), vol. 2664 of Lecture Notes in Computer Science, Springer, pp. 71-89.