Synthesis of loop-free programs

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

Volumn , Issue , 2011, Pages 62-73

  Gulwani, Sumit ^a   Jha, Susmit ^b   Tiwari, Ashish ^c   Venkatesan, Ramarathnam ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SRI INTERNATIONAL   (United States)

Author keywords

component based synthesis; program synthesis; smt

Indexed keywords

COMPONENT BASED; COMPONENT-BASED SYNTHESIS; INPUT AND OUTPUTS; INPUT VARIABLES; LIBRARY COMPONENTS; LOGICAL RELATIONS; LOOP FREE; OUTPUT VARIABLES; PROGRAM SYNTHESIS; SMT;

ITERATIVE METHODS;

EID: 79959895365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993506     Document Type: Conference Paper

References (38)

1. Satisfiability modulo theories competition (smt-comp). http://www.smtcomp.org/2009/index.shtml.
2. SMTLIB: Satisfiability modulo theories lib. http://smtlib.org.
3. Yices: An SMT solver. http://yices.csl.sri.com.
4. The AHA! (A Hacker's Assistant) Superoptimizer, 2008. Download: http://www.hackersdelight.org/aha.zip, Documentation: http://www.hackersdelight. org/aha/aha.pdf.
5. S. Bansal and A. Aiken. Automatic generation of peephole superoptimizers. In ASPLOS, 2006.
6. S. Bansal and A. Aiken. Binary translation using peephole superoptimizers. In OSDI, 2008.
7. R. Cytron, J. Ferrante, B. K. Rosen, M. N.Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In POPL, 1989.
8. B. Fischer and J. Schumann. Autobayes: A system for generating data analysis programs from statistical models. J. Funct. Program., 13(3):483-508, 2003.
9. P. Flener and L. Popelmnsky. On the use of inductive reasoning in program synthesis: Prejudice and prospects. In LOBSTR. 1994.
10. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
11. T. Granlund and R. Kenner. Eliminating branches using a superoptimizer and In PLDI, 1992.
12. S. Gulwani. Dimensions in program synthesis. In PPDP, pages 13-24. ACM, 2010.
13. S. Gulwani. Automating string processing in spreadsheets using inputoutput examples. In POPL, 2011.
14. S. Gulwani, V. Korthikanti, and A. Tiwari. Synthesizing geometry constructions. In PLDI, 2011.
15. J. Hamza, B. Jobstmann, and V. Kuncak. Synthesis for regular specifications over unbounded domains. In FMCAD, 2010.
16. B. Harris and S. Gulwani. Spreadsheet table transformations from examples. In PLDI, 2011.
17. S. Itzhaky, S. Gulwani, N. Immerman, and M. Sagiv. A simple inductive synthesis methodology and its applications. In OOPSLA, pages 36-46, 2010.
18. R. N. Jackiw and W. F. Finzer. The geometer's sketchpad: programming by geometry. In Watch what I do: programming by demonstration, pages 293-307. MIT Press, 1993.
19. S. Jha, S. Gulwani, S. Seshia, and A. Tiwari. Oracle-guided component-based program synthesis. In ICSE, pages 215-224, 2010.
20. S. Jha, S. Gulwani, S. Seshia, and A. Tiwari. Synthesizing switching logic for safety and dwell-time requirements. In Proc. 1st ACM/IEEE Intl. Conf. on Cyber-Physical Systems, ICCPS, pages 22-31, 2010.
21. T. A. Johnson and R. Eigenmann. Context-sensitive domainin-dependent algorithm composition and selection. In PLDI, 2006.
22. R. Joshi, G. Nelson, and K. H. Randall. Denali: A goal-directed superoptimizer. In PLDI, 2002.
23. D. E. Knuth. The art of computer programming. http://www-cs-faculty. stanford.edu/~knuth/taocp.html.
24. T. A. Lau, P. Domingos, and D. S.Weld. Version space algebra and its application to programming by demonstration. In ICML, 2000.
25. Y. Lustig and M. Vardi. Synthesis from component libraries. In Proc. FoSSaCS, pages 395-409, 2009.
26. D. Mandelin, L. Xu, R. Bodík, and D. Kimelman. Jungloid mining: helping to navigate the API jungle. In PLDI, pages 48-61, 2005.
27. Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM TOPLAS, 2(1):90-121, 1980.
28. H. Massalin. Superoptimizer - a look at the smallest program. In ASPLOS, pages 122-126, 1987.
29. S. Muggleton, editor. Inductive Logic Programming, volume 38 of The APIC Series. Academic Press, 1992.
30. E. Y. Shapiro. Algorithmic Program DeBugging. MIT Press, Cambridge, MA, USA, 1983.
31. A. Solar-Lezama, G. Arnold, L. Tancau, R. Bodík, V. A. Saraswat, and S. A. Seshia. Sketching stencils. In PLDI, pages 167-178, 2007.
32. A. Solar-Lezama, R. Rabbah, R. Bodík, and K. Ebcioglu. Programming by sketching for bit-streaming programs. In PLDI, 2005.
33. A. Solar-Lezama, L. Tancau, R. Bodík, S. Seshia, and V. Saraswat. Combinatorial sketching for finite programs. In ASPLOS, 2006.
34. S. Srivastava, S. Gulwani, and J. S. Foster. From program verification to program synthesis. In POPL, pages 313-326, 2010.
35. M. Stickel, R. Waldinger, M. Lowry, T. Pressburger, and I. Underwood. Deductive composition of astro. software from subroutine libraries. In CADE, '94.
36. A. Taly, S. Gulwani, and A. Tiwari. Synthesizing switching logic using constraint solving. In VMCAI, pages 305-319. Springer, 2009.
37. H. S. Warren. Hacker's Delight. Addison-Wesley, '02.
38. I. H. Witten and D. Mo. TELS: learning text editing tasks from examples. In Watch what I do: programming by demonstration, pages 293-307. MIT Press, Cambridge, MA, USA, 1993.