TLA+ Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

TLA+ Proofs

Résumé

TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's mutual exclusion algorithm as a simple example and show how TLAPS and the Toolbox (an IDE for TLA+) help users to manage large, complex proofs. A shorter version of this article was published at the conference Formal Methods 2012.
Fichier non déposé

Dates et versions

hal-00726632 , version 1 (30-08-2012)

Identifiants

  • HAL Id : hal-00726632 , version 1

Citer

Denis Cousineau, Damien Doligez, Leslie Lamport, Stephan Merz, Daniel Ricketts, et al.. TLA+ Proofs. AI meets Formal Software Development, Jul 2012, Dagstuhl, Germany. 16 p. ⟨hal-00726632⟩
388 Consultations
1 Téléchargements

Partager

Gmail Facebook X LinkedIn More