Verifying Safety Properties With the TLA+ Proof System

Kaustuv Chaudhuri (1) , Damien Doligez (2) , Leslie Lamport (3) , Stephan Merz (4)

1 PARSIFAL - Proof search and reasoning with logic specifications
2 GALLIUM - Programming languages, types, compilation and proofs
3 Microsoft Research [Redmond]
4 VERIDIS - VERIfication pour les systèmes DIStribués

TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs written in a declarative style requiring little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. A Proof Manager uses backend verifiers such as theorem provers, proof assistants, SMT solvers, and decision procedures to check TLA+ proofs. This paper documents the first public release of TLAPS, distributed with a BSD-like license. It handles almost all the non-temporal part of TLA+ as well as the temporal reasoning needed to prove standard safety properties, in particular invariance and step simulation, but not liveness properties.

Domaines: Logique en informatique [cs.LO]

Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, Stephan Merz. Verifying Safety Properties With the TLA+ Proof System. Fifth International Joint Conference on Automated Reasoning - IJCAR 2010, Jul 2010, Edinburgh, United Kingdom. pp.142--148, ⟨10.1007/978-3-642-14203-1_12⟩. ⟨inria-00534821⟩