A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
In: CA V ’16
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Typed extended decision diagrams enable scalable deductive verification of probabilistic programs by compactly representing weakest pre-expectations.
citing papers explorer
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams
Typed extended decision diagrams enable scalable deductive verification of probabilistic programs by compactly representing weakest pre-expectations.