Temporal logic formulas are encoded as MOKA programs that compute their own counterexamples, and abstract interpretation with local completeness turns this into a program verification method.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Model Checking as Program Verification by Abstract Interpretation (Extended Version)
Temporal logic formulas are encoded as MOKA programs that compute their own counterexamples, and abstract interpretation with local completeness turns this into a program verification method.