cvc5: A versatile and industrial-strength SMT solver
Abstract 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 …
on the successful code base of CVC4. This paper serves as a comprehensive system …
Computing exact worst-case gas consumption for smart contracts
The Ethereum platform is a public, distributed, blockchain-based database that is
maintained by independent parties. A user interacts with Ethereum by writing programs and …
maintained by independent parties. A user interacts with Ethereum by writing programs and …
The SMT competition 2015–2018
Abstract The International Satisfiability Modulo Theories Competition is an annual
competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the …
competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the …
Transition power abstractions for deep counterexample detection
While model checking safety of infinite-state systems by inferring state invariants has
steadily improved recently, most verification tools still rely on a technique based on bounded …
steadily improved recently, most verification tools still rely on a technique based on bounded …
The Golem Horn Solver
The logical framework of Constrained Horn Clauses (CHC) models verification tasks from a
variety of domains, ranging from verification of safety properties in transition systems to …
variety of domains, ranging from verification of safety properties in transition systems to …
CHC-COMP 2023: Competition Report
E De Angelis - arXiv preprint arXiv:2404.14923, 2024 - arxiv.org
CHC-COMP 2023 is the sixth edition of the Competition of Solvers for Constrained Horn
Clauses. The competition was run in April 2023 and the results were presented at the 10th …
Clauses. The competition was run in April 2023 and the results were presented at the 10th …
Murxla: A modular and highly extensible API fuzzer for SMT solvers
SMT solvers are highly complex pieces of software with performance, robustness, and
correctness as key requirements. Complementing traditional testing techniques for these …
correctness as key requirements. Complementing traditional testing techniques for these …
Competition Report: CHC-COMP-21
G Fedyukovich, P Rümmer - arXiv preprint arXiv:2109.04635, 2021 - arxiv.org
CHC-COMP-21 is the fourth competition of solvers for Constrained Horn Clauses. In this
year, 7 solvers participated at the competition, and were evaluated in 7 separate tracks on …
year, 7 solvers participated at the competition, and were evaluated in 7 separate tracks on …
Carcara: An Efficient Proof Checker and Elaborator for SMT Proofs in the Alethe Format
B Andreotti, H Lachnitt, H Barbosa - … on Tools and Algorithms for the …, 2023 - Springer
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 …
often a requirement when solvers are used in safety-critical applications or proof assistants …
[PDF][PDF] Split Transition Power Abstraction for Unbounded Safety
Transition Power Abstraction (TPA) is a recent symbolic model checking approach that
leverages Craig interpolation to create a sequence of symbolic abstractions for transition …
leverages Craig interpolation to create a sequence of symbolic abstractions for transition …