Constraint-Based Relational Verification

Abstract In recent years they have been numerous works that aim to automate relational verification. Meanwhile, although Constrained Horn Clauses ( $$\mathrm {CHCs}$$ CHCs ) empower a wide range of verification techniques and tools, lack the ability express hyperproperties beyond k -safety such as generalized non-interference co-termination. This paper describes novel fully automated constraint-based approach We first introduce new class predicate Constraint Satisfaction Problems called {pfwCSP}$$ pfwCSP where constraints are represented clauses modulo first-order theories over variables three kinds: ordinary, well-founded, or functional. generalization permits arbitrary (i.e., possibly non-Horn) clauses, well-foundedness constraints, functionality is capable expressing these problems. Our enables us automatically verify problem instances require non-trivial non-sequential non-lock-step) self-composition by inferring appropriate schedulers (or alignment dictate when which program copies move. To solve problems in this language, we present constraint solving method for based on stratified CounterExample-Guided Inductive Synthesis (CEGIS) functional predicates. implemented proposed framework obtained promising results diverse scope previous frameworks.