Skip to main content
Article thumbnail
Location of Repository

AsmL Specification and Verification of Lamport’s Bakery Algorithm

By Matko Botinčan

Abstract

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

Topics: AsmL, abstract state machines, formal verification, concurrent
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.181.159
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://web.math.hr/%7Emabotinc... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.