Convex optimization proves software correctness

Proceedings of the American Control Conference

Volumn 2, Issue , 2005, Pages 1395-1400

  Roozbehani, Mardavij ^a   Megretski, Alexandre ^b   Feron, Eric ^a  

^a Massachusetts Institute of Technology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Lyapunov invariants; Optimization; Software; Verification

Indexed keywords

CONVEX OPTIMIZATION; RUN-TIME ERRORS; SOFTWARE ANALYSIS; SOFTWARE CORRECTNESS;

COMPUTER PROGRAMMING; COMPUTER SOFTWARE; EMBEDDED SYSTEMS; ERROR ANALYSIS; LYAPUNOV METHODS;

OPTIMIZATION;

EID: 23944445609     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. S. Boyd, L.E. Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in Systems and Control Theory. Society for Industrial and Applied Mathematics, 1994.
2. D. Bertsimas, and J. Tsitsikilis. Introduction to Linear Optimization. Athena Scientific, 1997.
3. M. A. Colon, S. Sankaranarayanan, H. B. Sipma. Linear invariant generation using non-linear constraint solving. In Computer Aided Verification (CAV 2003), vol. 2725 of Lecture Notes in Computer Science, Springer Verlag, pp. 420-433.
4. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'77, pages 238-252, 1977.
5. P. Cousot, and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 269-282, San Antonio, Texas, 1979. ACM Press, New York.
6. P. Cousot. Semantic foundations of program analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 10, pages 303-342. Prentice-Hall, 1981.
7. D. Dams. Abstract interpretation and partition refinement for Model Checking. Ph.D. Thesis, Eindhoven University of Technology, 1996.
8. D. Monniaux. Abstract interpretation of programs as Markov decision processes. In Static Analysis Symposium, volume 2694 in Lecture Notes in Computer Science, pages 237-254, Springer Verlag, 2003.
9. P. A. Parrilo. Minimizing Polynomial Functions. In Algorithmic and Quantitative Real Algebraic Geometry, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 60, pp. 83-99, AMS.
10. K. Gatermann, and P.A. Parrilo. Symmetry groups, semidefinite programs, and sums of squares. Journal of Pure and Appl. Algebra, Vol. 192, No. 1-3, pp. 95-128, 2004.