This paper presents an encoding of a non-temporal fragment of the TLA+ language, which includes untyped set theory, functions, arithmetic expressions, and Hilbert’s ε operator, into many-sorted firstorder logic, the input language of state-of-the-art smt solvers. This translation, based on encoding techniques such as boolification, injection of unsorted expressions into sorted languages, term rewriting, and abstraction, is the core component of a back-end prover based on smt solvers for the TLA+ Proof System.
CITATION STYLE
Merz, S., & Vanzetto, H. (2016). Encoding TLA+ into many-sorted first-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9675, pp. 54–69). Springer Verlag. https://doi.org/10.1007/978-3-319-33600-8_3
Mendeley helps you to discover research relevant for your work.