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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.
citing papers explorer
-
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.
-
Open Problems in a Logic of Gossips
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.