CTL* Verification and Synthesis using Existential Horn Clauses
For researchers in formal verification and synthesis, this work provides a unified method for handling CTL* specifications, which subsumes LTL and CTL, though the evaluation is limited to case studies without quantitative comparisons.
This work proposes a novel approach for automatic verification and synthesis of infinite-state reactive programs with respect to CTL* specifications by translating them to Existential Horn Clauses (EHCs). The approach is proven sound and relatively complete, with case studies demonstrating its applicability.
This work proposes a novel approach for automatic verification and synthesis of infinite-state reactive programs with respect to ${CTL}^*$ specifications, based on translation to Existential Horn Clauses (EHCs). $CTL^*$ is a powerful temporal logic, which subsumes the temporal logics LTL and CTL, both widely used in specification, verification, and synthesis of complex systems. EHCs with its solver E-HSF, is an extension of Constrained Horn Clauses, which includes existential quantification as well as the power of handling well-foundedness. We develop the translation system \textit{Trans}, which given a verification problem consisting of a program $P$ and a specification $ϕ$, builds a set of EHCs which is satisfiable iff $P$ satisfies $ϕ$. We also develop a synthesis algorithm that given a program with holes in conditions and assignments, fills the holes so that the synthesized program satisfies the given $CTL^*$ specification. We prove that our verification and synthesis algorithms are both sound and relative complete. Finally, we present case studies to demonstrate the applicability of our algorithms for $CTL^*$ verification and synthesis.