Abstract: In recent years they have been numerous works that aim to automate relational verification. Meanwhile, although Constrained Horn Clauses (CHCs) empower a wide range of verification techniques and tools, they lack the ability to express hyperproperties beyond -safety such as generalized non-interference and co-termination. This paper describes a novel and fully automated constraint-based approach to relational verification. We first introduce a new class of predicate Constraint Satisfaction Problems called pfwCSP where constraints are represented as clauses modulo first-order theories over predicate variables of three kinds: ordinary, well-founded, or functional. This generalization over CHCs permits arbitrary (i.e., possibly non-Horn) clauses, well-foundedness constraints, functionality constraints, and is capable of expressing these relational verification problems. Our approach enables us to express and automatically verify problem instances that require non-trivial (i.e., non-sequential and non-lock-step) self-composition by automatically inferring appropriate schedulers (or alignment) that dictate when and which program copies move. To solve problems in this new language, we present a constraint solving method for pfwCSP based on stratified CounterExample-Guided Inductive Synthesis (CEGIS) of ordinary, well-founded, and functional predicates. We have implemented the proposed framework and obtained promising results on diverse relational verification problems that are beyond the scope of the previous verification frameworks.
Recommendations
Cites work
- scientific article; zbMATH DE number 3748394 (Why is no real title available?)
- A data driven approach for algebraic loop invariants
- Algorithms for model checking HyperLTL and HyperCTL^*
- An abstract domain to infer ordinal-valued ranking functions
- Automated hypersafety verification
- Automating induction for solving Horn clauses
- Beyond 2-safety: asymmetric product programs for relational program verification
- Constraint-based relational verification
- Dependent types from counterexamples
- Exploiting synchrony and symmetry in relational verification
- Horn clause solvers for program verification
- Hypercollecting semantics and its application to static analysis of information flow
- ICE-based refinement type discovery for higher-order functional programs
- Learning refinement types
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Overfitting in synthesis: theory and practice
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs
- Property directed self composition
- Ranking Templates for Linear Loops
- Relational bytecode correlations
- Relaxed stratification: a new approach to practical complete predicate refinement
- Simple relational correctness proofs for static analyses and program transformations
- Static Analysis
- Syntax-guided termination analysis
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards modularly comparing programs using automated theorem provers
- Verifying hyperliveness
Cited in
(13)- Constraint-based relational verification
- Decision tree learning in CEGIS-based termination analysis
- Exploiting synchrony and symmetry in relational verification
- Software Verification of Hyperproperties Beyond k-Safety
- Predicate pairing for program verification
- Maintaining state constraints in relational databases: a proof theoretic basis
- Automating induction for solving Horn clauses
- RHLE: modular deductive verification of relational \(\forall \exists\) properties
- Relational verification through Horn clause transformation
- Predicate pairing with abstraction for relational verification
- Certified verification of relational properties
- Static Analysis
- Lockstep composition for unbalanced loops
This page was built for publication: Constraint-based relational verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832229)
