Extracting Symbolic Transitions from $TLA+$ Specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Extracting Symbolic Transitions from $TLA+$ Specifications


In TLA+, a system specification is written as a logical formula that restricts the system behavior. As a logic, TLA+ does not have assignments and other imperative statements that are used by model checkers to compute the successor states of a system state. Model checkers compute successors either explicitly-by evaluating program statements-or symbolically-by translating program statements to an SMT formula and checking its satisfiability. To efficiently enumerate the successors, TLA's model checker TLC introduces side effects. For instance, an equality x = e is interpreted as an assignment of e to the yet unbound variable x. Inspired by TLC, we introduce an automatic technique for discovering expressions in TLA+ formulas such as x = e and x ∈ {e1,. .. , e k } that can be provably used as assignments. In contrast to TLC, our technique does not explicitly evaluate expressions, but it reduces the problem of finding assignments to the satisfiability of an SMT formula. Hence, we give a way to slice a TLA+ formula in symbolic transitions, which can be used as an input to a symbolic model checker. Our prototype implementation successfully extracts symbolic transitions from a few TLA+ benchmarks.
Fichier principal
Vignette du fichier
camera.pdf (388.65 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01871131 , version 1 (10-09-2018)



Jure Kukovec, Thanh-Hai Tran, Igor Konnov. Extracting Symbolic Transitions from $TLA+$ Specifications. Abstract State Machines, Alloy, B, TLA, VDM, and Z. ABZ 2018, Jun 2018, Southampton, United Kingdom. pp.89-104, ⟨10.1007/978-3-319-91271-4_7⟩. ⟨hal-01871131⟩
226 View
276 Download



Gmail Mastodon Facebook X LinkedIn More