Encoding TLA$^{+}$ Proof Obligations Safely for SMT - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

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

Résumé

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 sous embargo
Fichier sous embargo
0 0 14
Année Mois Jours
Avant la publication
jeudi 16 mai 2024
Fichier sous embargo
jeudi 16 mai 2024
Connectez-vous pour demander l'accès au fichier

Dates et versions

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

Licence

Paternité

Identifiants

Citer

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⟩
37 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More