A Verification Approach for Distributed Abstract State Machines

Authors:
Robert Eschbach
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 7
Cited 0

Evolving algebras 1993: Lipari guide

Specification and validation methods
The bakery algorithm: yet another specification and verification

Specification and validation methods
Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
A Termination Detection Algorithm: Specification and Verification

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
On the Formal Semantics of SDL-2000: A Compilation Approach Based on an Abstract SDL Machine

ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Partially Ordered Runs: A Case Study

ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
The Semantics of the C Programming Language

CSL '92 Selected Papers from the Workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Within verification of distributed Abstract State Machines one often has to prove properties related to the state transition level induced by partially ordered runs. This paper shows how such a transition level in form of a transition graph may be constructed. In this way the verification can be carried out directly on the transition graph. The construction itself is given as a sequential non-deterministic ASM.