Abstract
AbstractMany problems in program verification, Model Checking, and type inference are naturally expressed as satisfiability of a verification condition expressed in a fragment of First-Order Logic called Constrained Horn Clauses (CHC). This transforms program analysis and verification tasks to the realm of first order satisfiability and into the realm of SMT solvers. In this paper, we give a brief overview of how CHCs capture verification problems for sequential imperative programs, and discuss CHC solving algorithm underlying the Spacer engine of SMT-solver Z3.
Publisher
Springer International Publishing
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Boosting Constrained Horn Solving by Unsat Core Learning;Lecture Notes in Computer Science;2023-12-30
2. Structure-Guided Solution of Constrained Horn Clauses;Automated Technology for Verification and Analysis;2023
3. Constrained Horn Clauses Satisfiability via Catamorphic Abstractions;Logic-Based Program Synthesis and Transformation;2023
4. The Golem Horn Solver;Computer Aided Verification;2023
5. ALASCA: Reasoning in Quantified Linear Arithmetic;Tools and Algorithms for the Construction and Analysis of Systems;2023