BmcMT: Bounded Model Checking of TLA + Specifications with SMT

Igor Konnov 1 Jure Kukovec 2 Thanh Tran 2
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
Abstract : We present the development version of BmcMT—a symbolic model checker for TLA+. It finds, whether a TLA+ specification satisfies an invariant candidate by checking satisfiability of an SMT formula that encodes: (1) an execution of bounded length, and (2) preservation of the invariant candidate in every state of the execution. Our tool is still in the experimental phase, due to a number of challenges posed by TLA+ semantics to SMT solvers. We will discuss these challenges and our current approach to them in the talk. Our preliminary experiments show that BmcMT scales better than the standard TLA+ model checker TLC for large parameter values, e.g., when a TLA+ specification models a system of 10 processes, though TLC is more efficient for tiny parameters, e.g., when the system has 3 processes. We believe that early feedback from the TLA+ community will help us to focus on the most important language features and improve our tool.
Document type :
Documents associated with scientific events
Liste complète des métadonnées

https://hal.inria.fr/hal-01899719
Contributor : Igor Konnov <>
Submitted on : Friday, October 19, 2018 - 5:15:23 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Document(s) archivé(s) le : Sunday, January 20, 2019 - 3:58:59 PM

File

kkt18-bmcmt.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01899719, version 1

Collections

Citation

Igor Konnov, Jure Kukovec, Thanh Tran. BmcMT: Bounded Model Checking of TLA + Specifications with SMT. TLA+ Community Meeting 2018, Jul 2018, Oxford, United Kingdom. ⟨hal-01899719⟩

Share

Metrics

Record views

61

Files downloads

24