AsmL Specification and Verification of Lamport�s Bakery Algorithm
نویسندگان
چکیده
منابع مشابه
The bakery algorithm: yet another specification and verification
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving algebra can be tailored to any algorithm at its own abstraction level. As example they gave an instructive proof which uses lower and higher views to show correctness of Lamport's bakery algorithm. We construct two evolving algebras capturing lower and higher view respecti...
متن کاملEmbedding and Verification of PSL using AsmL
In this paper, we propose a methodology to integrate the Property Specification Language (PSL) in the verification process of systems designed using Abstract States Machines (ASMs). We provide a complete embedding of PSL in the ASM language AsmL, which allows us to integrate PSL properties as part of the design. For the verification, we propose a technique based on the AsmL tool that translates...
متن کاملThe Bakery Algorithm: Yet Another Specification and Verification0
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving algebra can be tailored to any algorithm at its own abstraction level. As example they gave an instructive proof which uses lower and higher views to show correctness of Lamport’s bakery algorithm. We construct two evolving algebras capturing lower and higher view respecti...
متن کاملSpecification Languages and Their Use (Case: AsmL)
Specification languages are an integral part of software development. They enable concise and exact specification of software systems on different abstraction levels. Specification languages have many uses: they are used as an intermediary step from requirements towards implementation; they are used to verify critical properties of complex systems such as safety and liveness, and specifications...
متن کاملA Termination Detection Algorithm: Specification and Verification
We propose a methodology for the specification and verification of distributed algorithms using Gurevich’s concept of Abstract State Machines. The methodology relies on a distinction between a higherlevel specification and a lower-level specification of an algorithm. The algorithm is characterized by an informal problem description. A justification assures the appropriateness of the higher-leve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2005
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.2005.04.09