Syntax-guided synthesis

2013 Formal Methods in Computer-Aided Design, FMCAD 2013

Volumn , Issue , 2013, Pages 1-8

  Alur, Rajeev ^a   Bodik, Rastislav ^b   Juniwal, Garvit ^b   Martin, Milo M K ^a   Raghothaman, Mukund ^a   Seshia, Sanjit A ^b   Singh, Rishabh ^c   Solar Lezama, Armando ^c   Torlak, Emina ^b   Udupa, Abhishek ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED DESIGN; FORMAL METHODS; SEMANTICS; SPECIFICATIONS;

COMPUTATIONAL PROBLEM; LOGICAL FRAMEWORKS; LOGICAL SPECIFICATIONS; POTENTIAL BENEFITS; PROGRAM OPTIMIZATION; PROGRAM SYNTHESIS; PROTOTYPE IMPLEMENTATIONS; SYNTHESIS PROBLEMS;

SYNTACTICS;

EID: 84893320955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/fmcad.2013.6679385     Document Type: Conference Paper

References (27)

1. C. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli, "Satisfiability modulo theories," in Handbook of Satisfiability, 2009, vol. 4, ch. 8.
2. L. M. de Moura and N. Bjørner, "Satisfiability modulo theories: Introduction and applications," Commun. ACM, vol. 54, no. 9, 2011.
3. Z. Manna and R. Waldinger, "A deductive approach to program synthesis," ACM TOPLAS, vol. 2, no. 1, pp. 90-121, 1980.
4. A. Solar-Lezama, R. Rabbah, R. Bodík, and K. Ebcioglu, "Programming by sketching for bit-streaming programs," in PLDI, 2005.
5. S. Gulwani, S. Jha, A. Tiwari, and R. Venkatesan, "Synthesis of loopfree programs," SIGPLAN Not., vol. 46, pp. 62-73, June 2011.
6. S. Gulwani, W. R. Harris, and R. Singh, "Spreadsheet data manipulation using examples," Commun. ACM, vol. 55, no. 8, pp. 97-105, 2012.
7. S. Jha, S. Gulwani, S. A. Seshia, and A. Tiwari, "Oracle-guided component-based program synthesis," in ICSE, 2010, pp. 215-224.
8. A. Udupa, A. Raghavan, J. V. Deshmukh, S. Mador-Haim, M. M. Martin, and R. Alur, "TRANSIT: Specifying Protocols with Concolic Snippets," in PLDI, 2013, pp. 287-296.
9. S. Srivastava, S. Gulwani, and J. S. Foster, "From program verification to program synthesis," in POPL, 2010, pp. 313-326.
10. V. Kuncak, M. Mayer, R. Piskac, and P. Suter, "Software synthesis procedures," Commun. ACM, vol. 55, no. 2, pp. 103-111, 2012.
11. E. Schkufza, R. Sharma, and A. Aiken, "Stochastic superoptimization," in ASPLOS, 2013, pp. 305-316.
12. M. Col?on, S. Sankaranarayanan, and H. Sipma, "Linear invariant generation using non-linear constraint solving," in CAV, 2003, pp. 420-432.
13. A. Rybalchenko, "Constraint solving for program verification: Theory and practice by example," in CAV, 2010, pp. 57-71.
14. R. Sharma, S. Gupta, B. Hariharan, A. Aiken, P. Liang, and A. V. Nori, "A data driven approach for algebraic loop invariants," in ESOP, 2013, pp. 574-592.
15. N. Bjørner, K. L. McMillan, and A. Rybalchenko, "On solving universally quantified Horn clauses," in SAS, 2013, pp. 105-125.
16. A. Solar-Lezama, L. Tancau, R. Bodík, S. A. Seshia, and V. Saraswat, "Combinatorial sketching for finite programs," in ASPLOS, 2006.
17. E. M. Gold, "Language identification in the limit," Information and Control, vol. 10, no. 5, pp. 447-474, 1967.
18. P. D. Summers, "A methodology for LISP program construction from examples," J. ACM, vol. 24, no. 1, pp. 161-175, 1977.
19. E. Y. Shapiro, Algorithmic Program Debugging. Cambridge, MA, USA: MIT Press, 1983.
20. D. Angluin and C. H. Smith, "Inductive inference: Theory and methods," ACM Computing Surveys, vol. 15, pp. 237-269, Sep. 1983.
21. T. M. Mitchell, Machine Learning. McGraw-Hill, 1997.
22. S. A. Seshia, "Sciduction: Combining induction, deduction, and structure for verification and synthesis," in DAC, 2012, pp. 356-365.
23. D. Angluin, "Queries and concept learning," Machine Learning, vol. 2, pp. 319-342, 1988.
24. A. Solar-Lezama, "Program synthesis by sketching," Ph.D. dissertation, University of California, Berkeley, 2008.
25. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, "Counterexample-guided abstraction refinement for symbolic model checking," J. ACM, vol. 50, no. 5, pp. 752-794, 2003.
26. B. McKenzie, "Generating strings at random from a context free grammar," 1997.
27. H. S. Warren, Hacker?s Delight. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 2002.