A TLA+ Proof System

Abstract : We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM translates a proof into a set of independent proof obligations and calls upon a collection of back-end provers to verify them. Different provers can be used to verify different obligations. The currently supported back-ends are the tableau prover Zenon and Isabelle/TLA+, an axiomatisation of TLA+ in Isabelle/Pure. The proof obligations for a complete TLA+ proof can also be used to certify the theorem in Isabelle/TLA+.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00338299
Contributor : Stephan Merz <>
Submitted on : Wednesday, November 12, 2008 - 3:48:00 PM
Last modification on : Friday, May 25, 2018 - 12:02:07 PM
Long-term archiving on: Monday, June 7, 2010 - 10:54:18 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00338299, version 1
  • ARXIV : 0811.1914

Collections

Citation

Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, Stephan Merz. A TLA+ Proof System. Knowledge Exchange: Automated Provers and Proof Assistants (KEAPPA), 2008, Doha, Qatar. ⟨inria-00338299⟩

Share

Metrics

Record views

383

Files downloads

2251