Towards certification of TLA+ proof obligations with SMT solvers - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Towards certification of TLA+ proof obligations with SMT solvers

Résumé

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 this paper we present a new backend for use with SMT solvers that supports elementary set theory, functions, arithmetic, tuples, and records. We introduce a typing discipline for TLA+ proof obligations, which helps us to disambiguate the translation of expressions of (untyped) TLA+, while ensuring its soundness. Our work is a first step towards the certification of proofs generated by proof-producing SMT solvers in Isabelle/TLA+, which is intended to be the only trusted component of TLAPS.
Fichier principal
Vignette du fichier
tla2smt.pdf (218.82 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00645458 , version 1 (28-11-2011)

Identifiants

  • HAL Id : hal-00645458 , version 1

Citer

Stephan Merz, Hernán Vanzetto. Towards certification of TLA+ proof obligations with SMT solvers. First International Workshop on Proof eXchange for Theorem Proving - PxTP 2011, Aug 2011, Wroclaw, Poland. ⟨hal-00645458⟩
209 Consultations
274 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More