Scalable algorithms for abduction via enumerative syntax-guided synthesis
From MaRDI portal
Publication:2096443
DOI10.1007/978-3-030-51074-9_9OpenAlexW3039989778MaRDI QIDQ2096443
Andrew Reynolds, Haniel Barbosa, Cesare Tinelli, Daniel Larraz
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51074-9_9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Counterexample-guided quantifier instantiation for synthesis in SMT
- A generic framework for implicate generation modulo theories
- Ilinva: using abduction to generate loop invariants
- Syntax-guided rewrite rule enumeration for SMT solvers
- Extending SMT solvers to higher-order logic
- Maximal specification synthesis
- Automated Inference of Library Specifications for Source-Sink Property Verification
- Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
- Scaling Enumerative Program Synthesis via Divide and Conquer
- Abductive Inference
- Compositional shape analysis by means of bi-abduction
- The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
- Synthesis of Circular Compositional Program Proofs via Abduction
This page was built for publication: Scalable algorithms for abduction via enumerative syntax-guided synthesis
