Forward and backward simulations I.: untimed systems
Information and Computation
Using I/O automata for developing distributed systems
Foundations of component-based systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
The Science of Programming
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
Translation Templates to Support Strategy Development in PVS
Electronic Notes in Theoretical Computer Science (ENTCS)
Translating timed i/o automata specifications for theorem proving in PVS
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We describe a tool that improves the process of verifying relations between descriptions of a distributed algorithm at different levels of abstraction using interactive proof assistants. The tool automatically translates algorithms, written in the IOA language, into first-order logic, expressed in the Larch Shared Language, in a style that facilitates reasoning with a theorem prover. The translation uses a unified strategy to handle the various forms of nondeterminism that appear in abstract system descriptions. Applications of the tool to verify safety properties of three data management algorithms, including a substantial example based on Lamport's logical time algorithm, suggest that the tool can be used to validate complicated, practical designs.