Challenges for Fast Synthesis Procedures in SMT

7 pages•Published: November 8, 2017

Abstract

A number of synthesis applications are made possible by automated tools for synthesis. Recent work has shown that SMT solvers, instead of just acting as subroutines for automated software synthesis tasks, can be instrumented to perform synthesis themselves. This paper focuses on some of the current challenges for developing fast and useful procedures in SMT solvers for the benefit of synthesis applications.

Keyphrases: quantifier instantiation, smt, synthesis

In: Giles Reger and Dmitriy Traytel (editors). ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, vol 51, pages 69-75.

Links:	https://easychair.org/publications/paper/D2VV
	https://doi.org/10.29007/xrhz

BibTeX entry

@inproceedings{ARCADE2017:Challenges_Fast_Synthesis_Procedures,
  author    = {Andrew Reynolds},
  title     = {Challenges for Fast Synthesis Procedures in SMT},
  booktitle = {ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements},
  editor    = {Giles Reger and Dmitriy Traytel},
  series    = {EPiC Series in Computing},
  volume    = {51},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/D2VV},
  doi       = {10.29007/xrhz},
  pages     = {69-75},
  year      = {2017}}

Download PDF Open PDF in browser