Harnessing SMT Solvers for TLA+ Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Harnessing SMT Solvers for TLA+ Proofs

Abstract

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 them to backend provers. We recently developed a backend that relies on a typing discipline to encode (untyped) TLA+ formulas into multi-sorted first-order logic for SMT solvers. In this paper we present a different encoding of TLA+ formulas that does not require explicit type inference for TLA+ expressions. We also present a number of techniques based on rewriting in order to simplify the resulting formulas.
Fichier principal
Vignette du fichier
avocs2012.pdf (323.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00760579 , version 1 (04-12-2012)

Identifiers

  • HAL Id : hal-00760579 , version 1

Cite

Stephan Merz, Hernán Vanzetto. Harnessing SMT Solvers for TLA+ Proofs. 12th International Workshop on Automated Verification of Critical Systems (AVoCS 2012), Sep 2012, Bamberg, Germany. ⟨hal-00760579⟩
234 View
545 Download

Share

Gmail Facebook X LinkedIn More