Constraint-based linear-relations analysis

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

Volumn 3148, Issue , 2004, Pages 53-68

  Sankaranarayanan, Sriram ^a   Sipma, Henny B ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ANALYSIS PROBLEMS; CONSTRAINT-BASED; HIGHER DIMENSIONS; LINEAR RELATION; LIVENESS PROPERTIES; QUANTIFIER ELIMINATION; TRANSITION SYSTEM; UNKNOWN COEFFICIENTS;

ARTIFICIAL INTELLIGENCE;

EID: 26444610249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27864-1_7     Document Type: Article

References (17)

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 Static Analysis Symposium (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. Collins, G. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages (1975), H.Brakhage, Ed., vol. 33 of LNCS, Springer-Verlag, pp. 134-183.
6. Colon, M., Sankaranarayanan, S., and Sipma, H. Linear invariant generation using non-linear constraint solving. In Computer Aided Verification (July 2003), vol. 2725 of LNCS, Springer-Verlag, pp. 420-433.
7. 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.
8. Cousot, P., and Halbwachs, N. Automatic discovery of linear restraints among the variables of a program. In ACM Principles of Programming Languages (Jan. 1978), pp. 84-97.
9. Fukuda, K., and Prodon, A. Double description method revisited. In Combinatorics and Computer Science, vol. 1120 of LNCS. Springer-Verlag, 1996, pp. 91-111.
10. Halbwachs, N., Merchat, D., and Parent-Vigoureux, C. Cartesian factoring of polyhedra for linear relation analysis. In Static Analysis Symposium (2003), vol. 2694 of LNCS, Springer-Verlag, pp. 355-365.
11. Halbwachs, N., Proy, Y., and Roumanoff, P. Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11, 2 (1997), 157-185.
12. Henzinger, T. A., and Ho, P. HYTECH: The Cornell hybrid technology tool. In Hybrid Systems II (1995), vol. 999 of LNCS, Springer-Verlag, pp. 265-293.
13. Manna, Z., and Pnueli, A. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
14. Sankaranarayanan, S., Sipma, H. B., and Manna, Z. Petri net analysis using invariant generation. In Verification: Theory and Practice (2003), vol. 2772 of LNCS, Springer-Verlag, pp. 682-701.
15. Schrijver, A. Theory of Linear and Integer Programming. Wiley, 1986.
16. Tarski, A. A decision method for elementary algebra and geometry. Univ. of California Press, Berkeley 5 (1951).
17. Weispfenning, V. The complexity of linear problems in fields. Journal of Symbolic Computation 5, 1-2 (April 1988), 3-27.