Control-flow refinement and progress invariants for bound analysis

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

Volumn , Issue , 2009, Pages 375-385

  Gulwani, Sumit ^a   Jain, Sagar ^b   Koskinen, Eric ^c  

^a MICROSOFT RESEARCH   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bound analysis; Control flow refinement; Formal verification; Program verification; Progress invariants; Termination

Indexed keywords

COMPLEXITY BOUNDS; CONTROL-FLOW; EQUIVALENT CODES; FORMAL VERIFICATIONS; GENERATION TOOLS; LINES OF CODE; MICROSOFT; MULTI-PATH; MULTIPLE-PATH; NESTED LOOPS; PERFORMANCE CHARACTERISTICS; REAL CODE; SAFETY PROPERTY; SINGLE LOOP;

C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; LINGUISTICS;

FORMAL LOGIC;

EID: 70450277235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542476.1542518     Document Type: Conference Paper

References (27)

1. Phoenix Compiler. research.microsoft.com/Phoenix/.
2. Z3 Theorem Prover. research.microsoft.com/projects/Z3/.
3. Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Automatic inference of upper bounds for recurrence relations in cost analysis. In SAS, 2008.
4. G. Balakrishnan, S. Sankaranarayanan, F. Ivancic, O. Wei, and A. Gupta. SLR: Path-sensitive analysis through infeasible-path detection and syntactic language refinement. Lecture Notes in Computer Science, 5079, 2008.
5. Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, and Peter W. O'Hearn. Variance analyses from invariance analyses. In POPL, 2007.
6. Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Termination proofs for systems code. In PLDI, 2006.
7. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL, 1978.
8. Karl Crary and Stephanie Weirich. Resource bound certification. In POPL, 2000.
9. Simon Goldsmith, Alex Aiken, and Daniel Shawcross Wilkerson. Measuring empirical computational complexity. In ESEC/SIGSOFT FSE, 2007.
10. Denis Gopan and Thomas W. Reps. Lookahead widening. In CAV, 2006.
11. Denis Gopan and Thomas W. Reps. Guided static analysis. In SAS, 2007.
12. Bhargav S. Gulavani and Sumit Gulwani. A numerical abstract domain based on expression abstraction and max operator with application in timing analysis. In CAV, 2008.
13. Bhargav S. Gulavani, Thomas A. Henzinger, Yamini Kannan, Aditya V. Nori, and Sriram K. Rajamani. SYNERGY: A new algorithm for property checking. In FSE, 2006.
14. Sumit Gulwani and Nebojsa Jojic. Program verification as probabilistic inference. In POPL, 2007.
15. Sumit Gulwani, Krishna Mehra, and Trishul Chilimbi. SPEED: Precise and efficient static estimation of program computational complexity. In POPL, 2009.
16. Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, and Bjorn Lisper. Automatic derivation of loop bounds and infeasible paths for wcet analysis using abstract execution. In RTSS, 2006.
17. Nicolas Halbwachs, Yann-Erick Proy, and Patrick Roumanoff. Verification of real-time systems using linear relation analysis. FMSD, 1997.
18. Christopher A. Healy, Mikael Sjodin, Viresh Rustagi, David B. Whalley, and Robert van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems, 18(2/3), 2000.
19. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Grégoire Sutre. Lazy abstraction. In POPL, 2002.
20. Björn Lisper. Fully automatic, parametric worst-case execution time analysis. In WCET, 2003.
21. Ali Mili. Reflexive transitive loop invariants: A basis for computing loop functions. In WING, 2007.
22. Antoine Miné. The Octagon Abstract Domain. Higher-Order and Symbolic Computation, 19(1), 2006.
23. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. LNCS, 2003.
24. A. Podelski and A. Rybalchenko. Transition invariants. In LICS, 2004.
25. Sriram Sankaranarayanan, Franjo Ivancic, Ilya Shlyakhter, and Aarti Gupta. Static analysis in disjunctive numerical domains. In SAS, 2006.
26. Chao Wang, Zijiang Yang, Aarti Gupta, and Franjo Ivancic. Using counterexamples for improving the precision of reachability computation with polyhedra. In CAV, 2007.
27. Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Frank Mueller, Isabelle Puaut, Peter Puschner, Jan Staschulat, and Per Stenström. The Determination of Worst-Case Execution Times - Overview of the Methods and Survey of Tools. In TECS, 2007.