Satisfiability and synthesis modulo oracles
From MaRDI portal
Publication:2152655
DOI10.1007/978-3-030-94583-1_13zbMath1498.68082arXiv2107.13477OpenAlexW4206458917MaRDI QIDQ2152655
Andrew Reynolds, Elizabeth Polgreen, Sanjit A. Seshia
Publication date: 8 July 2022
Full work available at URL: https://arxiv.org/abs/2107.13477
Related Items
Machine learning and logic: a new frontier in artificial intelligence, Bootstrapping library-based synthesis
Uses Software
Cites Work
- Unnamed Item
- Learning regular sets from queries and counterexamples
- A theory of formal synthesis via inductive learning
- Automated formal synthesis of provably safe digital controllers for continuous plants
- Model Finding for Recursive Functions in SMT
- SAT-Based Model Checking without Unrolling
- Scaling Enumerative Program Synthesis via Divide and Conquer
- Theory and Applications of Satisfiability Testing
- Counterexample guided inductive synthesis modulo theories