Synthesising programs with non-trivial constants
From MaRDI portal
Publication:6161231
DOI10.1007/s10817-023-09664-4OpenAlexW4376612696MaRDI QIDQ6161231
Cristina David, Andrew Reynolds, Clark Barrett, Pascal Kesseli, Elizabeth Polgreen, Alessandro Abate, Daniel Kroening, Haniel Barbosa, Cesare Tinelli
Publication date: 27 June 2023
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-023-09664-4
automated reasoningprogram synthesissatisfiability modulo theoriescounterexample guided inductive synthesis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An existential fragment of second order logic
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Counterexample-guided quantifier instantiation for synthesis in SMT
- Datatypes with shared selectors
- On solving quantified bit-vector constraints using invertibility conditions
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Proving non-termination
- Scaling Enumerative Program Synthesis via Divide and Conquer
- Solving SAT and SAT Modulo Theories
- Using Program Synthesis for Program Analysis
- Computer Aided Verification
- Theory and Applications of Satisfiability Testing
- Component-based synthesis for complex APIs
- Counterexample guided inductive synthesis modulo theories
This page was built for publication: Synthesising programs with non-trivial constants
