Symbolic model checking for TLA+ made faster
From MaRDI portal
Publication:6535348
DOI10.1007/978-3-031-30823-9_7zbMATH Open1543.68227MaRDI QIDQ6535348
Natasha Sharygina, Rodrigo Otoni, Jure Kukovec, [[Person:6202196|Author name not available (Why is that?)]], Patrick Eugster
Publication date: 13 December 2023
Could not fetch data.
Cites Work
- On the hardness of failure-sensitive agreement problems.
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
- Asynchronous consensus and broadcast protocols
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Verification of threshold-based distributed algorithms by decomposition to decidable logics
This page was built for publication: Symbolic model checking for TLA+ made faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535348)
