Interprocedurally analysing linear inequality relations

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

Volumn 4421 LNCS, Issue , 2007, Pages 284-299

  Seidl, Helmut ^a   Flexeder, Andrea ^a   Petter, Michael ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION; SEMANTICS; TRANSFER MATRIX METHOD;

CONDITIONAL BRANCHING; LINEAR INEQUALITY RELATIONS;

OBJECT ORIENTED PROGRAMMING;

EID: 37149035667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_20     Document Type: Conference Paper

References (13)

1. R. Bagnara, E. Zaffanella, P. M. Hill, and E. Ricci. Precise widening operators for convex polyhedra. In 10th International Static Analysis Symposium (SAS), pages 337-354, 2003.
2. B. Blanchet, P. Cousot, R. Cousot, I. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. A static analyzer for large safety-critical software. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 196-207, 2003.
3. R. Clarisó and J. Cortadella. The Octahedron abstract domain. In 11th International Static Analysis Symposium (SAS), pages 312-327, 2004.
4. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511-547, 1992.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th Ann. ACM Symposium on Principles of Programming Languages (POPL), pages 84-97, 1978.
6. Z. Manna and J. McCarthy. Properties of programs and partial function logic. 1970.
7. A. Miné. The Octagon abstract domain. In Analysis, Slicing, and Transformation (AST), pages 310-319, 2001.
8. M. Müller-Olm and H. Seidl. Program analysis through linear algebra. In 31th Ann. ACM Symposium on Principles of Programming Languages (POPL), 2004.
9. M. Müller-Olm and H. Seidl. A generic framework for interprocedural analysis of numerical properties. In 12th Static Analysis Symposium (SAS), pages 235-250, 2005.
10. S. Sankaranarayanan, M. Colon, H. Sipma, and Z. Manna. Efficient strongly relational polyhedral analysis. In 7th International Conference, Verification, Model Checking and Abstract Interpretation (VMCAI), 2006.
11. S. Sankaranarayanan, H. Sipma, and Z. Manna. Constraint based linear relations analysis. In Ilth International Static Analysis Symposium (SAS), pages 53-68, 2004.
12. A. Schrijver. Theory of linear and integer programming. 1986.
13. A. Simon, A. King, and J. M. Howe. Two Variables per Linear Inequality as an Abstract Domain. In Logic Based Program Development and Transformation (LOPSTR), pages 71-89, 2002.