Encoding TLA$^{+}$ Proof Obligations Safely for SMT - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Encoding TLA$^{+}$ Proof Obligations Safely for SMT

Abstract

The TLA+ Proof System (TLAPS) allows users to verify proofs with the support of automated provers, including SMT solvers. To better ensure the soundness of TLAPS, we revisited the encoding of TLA+ into SMT-LIB, whose implementation had become too complex. Our approach is based on a first-order axiomatization with E-matching patterns. The new encoding is available with TLAPS and achieves performances similar to the previous version, despite its simpler design.
Fichier principal
Vignette du fichier
abz2023.pdf (500.59 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04299295 , version 1 (22-11-2023)

Licence

Identifiers

Cite

Rosalie Defourné. Encoding TLA$^{+}$ Proof Obligations Safely for SMT. 9th International Conference on Rigorous State-Based Methods (ABZ 2023), May 2023, Nancy, France. pp.88-106, ⟨10.1007/978-3-031-33163-3_7⟩. ⟨hal-04299295⟩
45 View
12 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More