Using Simulated Execution in Verifying Distributed Algorithms

Authors:
Toh Ne Win;Michael D. Ernst;Stephen J. Garland;Dilsun Kirli;Nancy A. Lynch
Affiliations:
-;-;-;-;-
Venue:
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Year:
2002

Citing 9
Cited 3

Larch: languages and tools for formal specification

Larch: languages and tools for formal specification
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Revisiting the PAXOS algorithm

Theoretical Computer Science
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Distributed Algorithms

Distributed Algorithms
Automatic generation of program specifications

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Automatic Deductive Verification with Invisible Invariants

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
An Iterative Algorithm for Synthesizing Invariants

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
MOCHA: Modularity in Model Checking

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification

Improving test suites via operational abstraction

Proceedings of the 25th International Conference on Software Engineering
MACEDON: methodology for automatically creating, evaluating, and designing overlay networks

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
The Daikon system for dynamic detection of likely invariants

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a methodology for proving properties of distributed systems in which simulated execution assists and enhances formal proofs. It is well known that techniques such as testing can increase confidence in an implementation, but cannot by themselves demonstrate correctness. In addition to detecting simple errors quickly and to providing intuition about behavior, execution-based techniques can also reveal unexpected properties, suggest necessary lemmas, and provide information to structure proofs. This paper also describes the use of these techniques in a machine-checked proof of correctness of the Paxos algorithm for distributed consensus.