Program analysis as constraint solving

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 281-292

  Gulwani, Sumit ^a   Srivastava, Saurabh ^b   Venkatesan, Ramarathnam ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Bounds analysis; Constraint solving; Most general counterexamples; Non termination analysis; Program verification; Strongest postcondition; Weakest precondition

Indexed keywords

BOUNDS ANALYSIS; CONSTRAINT SOLVING; MOST-GENERAL COUNTEREXAMPLES; NON-TERMINATION ANALYSIS; PROGRAM VERIFICATION; STRONGEST POSTCONDITION; WEAKEST PRECONDITION;

BOOLEAN FUNCTIONS; C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; COMPUTERS; LINGUISTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 57349164811     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375616     Document Type: Conference Paper

References (41)

1. I. Balaban, A. Cohen, and A. Pnueli. Ranking abstraction of recursive programs. In VMCAI, pages 267-281, 2006.
2. J. Berdine, A. Chawdhary, B. Cook, D. Distefano, and P. W. O'Hearn. Variance analyses from invariance analyses. In POPL, pages 211-224, 2007.
3. D. Beyer, T. Henzinger, R. Majumdar, and A. Rybalchenko. Invariant synthesis for combined theories. In VMCAI'07, pages 378-394, 2007.
4. D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko. Path invariants. In PLDI, pages 300-309, 2007.
5. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software. In The Essence of Computation: Complexity, Analysis, Transformation., LNCS 2566, pages 85-108. Oct. 2002.
6. A. R. Bradley and Z. Manna. Verification constraint problems with strengthening. In ICTAC, pages 35-49, 2006.
7. th Intl. Conference on Computer Aided Verification (CAV), volume 3576 of Lecture Notes in Computer Science. Springer Verlag, July 2005.
8. M. Colón, S. Sankaranarayanan, and H. Sipma. Linear invariant generation using non-linear constraint solving. In CAV, pages 420-432, 2003.
9. M. Colón and H. Sipma. Practical methods for proving program termination. In CAV '02: Proceedings of the 14th International Conference on Computer Aided Verification, pages 442-454. Springer-Verlag, 2002.
10. P. Cousot. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In VMCAI, pages 1-24, 2005.
11. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252, 1977.
12. L. M. de Moura and N. Bjørner. Efficient e-matching for smt solvers. In CADE, pages 183-198, 2007.
13. J. Edmund M. Clarke, O. Grumberg, and D. A. Peled. Model checking. MIT Press, Cambridge, MA, USA, 1999.
14. R. Giacobazzi and F. Ranzato. Optimal domains for disjunctive abstract interpretation. Sci. of Comp. Prg., 32(1-3): 177-210, 1998.
15. L. Gonnord and N. Halbwachs. Combining widening and acceleration in linear relation analysis. In 13th International Static Analysis Symposium, SAS'06, LNCS 4134, Aug. 2006.
16. D. Gopan and T. W. Reps. Lookahead widening. In CAV, pages 452-466, 2006.
17. D. Gopan and T. W. Reps. Guided static analysis. In SAS, pages 349-365, 2007.
18. B. S. Gulavani, S. Chakraborty, A. V. Nori, and S. K. Rajamani. Automatically refining abstract interpretations. Technical Report TR-07-23, IIT Bombay, 2007.
19. B. S. Gulavani and S. K. Rajamani. Counterexample driven refinement for abstract interpretation. In TACAS, pages 474-488, 2006.
20. S. Gulwani, K. Mehra, and T. Chilimbi. Statically computing complexity bounds for programs with recursive data-structures. Technical Report MSR-TR-2008-16, Microsoft Research, Redmond, Ian. 2008.
21. S. Gulwani, S. Srivastava, and R. Venkatesan. Program analysis as constraint solving. Full version. Technical Report MSR-TR-2008-44, Microsoft Research, Mar. 2008.
22. A. Gupta, T. Henzinger, R. Majumdar, A. Rybalchenko, and R.-G. Xu. Proving non-termination. In POPL, 2008.
23. C. B. Jones. Specification and design of (parallel) programs. In IFIP Congress, pages 321-332, 1983.
24. D. Kapur. Automatically generating loop invariants using quantifier elimination. In Deduction and Applications, 2005.
25. G. A. Kildall. A unified approach to global program optimization. In POPL, pages 194-206, 1973.
26. Z. Manna. Mathematical Theory of Computation. McGraw-Hill, New York, '74.
27. Z. Manna and I. McCarthy. Properties of programs and partial function logic. Machine Intelligence, 5, 1970.
28. Z. Manna and A. Pnueli. Formalization of properties of functional programs. Journal of the ACM, 17(3):555-569, 1970.
29. M. Müller-Olm and H. Seidl. Precise interprocedural analysis through linear algebra. In POPL, pages 330-341, 2004.
30. M. Müller-Olm, H. Seidl, and B. Steffen. Interprocedural analysis (almost) for free. In Technical Report 790, Fachbereich Infbrmatik, Universitt Dortmund, 2004.
31. M. Müller-Olm, H. Seidl, and B. Steffen. Interprocedural herbrand equalities. In ESOP, pages 31-45, 2005.
32. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI, pages 239-251, 2004.
33. S. Sagiv, T. W. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci., 167(1 & 2):131-170, 1996.
34. S. Sankaranarayanan, F. Ivancic, I. Shlyakhter, and A. Gupta. Static analysis in disjunctive numerical domains. In SAS, pages 3-17, 2006.
35. S. Sankaranarayanan, H. Sipma, and Z. Manna. Non-linear loop invariant generation using gröbner bases. In POPL, pages 318-329, 2004.
36. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Constraint-based linear-relations analysis. In SAS, pages 53-68, 2004.
37. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Scalable analysis of linear systems using mathematical programming. In VMCAI, pages 25-41, 2005.
38. A. Schrijver. Theory of Linear and Integer Programming. 1986.
39. H. Seidl, A. Flexeder, and M. Petter. Interprocedurally analysing linear inequality relations. In ESOP, pages 284-299, 2007.
40. C. Wang, Z. Yang, A. Gupta, and F. Ivancic. Using counterexamples for improving the precision of reachability computation with polyhedra. In CAV, pages 352-365, 2007.
41. Y. Xie and A. Aiken. Saturn: A sat-based tool for bug detection. In CAV, pages 139-143, 2005.