Path-based inductive synthesis for program inversion

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

Volumn , Issue , 2011, Pages 492-503

  Srivastava, Saurabh ^a   Gulwani, Sumit ^b   Chaudhuri, Swarat ^c   Foster, Jeffrey S ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

^d UNIVERSITY OF MARYLAND   (United States)

Author keywords

inductive synthesis; pins; program inversion; symbolic execution; testing inspired synthesis

Indexed keywords

AUTOMATION; MODEL CHECKING; SOFTWARE TESTING;

AUTOMATED INVERSION; ERROR PRONES; IMPERATIVE PROGRAMS; INDUCTIVE SYNTHESIS; PATH-BASED; PIN; PROGRAM INVERSION; PROGRAM SYNTHESIS; SYMBOLIC EXECUTION; TESTING-INSPIRED SYNTHESIS;

ITERATIVE METHODS;

EID: 79959863167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993557     Document Type: Conference Paper

References (42)

1. CBMC. http://www.cprover.org/cbmc/.
2. LZW and LZ77. http://en.wikipedia.org/wiki/Lempel-Ziv-Welchand http://en.wikipedia.org/wiki/LZ77-and-LZ78.
3. PINS. http://www.cs.umd.edu/~saurabhs/vs3/PINS/.
4. Wei Chen. A formal approach to program inversion. In CSC: Proc. of the ACM conference on Cooperation, pages 398-403, 1990.
5. Byron Cook, Sumit Gulwani, Tal Lev-Ami, Andrey Rybalchenko, and Mooly Sagiv. Proving conditional termination. In CAV'08.
6. Byron Cook, Andreas Podelski, and Andrey Rybalchenko. Termination proofs for systems code. In PLDI, pages 415-426, 2006.
7. Leonardo de Moura and Nikolaj Bjørner. Z3, 2008. http://research.microsoft.com/projects/Z3/.
8. Edsger W. Dijkstra. Program inversion. In Program Construction, http://www.cs.utexas.edu/~EWD/ewd06xx/EWD671.PDF, pages 54-57, London, UK, 1979. Springer-Verlag.
9. David Eppstein. A heuristic approach to program inversion. In IJCAI, pages 219-221, 1985.
10. Michael D. Ernst, Jeff H. Perkins, Philip J. Guo, Stephen McCamant, Carlos Pacheco, Matthew S. Tschantz, and Chen Xiao. The Daikon system for dynamic detection of likely invariants. Science of Computer Programming, 69(1-3):35-45, December 2007.
11. Robert Glück and Masahiko Kawabe. A method for automatic program inversion based on LR(0) parsing. Fundam. Inf., 66(4):367-395, 2005.
12. David Gries. The Science of Programming. Springer-Verlag New York, Inc., 1987.
13. Sumit Gulwani. Dimensions in program synthesis (invited talk paper). In ACM Symposium on PPDP, 2010.
14. Sumit Gulwani. Automating string processing in spreadsheets using input-output examples. In POPL, pages 317-330, 2011.
15. Sumit Gulwani, Susmit Kumar Jha, Ashish Tiwari, and Ramarathnam Venkatesan. Synthesis of loop-free programs. In PLDI, 2011.
16. Sumit Gulwani, Vijay Korthikanti, and Ashish Tiwari. Synthesizing geometry constructions. In PLDI, 2011.
17. Sumit Gulwani, Saurabh Srivastava, and Ramarathnam Venkatesan. Program analysis as constraint solving. In PLDI, 2008.
18. Sumit Gulwani and Ashish Tiwari. Constraint-based approach for analysis of hybrid systems. In CAV, pages 190-203, 2008.
19. Sumit Gulwani and Florian Zuleger. The reachability-bound problem. In PLDI'10, pages 292-304, 2010.
20. William R. Harris and Sumit Gulwani. Spreadsheet table transformations from examples. In PLDI, 2011.
21. Shachar Itzhaky, Sumit Gulwani, Neil Immerman, and Mooly Sagiv. A simple inductive synthesis methodology and its applications. In OOPSLA, pages 36-46, 2010.
22. Susmit Jha, Sumit Gulwani, Sanjit Seshia, and Ashish Tiwari. Oracle-guided component-based program synthesis. In ICSE, 2010.
23. Aditya Kanade, Rajeev Alur, Sriram Rajamani, and G Ramalingam. Representation dependence testing using program inversion. In FSE, 2010.
24. Masahiko Kawabe and Robert Glück. The program inverter lrinv and its structure. In PADL, pages 219-234, 2005.
25. James C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385-394, 1976.
26. Viktor Kuncak, Mikael Mayer, Ruzica Piskac, and Philippe Suter. Complete functional synthesis. In PLDI, 2010.
27. Zohar Manna and Richard Waldinger. A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst., 2(1), 1980.
28. Zohar Manna and Richard J. Waldinger. Toward automatic program synthesis. Communications of the ACM, 14(3):151-165, 1971.
29. Kazutaka Morita, Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, and Masato Takeichi. Automatic inversion generates divide-andconquer parallel programs. In PLDI'07.
30. William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. LU Decomposition and Its Applications, chapter 2.3, pages 34-42. 1993.
31. Brian J. Ross. Running programs backwards: The logical inversion of imperative computation. Formal Asp. Comput., 9(3):331-348, 1997.
32. D. R. Smith. Kids: A semiautomatic program development system. IEEE Trans. Softw. Eng., 16:1024-1043, 1990.
33. Armando Solar-Lezama, Gilad Arnold, Liviu Tancau, Rastislav Bodik, Vijay Saraswat, and Sanjit Seshia. Sketching stencils. In PLDI, pages 167-178, 2007.
34. Armando Solar-Lezama, Christopher Grant Jones, and Rastislav Bodik. Sketching concurrent data structures. In PLDI, 2008.
35. Armando Solar-Lezama, Rodric Rabbah, Rastislav Bodík, and Kemal Ebcio.glu. Prog. by sketching for bit-stream. prgs. In PLDI, pages 281-294, 2005.
36. Saurabh Srivastava and Sumit Gulwani. Program verification using templates over predicate abstraction. In PLDI, 2009.
37. Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. VS3: SMT solvers for program verification. In CAV, 2009.
38. Saurabh Srivastava, Sumit Gulwani, and Jeffrey S. Foster. From program verification to program synthesis. In POPL, 2010.
39. Ankur Taly, Sumit Gulwani, and Ashish Tiwari. Synthesizing switching logic using constraint solving. In VMCAI, pages 305-319, 2009.
40. T. A. Welch. A technique for high-performance data compression. Computer, 17(6):8-19, 1984.
41. Daniel M. Yellin. Attribute grammar inversion and source-to-source translation. Springer-Verlag New York, Inc., 1988.
42. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(5):337-343, 1977.