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...

Abstract We apply and evaluate polynomial-time algorithms to compute two different normal forms of propositional formulas arising in verification. One the form is presented for first time. The solve word problem subtheories Boolean algebra: orthocomplemented bisemilattice (OCBSL) ortholattice (OL). Equality decides a sufficient (but not necessary) check equivalence formulas. Our contribution qu...

The cones and foci verification method from Groote and Springintveld [12] was extended to timed systems by van der Zwaag [24]. We present an extension of this cones and foci method for timed systems, which can cope with infinite τ -sequences. We prove soundness of our approach and give small verification examples.