Partially Ordered Runs: A Case Study

Authors:
Yuri Gurevich;Dean Rosenzweig
Affiliations:
-;-
Venue:
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Year:
2000

Citing 5
Cited 2

Evolving algebras 1993: Lipari guide

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

Specification and validation methods
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Communicating Evolving Algebras

CSL '92 Selected Papers from the Workshop on Computer Science Logic
Algebraic Operational Semantics and Occam

CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic

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
Yuri, logic, and computer science

Fields of logic and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoning. As a case study, we prove in detail correctness and deadlock-freedom for general partially ordered runs of distributed ASM models of Lamport's Bakery Algorithm.