Conference item icon

Conference item

Counterexample guided inductive synthesis modulo theories

Abstract:

Program synthesis is the mechanised construction of software. One of the main difficulties is the efficient exploration of the very large solution space, and tools often require a user-provided syntactic restriction of the search space. We propose a new approach to program synthesis that combines the strengths of a counterexample-guided inductive synthesizer with those of a theory solver, exploring the solution space more efficiently without relying on user guidance. We call this approach CEG...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-96145-3_15

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Kesseli, P More by this author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
More from this funder
Funding agency for:
David, C
Publisher:
Springer Verlagr Publisher's website
Pages:
270-288
Series:
Lecture Notes in Computer Science
Publication date:
2018-07-18
Acceptance date:
2018-03-31
DOI:
Pubs id:
pubs:835822
URN:
uri:033d5ad5-2d93-4399-bb7c-e3031f22c755
UUID:
uuid:033d5ad5-2d93-4399-bb7c-e3031f22c755
Local pid:
pubs:835822
ISBN:
978-3-319-96145-3

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP