From program verification to program synthesis

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 313-326

  Srivastava, Saurabh ^a   Gulwani, Sumit ^b   Foster, Jeffrey S ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Proof theoretic program synthesis; Verification

Indexed keywords

FUNCTIONAL PROGRAMMING; SPECIFICATIONS; VERIFICATION;

ARITHMETIC ALGORITHMS; DYNAMIC PROGRAMMING ALGORITHM; FUNCTIONAL SPECIFICATION; MATRIX MULTIPLICATION; PARTIAL CORRECTNESS; PROGRAM SYNTHESIS; PROGRAM VERIFICATION; SYNTHESIS ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 77149158821     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706337     Document Type: Conference Paper

References (38)

1. D. Basin, Y. DeVille, P. Flener, A. Hamfelt, and J. F. NIlsson. Synthesis of programs in computational logic. In LNCS 3049.
2. Yves Bertot and Pierre Casteran. Interactive Theorem Proving and Program Development. SpringerVerlag, 2004.
3. Edmund M. Clarke and E. Allen Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, pages 52-71. Springer-Verlag, 1982.
4. Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In CAV '00, pages 154-169, 2000.
5. Michael Coĺon. Schema-guided synthesis of imperative programs by constraint solving. In LOPSTR, pages 166-181, 2004.
6. Michael Coĺon, Sriram Sankaranarayanan, and Henny Sipma. Linear invariant generation using non-linear constraint solving. In CAV'03.
7. Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Termination proofs for systems code. In PLDI '06, pages 415-426, 2006.
8. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms.
9. P. Cousot and R. Cousot. Abstract interpretation a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL'77.
10. Leonardo de Moura and Nikolaj Bjørner. Z3, 2008. http://research.microsoft.com/projects/Z3/.
11. Edsger W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18(8):453-457.
12. Edsger W. Dijkstra. A constructive approach to the problem of program correctness. BIT Numerical Math., 8(3):174-186, 1968.
13. Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in CS. 1990.
14. Edsger Wybe Dijkstra. A Discipline of Programming. 1976.
15. Joe W. Duran. Heuristics for program synthesis using loop invariants. In ACM '78, pages 891-900, New York, NY, USA. ACM.
16. Jean-Christophe Filliâtre. Using SMT solvers for deductive verification of C and Java programs. In SMT'08.
17. Pierre Flener, Kung-Kiu Lau, Mario Ornaghi, and Julian Richardson. An abstract formalization of correct schemas for program synthesis. J. Symb. Comput., 30(1):93-127, 2000.
18. David Gries. The Science of Programming. 1987.
19. Andreas Griesmayer, Paul Bloem Roderick, and Byron Cook. Repair of boolean programs with an application to C. In CAV'06.
20. Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Constraint-based invariant inference over predicate abstraction. In VMCAI'09.
21. Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Program analysis as constraint solving. In PLDI '08, pages 281-292.
22. Matthew S. Hecht and Jeffrey D. Ullman. Flow graph reducibility. In STOC '72, pages 238-250, New York, NY, USA, 1972. ACM.
23. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Kenneth L. McMillan. Abstractions from proofs. In POPL '04, 2004.
24. Barbara Jobstmann and Roderick Bloem. Optimizations for LTL synthesis. In FMCAD '06, pages 117-124. IEEE Computer Society.
25. Barbara Jobstmann, Andreas Griesmayer, and Roderick Paul Bloem. Program repair as a game. In CAV'05, pages 226 - 238.
26. Shuvendu Lahiri and Shaz Qadeer. Back to the future: revisiting precise program verification using SMT solvers. In POPL '08.
27. Zohar Manna and Richard J. Waldinger. Toward automatic program synthesis. Communications of the ACM, 14(3):151-165, 1971.
28. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL '89, pages 179-190, New York, NY, USA. ACM.
29. Armando Solar-Lezama, Gilad Arnold, Liviu Tancau, Rastislav Bodik, Vijay Saraswat, and Sanjit Seshia. Sketching stencils. In PLDI '07, pages 167-178, New York, NY, USA. ACM.
30. Armando Solar-Lezama, Christopher Grant Jones, and Rastislav Bodik. Sketching concurrent data structures. In PLDI '08.
31. Armando Solar-Lezama, Rodric Rabbah, Rastislav Bod́ik, and Kemal Ebcio?glu. Programming by sketching for bit-streaming programs. In PLDI '05.
32. Saurabh Srivastava and Sumit Gulwani. Program verification using templates over predicate abstraction. In PLDI '09.
33. Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. VS3. http://www.cs.umd.edu/~saurabhs/pacs/.
34. Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. VS3: SMT solvers for program verification. In CAV '09.
35. Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. Prooftheoretic program synthesis: From program verification to program synthesis. Technical report, Microsoft Research, Redmond, 2009.
36. Martin Vechev, Eran Yahav, and Greta Yorsh. Inferring synchronization under limited observability. In TACAS'09, 2009.
37. Martin Vechev, Eran Yahav, and Greta Yorsh. Abstraction-guided synthesis. In POPL'10, 2010.
38. Nicholas Wirth. Systematic Programming: An Introduction. 1973.