engleski

AsmL Specification and Verification of Lamport's Bakery Algorithm

We present a specification of Lamport's Bakery algorithm written in AsmL specification language. By exploration of the state space of the induced labeled transition system we show how to verify important safety and liveness properties of the algorithm.

AsmL; abstract state machines; formal verification; concurrent programming

nije evidentirano