Scalable analysis of linear systems using mathematical programming

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 25-41

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

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BENCHMARKING; INVARIANCE; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PERFORMANCE; POLYNOMIALS;

FORWARD PROPAGATION; INVARIANTS; QUERIES; SCALABLE ANALYSIS;

LINEAR SYSTEMS;

EID: 24144461197     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_2     Document Type: Conference Paper

References (15)

1. 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.
2. 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.
3. BLANCHET, B., COUSOT, P., COUSOT, R., FERET, J., MAUBORGNE, L., MINÉ, A., MONNIAUX, D., AND RIVAL, X. A static analyzer for large safety-critical software. In ACM SIGPLAN PLDI'03 (June 2003), vol. 548030, ACM Press, pp. 196-207.
4. CLARISÓ, R., AND CORTADELLA, J. The octahedron abstract domain. In Static Analysis Symposium (2004), vol. 3148 of LNCS, Springer-Verlag, pp. 312-327.
5. 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.
6. 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.
7. 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.
8. 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.
9. KARR, M. Affine relationships among variables of a program. Acta Inf. 6 (1976), 133-151.
10. MAKHORIN, A. The GNU Linear Programming Kit, 2000. http://www.gnu.org/software/glpk/glpk.html.
11. MANNA, Z., AND PNUELI, A. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
12. 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.
13. MINÉ, A. The octagon abstract domain. In AST 2001 in WCRE 2001 (October 2001), IEEE, IEEE CS Press, pp. 310-319.
14. PARRILO, P. A. Semidefinite programming relaxation for semialgebraic problems. Mathematical Programming Ser. B 96, 2 (2003), 293-320.
15. SCHRIJVER, A. Theory of Linear and Integer Programming. Wiley, 1986.