The existence of refinement mappings
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evolving algebras 1993: Lipari guide
Specification and validation methods
The bakery algorithm: yet another specification and verification
Specification and validation methods
High Level System Design and Analysis Using Abstract State Machines
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
A Generic Approach to the Formal Specification of Requirements
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
A Verification Approach for Distributed Abstract State Machines
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Direct Support for Model Checking Abstract State Machines by Utilizing Simulation
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
| Hi-index | 0.00 |
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 higher-level 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-level specification for the problem description. A mathematical verification assures that the lower-level specification implements the higher-level one and is based on a refinement-relation. This methodology is demonstrated by a wellknown distributed termination detection algorithm originally invented by Dijkstra, Feijen, and van Gasteren.