A sound and relatively complete translation of CTL* verification and synthesis problems for reactive programs into existential Horn clauses.
Theoretical Computer Science 163(1-2), 99–116 (1996)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
CTL* Verification and Synthesis using Existential Horn Clauses
A sound and relatively complete translation of CTL* verification and synthesis problems for reactive programs into existential Horn clauses.