Better Automation for TLA+ Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Better Automation for TLA+ Proofs


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.
Fichier principal
Vignette du fichier
jfla-2020.pdf (465.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02990598 , version 1 (15-12-2020)


  • 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⟩
77 View
57 Download


Gmail Facebook Twitter LinkedIn More