Widening operators for weakly-relational numeric abstractions

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

Volumn 3672 LNCS, Issue , 2005, Pages 3-18

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

^a UNIVERSITY OF PARMA   (Italy)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; GEOMETRY; SEMANTICS;

CONSTRAINT NETWORKS; NUMERIC ABSTRACTIONS; SEMANTIC ABSTRACT DOMAINS; SYNTACTIC EXPRESSIONS;

NUMERICAL ANALYSIS;

EID: 33646030329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11547662_3     Document Type: Conference Paper

References (33)

1. A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM Journal on Computing, 1(2):131-137, 1972.
2. J. F. Allen and H. A. Kautz. A model of naive temporal reasoning. In Formal Theories of the Commonsense World, pp. 251-268. Ablex, Norwood, N.J, 1985.
3. R. Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy, 1997.
4. R. Bagnara, R. Giacobazzi, and G. Levi. Static analysis of CLP programs over numeric domains. In Proc. WSA 1992, vol. 81-82 of Bigre, pp. 43-50, Bordeaux.
5. R. Bagnara, R. Giacobazzi, and G. Levi. An application of constraint propagation to data-flow analysis. In Proc. CAIA 1993, pp. 270-276, Orlando, FL.
6. R. Bagnara, P. M. Hill, E. Mazzi, and E. Zaffanella. Widening operators for weakly-relational numeric abstractions. Quaderno 399, Dipartimento di Matematica, Univ. di Parma, Italy, 2005. Available at http://www.cs.unipr.it/Publications/.
7. R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella. Precise widening operators for convex polyhedra. In Proc. SAS 2003, vol. 2694 of LNCS, pp. 337-354, San Diego.
8. R. Bagnara, P. M. Hill, E. Ricci, and E. Zaffanella. Precise widening operators for convex polyhedra. Science of Computer Programming, 2005. To appear.
9. R. Bagnara, P. M. Hill, and E. Zaffanella. Widening operators for powerset domains. In Proc. VMCAI 2004, vol. 2937 of LNCS, pp. 135-148, Venice, Italy.
10. R. Bagnara, P. M. Hill, arid E. Zaffanella. The Parma Polyhedra Library User's Manual. Department of Mathematics, University of Parma, release 0.7, 2004.
11. V. Balasundaram and K. Kennedy. A technique for summarizing data access and its use in parallelism enhancing transformations. In Proc. PLDI 1989, vol. 24(7) of ACM SIGPLAN Notices, pp. 41-53, Portland, OR.
12. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
13. G. Birkhoff. Lattice Theory. American Mathematical Society, 3rd edition, 1967.
14. B. Blanchet, P. Cousot, R. Cousot, J. Feret et al., A static analyzer for large safety-critical software. In Proc. PLDI 2003, pp. 196-207, San Diego, CA.
15. R. Clarisó and J. Cortadella. The octahedron abstract domain. In Proc. SAS 2004, vol. 3148 of LNCS, pp. 312-327, Verona, Italy.
16. P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proc. ISOP 1976, pp. 106-130, Paris, Prance.
17. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. POPL 1977, pp. 238-252, New York.
18. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. POPL 1979, pp. 269-282, New York.
19. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. POPL 1978, pp. 84-96, Tucson, AR.
20. E. Davis. Constraint propagation with interval labels. Artificial Intelligence, 32(3):281-331, 1987.
21. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proc. AVMFSS 1989, vol. 407 of LNCS, pp. 197-212, Grenoble, France.
22. N. Halbwachs. Détermination Automatique de Relations Linéaires Vérifiées par les Variables d'un Programme. PhD thesis, Université de Grenoble, France, 1979.
23. N. Halbwachs, Y.-E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Form. Method Syst. Des., 11 (2): 157-185, 1997.
24. K. Larsen, F. Larsson, P. Pettersson, and W. Yi. Efficient verification of real-time systems: Compact data structure and state-space reduction. In Proc. RTSS 1997, pp. 14-24, San Francisco, CA.
25. A. Miné. A new numerical abstract domain based on difference-bound matrices. In Proc. PADO 2001, vol. 2053 of LNCS, pp. 155-172, Aarhus, Denmark.
26. A. Miné. The octagon abstract domain. In Proc. WCRE'01, pp. 310-319, Stuttgart.
27. A. Miné. A few graph-based relational numerical abstract domains. In Proc. SAS 2002, vol. 2477 of LNCS, pp. 117-132, Madrid, Spain.
28. A. Miné. The Octagon Abstract Domain Library. École Normale Supérieure, Paris, France, release 0.9.6, 2002. Available at http://www.di.ens.fr/~mine/oct/.
29. A. Mine. Relational abstract domains for the detection of floating-point run-time errors. In Proc. ESOP 2004, vol. 2986 of LNCS, pp. 3-17, Barcelona, Spain.
30. A. Mine. Weakly Relational Numerical Abstract Domains. PhD thesis, École Polytechnique, Paris, France, 2005.
31. S. Sankaranarayanan, H. Sipma, and Z. Manna. Scalable analysis of linear systems using mathematical programming. In Proc. VMCAI 2005, pp. 25-41, Paris, France.
32. R. Shaham, E. K. Kolodner, and S. Sagiv. Automatic removal of array memory leaks in Java. In Proc. CC 2000, vol. 1781 of LNCS, pp. 50-66, Berlin, Germany.
33. A. Simon, A. King, and J. M. Howe. Two variables per linear inequality as an abstract domain. In Proc. LOPSTR 2002, vol. 2664 of LNCS, pp. 71-89, Madrid.