References

  1. Aws Albarghouthi, Sumit Gulwani & Zachary Kincaid (2013): Recursive Program Synthesis. In: Natasha Sharygina & Helmut Veith: CAV, LNCS 8044. Springer, pp. 934–950, doi:10.1007/978-3-642-39799-8\@uscore .67.
  2. Rajeev Alur, Rastislav Bodík, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak & Abhishek Udupa (2013): Syntax-guided synthesis. In: FMCAD. IEEE, pp. 1–8, doi:10.3233/978-1-61499-495-4-1.
  3. James Bornholt, Emina Torlak, Dan Grossman & Luis Ceze (2016): Optimizing synthesis with metasketches. In: Rastislav Bodík & Rupak Majumdar: POPL. ACM, pp. 775–788, doi:10.1145/2837614.2837666.
  4. Morgan Deters, Andrew Reynolds, Tim King, Clark W. Barrett & Cesare Tinelli (2014): A tour of CVC4: How it works, and how to use it. In: FMCAD. IEEE, pp. 7, doi:10.1109/FMCAD.2014.6987586.
  5. Pierre Flener (1995): Logic Program Synthesis from Incomplete Information. Springer, doi:10.1007/978-1-4615-2205-8.
  6. Jonathan Frankle, Peter-Michael Osera, David Walker & Steve Zdancewic (2016): Example-directed synthesis: a type-theoretic interpretation. In: Rastislav Bodík & Rupak Majumdar: POPL. ACM, pp. 802–815, doi:10.1145/2837614.2837629.
  7. Tihomir Gvero & Viktor Kuncak (2015): Synthesizing Java expressions from free-form queries. In: Jonathan Aldrich & Patrick Eugster: OOPSLA. ACM, pp. 416–432, doi:10.1145/2814270.2814295.
  8. Tihomir Gvero, Viktor Kuncak, Ivan Kuraj & Ruzica Piskac (2013): Complete completion using types and weights. In: Hans-Juergen Boehm & Cormac Flanagan: PLDI. ACM, pp. 27–38, doi:10.1145/2462156.2462192.
  9. Tihomir Gvero, Viktor Kuncak & Ruzica Piskac (2011): Interactive Synthesis of Code Snippets. In: Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings, pp. 418–423, doi:10.1007/978-3-642-22110-1\@uscore .33.
  10. Jeevana Priya Inala, Xiaokang Qiu, Ben Lerner & Armando Solar-Lezama (2015): Type Assisted Synthesis of Recursive Transformers on Algebraic Data Types. CoRR abs/1507.05527. Available at http://arxiv.org/abs/1507.05527.
  11. Etienne Kneuss (2016): Deductive Synthesis and Repair. EPFL, doi:10.5075/epfl-thesis-6878.
  12. Etienne Kneuss, Manos Koukoutos & Viktor Kuncak (2015): Deductive Program Repair. In: Daniel Kroening & Corina S. Pasareanu: CAV, LNCS 9207. Springer, pp. 217–233, doi:10.1007/978-3-319-21668-3\@uscore .13.
  13. Etienne Kneuss, Ivan Kuraj, Viktor Kuncak & Philippe Suter (2013): Synthesis modulo recursive functions. In: Antony L. Hosking, Patrick Th. Eugster & Cristina V. Lopes: OOPSLA. ACM, pp. 407–426, doi:10.1145/2509136.2509555.
  14. Zohar Manna & Richard J. Waldinger (1980): A Deductive Approach to Program Synthesis. ACM Trans. Program. Lang. Syst. 2(1), pp. 90–121, doi:10.1145/357084.357090.
  15. Leonardo Mendonça de Moura & Nikolaj Bjørner (2008): Z3: An Efficient SMT Solver. In: C. R. Ramakrishnan & Jakob Rehof: TACAS, LNCS 4963. Springer, pp. 337–340, doi:10.1007/978-3-540-78800-3\@uscore .24.
  16. Yu Pei, Carlo A. Furia, Martín Nordio & Bertrand Meyer (2015): Automated Program Repair in an Integrated Development Environment. In: Antonia Bertolino, Gerardo Canfora & Sebastian G. Elbaum: ICSE. IEEE Computer Society, pp. 681–684, doi:10.1109/ICSE.2015.222.
  17. Daniel Perelman, Sumit Gulwani, Thomas Ball & Dan Grossman (2012): Type-directed completion of partial expressions. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 275–286, doi:10.1145/2254064.2254098.
  18. Daniel Perelman, Sumit Gulwani, Dan Grossman & Peter Provost (2014): Test-driven synthesis. In: Michael F. P. O'Boyle & Keshav Pingali: PLDI. ACM, pp. 43, doi:10.1145/2594291.2594297.
  19. Nadia Polikarpova, Ivan Kuraj & Armando Solar-Lezama (2016): Program synthesis from polymorphic refinement types. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, Santa Barbara, CA, USA, June 13-17, 2016, pp. 522–538, doi:10.1145/2908080.2908093.
  20. Oleksandr Polozov & Sumit Gulwani (2015): FlashMeta: a framework for inductive program synthesis. In: Jonathan Aldrich & Patrick Eugster: OOPSLA. ACM, pp. 107–126, doi:10.1145/2814270.2814310.
  21. Alex Reinking & Ruzica Piskac (2015): A Type-Directed Approach to Program Repair. In: Daniel Kroening & Corina S. Pasareanu: CAV, LNCS 9206. Springer, pp. 511–517, doi:10.1007/978-3-319-21690-4\@uscore .35.
  22. Patrick M. Rondon, Ming Kawaguci & Ranjit Jhala (2008): Liquid Types. In: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '08. ACM, New York, NY, USA, pp. 159–169, doi:10.1145/1375581.1375602.
  23. Armando Solar-Lezama, Liviu Tancau, Rastislav Bodik, Sanjit Seshia & Vijay Saraswat (2006): Combinatorial Sketching for Finite Programs. In: Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS XII. ACM, New York, NY, USA, pp. 404–415, doi:10.1145/1168857.1168907.
  24. Philippe Suter (2012): Programming with Specifications. EPFL, doi:10.5075/epfl-thesis-5581.
  25. Philippe Suter, Ali Sinan Köksal & Viktor Kuncak (2011): Satisfiability Modulo Recursive Programs. In: Eran Yahav: SAS, LNCS 6887. Springer, pp. 298–315, doi:10.1007/978-3-642-23702-7\@uscore .23.
  26. Abhishek Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin & Rajeev Alur (2013): TRANSIT: specifying protocols with concolic snippets. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI, pp. 287–296, doi:10.1145/2462156.2462174.
  27. Yi Wei, Yu Pei, Carlo A Furia, Lucas S Silva, Stefan Buchholz, Bertrand Meyer & Andreas Zeller (2010): Automated fixing of programs with contracts. In: Proceedings of the 19th international symposium on Software testing and analysis. ACM, pp. 61–72, doi:10.1145/1831708.1831716.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org