Linear invariant generation using non-linear constraint solving

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

Volumn 2725, Issue , 2003, Pages 420-432

  Colón, Michael A ^a   Sankaranarayanan, Sriram ^a   Sipma, Henny B ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER AIDED ANALYSIS;

ABSTRACT INTERPRETATIONS; INVARIANT GENERATIONS; NON-LINEAR CONSTRAINTS; QUANTIFIER ELIMINATION; SOUND AND COMPLETE;

LOGIC PROGRAMMING;

EID: 35248824647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_39     Document Type: Article

References (21)

1. F. Besson, T. Jensen, and J.-P. Talpin. Polyhedral analysis of synchronous languages. In Static Analysis Symposium, SAS'99, Lecture Notes in Computer Science 1694, pages 51-69, 1999.
2. A. Bockmayr and V. Weispfenning. Solving numerical constraints. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 12, pages 751-842. Elsevier Science, 2001.
3. E.M. Clarke. Synthesis of resource invariants for concurrent programs. In ACM Principles of Programming Languages, pages 211-221, January 1979.
4. G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299-328, sep 1991.
5. G.E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In H.Brakhage, editor, Automata Theory and Formal Languages, volume 33 of LNCS, pages 134-183, 1975.
6. P. Cousot and R. Cousot. Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Principles of Programming Languages, pages 238-252, 1977.
7. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among the variables of a program. In ACM Principles of Programming Languages, pages 84-97, January 1978.
8. A. Dolzmann and T. Sturm. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2-9, June 1997.
9. K. Fukuda and A. Prodon. Double description method revisited. In Combinatorics and Computer Science, volume 1120 of LNCS, pages 91-111. Springer-Verlag, 1996.
10. N. Halbwachs and Y.-E. Proy. POLyhedra desK cAlculator (POLKA). VERIMAG, Montbonnot, France, September 1995.
11. N. Halbwachs, Y.E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, 1997.
12. T.A. Henzinger and P.-H. Ho. Model-checking strategies for hybrid systems. In Conference on Industrial and Engineering Applications of AI and Expert Systems, 1994.
13. T. A. Henzinger and P.-H. Ho. Algorithmic analysis of nonlinear hybrid systems. In P. Wolper, editor, Computer-Aided Verification, LNCS 939, pages 225-238. 1995.
14. H. Hong. RISC-CLP(Real): Constraint logic programming over real numbers. In CLP: Selected Research. MIT Press, 1993.
15. J. Jaffar and J.-L. Lassez. Constraint logic programming. In Principles of Programming Languages(POPL), pages 111-119, January 1987.
16. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
17. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
18. A. Tarski. A decision method for elementary algebra and geometry. Univ. of California Press, Berkeley, 5, 1951.
19. V. Weispfenning. Quantifier elimination for real algebra - the quadratic case and beyond. In Applied Algebra and Error-Correcting Codes (AAECC) 8, pages 85-101, 1997.
20. N. Wirth. Algorithms + Data Structures = Programs. Prentice-Hall, 1976.
21. R. Zippel. Effective Polynomial Computation. Kluwer Academic Publishers, Boston, 1993.