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 \tlaplus 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.
Domaines
Logique en informatique [cs.LO]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...