论文信息 - A TLA+ Proof System

A TLA+ Proof System

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+.

[1] Christophe Ringeissen,et al. Decision Procedures for the Formal Analysis of Software , 2006, ICTAC.

[2] Leslie Lamport,et al. Mechanical Verification of Concurrent Systems with TLA , 1992, Larch.

[3] Christine Paulin-Mohring,et al. The coq proof assistant reference manual , 2000 .

[4] Leslie Lamport,et al. How to Write a Proof , 1995 .

[5] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[6] Damien Doligez,et al. Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs , 2007, LPAR.

[7] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

[8] Piotr Rudnicki,et al. An Overview of the MIZAR Project , 1992 .

[9] Leslie Lamport,et al. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers [Book Review] , 2002, Computer.

[10] Leslie Lamport,et al. Disk Paxos , 2003, Distributed Computing.

[11] A. Leisenring. Mathematical logic and Hilbert's ε-symbol , 1971 .

[12] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.

[13] François Pessaux,et al. Secure Software within Focal , 2008 .

[14] Stephan Merz,et al. Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants , 2006, TACAS.