Skip to Main content Skip to Navigation
New interface
Conference papers

Better Automation for TLA+ Proofs

Antoine Defourné 1, 2 
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : TLA+ is a specification language based on traditional untyped set theory. It is equipped with a set of tools, including the TLA+ proof system TLAPS, which uses trusted back-end solvers to handle individual proof steps—referred to as “proof obligations”. As most solvers rely on and benefit from typed formalisms, types are first reconstructed for the obligations; however, the current encoding into the SMT-LIB format does not exploit all of this type information. In this paper, we present motivations for a more pervasive usage of types at an intermediate representation of TLA+ proof obligations, and describe work in progress on several improvements of TLAPS: a type-driven SMT encoding, a tactic for instantiation hints, and type annotations for the language. We conclude with some perspectives for future work.
Keywords : Verification TLA+ TLAPS SMT
Complete list of metadata
Contributor : Antoine Defourné Connect in order to contact the contributor
Submitted on : Tuesday, December 15, 2020 - 3:35:25 PM
Last modification on : Thursday, January 20, 2022 - 5:26:11 PM
Long-term archiving on: : Tuesday, March 16, 2021 - 6:01:32 PM


Files produced by the author(s)


  • HAL Id : hal-02990598, version 1



Antoine Defourné. Better Automation for TLA+ Proofs. JFLA 2020 - 31emes Journées Francophones des Langages Applicatifs, Zaynah Dargaye; Yann Regis-Gianas, Jan 2020, Gruissan, France. ⟨hal-02990598⟩



Record views


Files downloads