Typed extended decision diagrams enable scalable deductive verification of probabilistic programs by compactly representing weakest pre-expectations.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Well-chosen transformations reduce LNT code for the Algorand consensus model by a factor of three while improving readability, with properties verified via visual checking, equivalence checking, and model checking.
citing papers explorer
-
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.
-
Guidelines for Producing Concise LNT Models, Illustrated with Formal Models of the Algorand Consensus Protocol
Well-chosen transformations reduce LNT code for the Algorand consensus model by a factor of three while improving readability, with properties verified via visual checking, equivalence checking, and model checking.