Encoding TLA+ proof obligations safely for SMT - INRIA - Institut National de Recherche en Informatique et en Automatique
Journal Articles Science of Computer Programming Year : 2025

Encoding TLA+ proof obligations safely for SMT

Abstract

The TLA + Proof System (TLAPS) allows users to verify proofs with the support of automated theorem provers, including SMT solvers. To increase trust in TLAPS, we revisited the encoding of TLA + for SMT, 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
scp2024.pdf (647.24 Ko) Télécharger le fichier
Origin Files produced by the author(s)
licence

Dates and versions

hal-04701040 , version 1 (18-09-2024)

Licence

Identifiers

Cite

Rosalie Defourné. Encoding TLA+ proof obligations safely for SMT. Science of Computer Programming, 2025, Selected Papers From the Rigorous State-Based Methods 9th International Conference( ABZ 2023), 239 (103178), ⟨10.1016/J.SCICO.2024.103178⟩. ⟨hal-04701040⟩
246 View
11 Download

Altmetric

Share

More