Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis.
Andrew Reynolds,Haniel Barbosa,Daniel Larraz,Cesare Tinelli +3 more
- pp 141-160
TLDR
This work proposes an approach for solving the abduction problem in logic that is based on syntax-guided enumeration and uses a novel procedure that incrementally constructs a solution in disjunctive normal form that is built from enumerated formulas.Abstract:
The abduction problem in logic asks whether there exists a formula that is consistent with a given set of axioms and, together with these axioms, suffices to entail a given goal. We propose an approach for solving this problem that is based on syntax-guided enumeration. For scalability, we use a novel procedure that incrementally constructs a solution in disjunctive normal form that is built from enumerated formulas. The procedure can be configured to generate progressively weaker and simpler solutions over the course of a run of the procedure. Our approach is fully general and can be applied over any background logic that is handled by the underlying SMT solver in our approach. Our experiments show our approach compares favorably with other tools for abductive reasoning.read more
Citations
More filters
Book ChapterDOI
cvc5: A Versatile and Industrial-Strength SMT Solver
Haniel Barbosa,Clark Barrett,Martin Brain,Gereon Kremer,Hanna Elif Lachnitt,Makai Mann,Abdalrhman Mohamed,Mudathir Mohamed,Aina Niemetz,Andres Nötzli,Alex Ozdemir,Mathias Preiner,Andrew Reynolds,Ying Sheng,Cesare Tinelli,Yoni Zohar +15 more
TL;DR: VC5 as discussed by the authors is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and components introduced since CVC 4 1.8.
Proceedings ArticleDOI
Learning to Synthesize Relational Invariants
Jingbo Wang,Chao Wang +1 more
TL;DR: In this paper , a method for synthesizing invariants that can help verify relational properties over two programs or two different executions of a program is proposed. But it is not suitable for the verification of relational properties.
Journal ArticleDOI
An Interactive SMT Tactic in Coq using Abductive Reasoning
Haniel Barbosa,Chantal Keller,Andrew Reynolds,Arjun Viswanathan,Cesare Tinelli,Clark Barrett +5 more
TL;DR: In this paper , the authors enhance SMTCoq, an integration between the Coq ITP and the cvc5 SMT solver, with a tactic called abduce aimed at mitigating the uncertainty above.
Proceedings ArticleDOI
Access Control for Database Applications: Beyond Policy Enforcement
TL;DR: In this article , the authors identify three challenges beyond enforcement and discuss possible solutions, and identify three such challenges beyond the enforcement of fine-grained access control for database-backed applications.
References
More filters
Book ChapterDOI
Z3: an efficient SMT solver
TL;DR: Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications.
Book
A mathematical introduction to logic
TL;DR: A comparison of first- and second-order logic in the case of SETs shows that the former is more likely to be correct and the latter is less likely.
The SMT-LIB Standard Version 2.0
TL;DR: This paper introduces Version 2 of the SMT-LIB Standard, a major upgrade of the previous Version 1.2 which, in addition to simplifying and extending the languages of that version, includes a new command language for interfacing with SMT solvers.
Book ChapterDOI
Satisfiability Modulo Theories
Clark Barrett,Cesare Tinelli +1 more
TL;DR: The architecture of a lazy SMT solver is discussed, examples of theory solvers are given, how to combine such solvers modularly is shown, and several extensions of the lazy approach are mentioned.
Proceedings ArticleDOI
Combinatorial sketching for finite programs
TL;DR: SKETCH is a language for finite programs with linguistic support for sketching and its combinatorial synthesizer is complete for the class of finite programs, guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems.