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 …
Analysis and transformation of constrained Horn clauses for program verification
This paper surveys recent work on applying analysis and transformation techniques that
originate in the field of constraint logic programming (CLP) to the problem of verifying …
originate in the field of constraint logic programming (CLP) to the problem of verifying …
The blockchain litmus test
TD Smith - 2017 IEEE International Conference on Big Data …, 2017 - ieeexplore.ieee.org
Bitcoin's underlying blockchain database is a novel approach to recordkeeping that has the
potential to decentralize big data. Bitcoin's success has inspired a multitude of spinoff …
potential to decentralize big data. Bitcoin's success has inspired a multitude of spinoff …
[PDF][PDF] Solving constrained Horn clauses modulo algebraic data types and recursive functions.
HG VK, S Shoham, A Gurfinkel - Proc. ACM Program. Lang., 2022 - tau.ac.il
Authors' addresses: Hari Govind VK, Department of Electrical and Computer Engineering,
University of Waterloo, Canada, hgvk94@ gmail. com; Sharon Shoham, Tel-Aviv University …
University of Waterloo, Canada, hgvk94@ gmail. com; Sharon Shoham, Tel-Aviv University …
Superposition with structural induction
S Cruanes - International Symposium on Frontiers of Combining …, 2017 - Springer
Superposition-based provers have been successfully used to discharge proof obligations
stemming from proof assistants. However, many such obligations require induction to be …
stemming from proof assistants. However, many such obligations require induction to be …
Type-checking CRDT convergence
G Zakhour, P Weisenburger… - Proceedings of the ACM on …, 2023 - dl.acm.org
Conflict-Free Replicated Data Types (CRDTs) are a recent approach for keeping replicated
data consistent while guaranteeing the absence of conflicts among replicas. For correct …
data consistent while guaranteeing the absence of conflicts among replicas. For correct …
Complete first-order reasoning for properties of functional programs
Several practical tools for automatically verifying functional programs (eg, Liquid Haskell
and Leon for Scala programs) rely on a heuristic based on unrolling recursive function …
and Leon for Scala programs) rely on a heuristic based on unrolling recursive function …
Automated Verification of Fundamental Algebraic Laws
G Zakhour, P Weisenburger… - Proceedings of the ACM on …, 2024 - dl.acm.org
Algebraic laws of functions in mathematics–such as commutativity, associativity, and
idempotence–are often used as the basis to derive more sophisticated properties of complex …
idempotence–are often used as the basis to derive more sophisticated properties of complex …
Automating induction for solving horn clauses
H Unno, S Torii, H Sakamoto - … , CAV 2017, Heidelberg, Germany, July 24 …, 2017 - Springer
Verification problems of programs in various paradigms can be reduced to problems of
solving Horn clause constraints on predicate variables that represent unknown inductive …
solving Horn clause constraints on predicate variables that represent unknown inductive …
Induction in saturation-based proof search
G Reger, A Voronkov - Automated Deduction–CADE 27: 27th International …, 2019 - Springer
Many applications of theorem proving, for example program verification and analysis,
require first-order reasoning with both quantifiers and theories such as arithmetic and …
require first-order reasoning with both quantifiers and theories such as arithmetic and …