Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS
arXiv:2211.07216 · doi:10.1007/978-3-031-19849-6_6
Abstract
Using an algorithm due to Safra for distributed termination detection as a running example, we present the main tools for verifying specifications written in TLA+. Examining their complementary strengths and weaknesses, we suggest a workflow that supports different types of analysis and that can be adapted to the desired degree of confidence.