Verifying Safety Properties with the TLA+ Proof System
نویسندگان
چکیده
TLAPS, the TLA proof system, is a platform for the development and mechanical verification of TLA proofs. The TLA proof language is declarative, and understanding proofs requires 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. Proofs are written in the same language as specifications; engineers do not have to translate their high-level designs into the language of a particular verification tool. A proof manager interprets a TLA proof as a collection of proof obligations to be verified, which it sends to backend verifiers that include theorem provers, proof assistants, SMT solvers, and decision procedures. The first public release of TLAPS is available from [1], 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. Intuitively, a safety property asserts what is permitted to happen; a liveness property asserts what must happen; for a more formal overview, see [3, 10].
منابع مشابه
Towards certification of TLA+ proof obligations with SMT solvers
TLA+ is a formal specification language that is based on Zermelo-Fränkel set theory and the Temporal Logic of Actions TLA. The TLA+ proof system TLAPS assists users in deductively verifying safety properties of TLA+ specifications. TLAPS is built around a proof manager, which interprets the TLA+ proof language, generates corresponding proof obligations, and passes them to backend verifiers. In ...
متن کاملAutomatic Verification of TLA + Proof Obligations with SMT Solvers
TLA is a formal specification language that is based on ZF set theory and the Temporal Logic of Actions TLA. The TLA proof system tlaps assists users in deductively verifying safety properties of TLA specifications. tlaps is built around a proof manager, which interprets the TLA proof language, generates corresponding proof obligations, and passes them to backend verifiers. In this paper we pre...
متن کاملHarnessing SMT Solvers for TLA+ Proofs
TLA+ is a language based on Zermelo-Fraenkel set theory and linear temporal logic designed for specifying and verifying concurrent and distributed algorithms and systems. The TLA+ proof system TLAPS allows users to interactively verify safety properties of these systems. At the core of TLAPS, a proof manager interprets the proof language, generates corresponding proof obligations and passes the...
متن کاملProofs and Proof Certification in the TLA Proof System
TLA is a specification language originally designed for specifying concurrent and distributed systems and their properties. It is based on Zermelo-Fraenkel set theory for modeling data structures and on the linear-time temporal logic TLA for specifying system executions and their properties. The TLA proof system (tlaps) has been designed as an interactive proof assistant for deductively verifyi...
متن کاملTemporal Logic-based Modeling and Analysis of ASM Designs
Abstract State Machines(ASMs) constitute the basis of an alternative approach to mathematical modelling of discrete dynamic systems. The ASM approach provides an expressive means to specify the operational behavior of a system, but it does not come equipped with a(fixed) logical proof system. Several formal techniques of verifying correctness of ASM designs based on a translation into variants ...
متن کامل