Haniel Barbosa
YOU?
Author Swipe
View article: Lean-SMT: An SMT tactic for discharging proof goals in Lean
Lean-SMT: An SMT tactic for discharging proof goals in Lean Open
Lean is an increasingly popular proof assistant based on dependent type theory. Despite its success, it still lacks important automation features present in more seasoned proof assistants, such as the Sledgehammer tactic in Isabelle/HOL. A…
View article: lean-smt: An SMT Tactic for Discharging Proof Goals in Lean
lean-smt: An SMT Tactic for Discharging Proof Goals in Lean Open
Lean is an increasingly popular proof assistant based on dependent type theory. Despite its success, it still lacks important automation features present in more seasoned proof assistants, such as the Sledgehammer tactic in Isabelle/HOL. A…
View article: Satisfiability Modulo Theories: A Beginner’s Tutorial
Satisfiability Modulo Theories: A Beginner’s Tutorial Open
Great minds have long dreamed of creating machines that can function as general-purpose problem solvers. Satisfiability modulo theories (SMT) has emerged as one pragmatic realization of this dream, providing significant expressive power an…
View article: IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL
IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL Open
Satisfiability modulo theories (SMT) solvers are widely used to ensure the correctness of safety- and security-critical applications. Therefore, being able to trust a solver’s results is crucial. One way to increase trust is to generate in…
View article: An Interactive SMT Tactic in Coq using Abductive Reasoning
An Interactive SMT Tactic in Coq using Abductive Reasoning Open
A well-known challenge in leveraging automatic theorem provers, such as satisfiability modulo theories (SMT) solvers, to discharge proof obligations from interactive theorem provers (ITPs) is determining which axioms to send to the solver …
View article: Synthesising Programs with Non-trivial Constants
Synthesising Programs with Non-trivial Constants Open
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. Wh…
View article: Carcara: An Efficient Proof Checker and Elaborator for SMT Proofs in the Alethe Format
Carcara: An Efficient Proof Checker and Elaborator for SMT Proofs in the Alethe Format Open
Proofs from SMT solvers ensure correctness independently from implementation, which is often a requirement when solvers are used in safety-critical applications or proof assistants. Alethe is an established SMT proof format generated by th…
View article: cvc5: A Versatile and Industrial-Strength SMT Solver
cvc5: A Versatile and Industrial-Strength SMT Solver Open
cvc5 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 featu…
View article: Even Faster Conflicts and Lazier Reductions for String Solvers
Even Faster Conflicts and Lazier Reductions for String Solvers Open
In the past decade, satisfiability modulo theories (SMT) solvers have been extended to support the theory of strings and regular expressions. This theory has proven to be useful in a wide range of applications in academia and industry. To …
View article: Flexible Proof Production in an Industrial-Strength SMT Solver
Flexible Proof Production in an Industrial-Strength SMT Solver Open
Proof production for SMT solvers is paramount to ensure their correctness independently from implementations, which are often prohibitively difficult to verify. Historically, however, SMT proof production has struggled with performance and…
View article: Fair and Adventurous Enumeration of Quantifier Instantiations
Fair and Adventurous Enumeration of Quantifier Instantiations Open
SMT solvers generally tackle quantifiers by instantiating their variables with tuples of terms from the ground part of the formula. Recent enumerative approaches for quantifier instantiation consider tuples of terms in some heuristic order…
View article: Alethe: Towards a Generic SMT Proof Format (extended abstract)
Alethe: Towards a Generic SMT Proof Format (extended abstract) Open
The first iteration of the proof format used by the SMT solver veriT was\npresented ten years ago at the first PxTP workshop. Since then the format has\nmatured. veriT proofs are used within multiple applications, and other solvers\ngenera…
View article: Lifting congruence closure with free variables to λ-free higher-order logic via SAT encoding
Lifting congruence closure with free variables to λ-free higher-order logic via SAT encoding Open
International audience
View article: Proceedings Sixth Workshop on Proof eXchange for Theorem Proving
Proceedings Sixth Workshop on Proof eXchange for Theorem Proving Open
This volume of EPTCS contains the proceedings of the Sixth Workshop on Proof\nExchange for Theorem Proving (PxTP 2019), held on 26 August 2019 as part of the\nCADE-27 conference in Natal, Brazil. The PxTP workshop series brings together\nr…
View article: CVC4SY for SyGuS-COMP 2019
CVC4SY for SyGuS-COMP 2019 Open
CVC4Sy is a syntax-guided synthesis (SyGuS) solver based on bounded term enumeration and, for restricted fragments, quantifier elimination. The enumerative strategies are based on encoding term enumeration as an extension of the quantifier…
View article: Better SMT Proofs for Easier Reconstruction
Better SMT Proofs for Easier Reconstruction Open
International audience
View article: cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis
cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis Open
We present cvc4sy, a syntax-guided synthesis (SyGuS) solver based on three bounded term enumeration strategies. The first encodes term enumeration as an extension of the quantifier-free theory of algebraic datatypes. The second is based on…
View article: Higher-Order SMT Solving (Work in Progress)
Higher-Order SMT Solving (Work in Progress) Open
International audience
View article: CVC4 at the SMT Competition 2018
CVC4 at the SMT Competition 2018 Open
This paper is a description of the CVC4 SMT solver as entered into the 2018 SMT Competition. We only list important differences from the 2017 SMT Competition version of CVC4. For further and more detailed information about CVC4, please ref…
View article: Revisiting Enumerative Instantiation - Artifact
Revisiting Enumerative Instantiation - Artifact Open
This artifact contains the binaries of the SMT solvers CVC4 and Z3, the benchmarks on which they were evaluated, and the running scripts for each configuration evaluated. An overview of the results obtained from this evaluation in the Star…
View article: Language and Proofs for Higher-Order SMT (Work in Progress)
Language and Proofs for Higher-Order SMT (Work in Progress) Open
Satisfiability modulo theories (SMT) solvers have throughout the years been able to cope with increasingly expressive formulas, from ground logics to full first-order logic modulo theories. Nevertheless, higher-order logic within SMT is st…
View article: Experimental Data For The Paper "Scalable Fine-Grained Proofs For Formula Processing"
Experimental Data For The Paper "Scalable Fine-Grained Proofs For Formula Processing" Open
We provide here the binary, options and experimental data for our CADE paper and the companion report. Setup The tarball containing the source code of veriT used in our experiments is available here. The command line parameters of veriT us…
View article: Congruence Closure with Free Variables
Congruence Closure with Free Variables Open
Many verification techniques nowadays successfully rely on SMT solvers as back-ends to automatically discharge proof obligations. These solvers generally rely on various instantiation techniques to handle quantifiers. We here show that the…
View article: Efficient Instantiation Techniques in SMT (Work In Progress)
Efficient Instantiation Techniques in SMT (Work In Progress) Open
International audience