A TLA+ Proof System
| dc.creator | Chaudhuri, Kaustuv C. | |
| dc.creator | Doligez, Damien | |
| dc.creator | Lamport, Leslie | |
| dc.creator | Merz, Stephan | |
| dc.date | 2008-11-12 | |
| dc.date.accessioned | 2026-07-07T10:17:44Z | |
| dc.date.available | 2026-07-07T10:17:44Z | |
| dc.description | 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+. | |
| dc.identifier | https://arxiv.org/abs/0811.1914 | |
| dc.identifier | http://arxiv.org/abs/0811.1914 | |
| dc.identifier | Knowledge Exchange: Automated Provers and Proof Assistants (KEAPPA) (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173954 | |
| dc.subject | Logic in Computer Science | |
| dc.title | A TLA+ Proof System | |
| dc.type | text |