English

Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS

Logic in Computer Science 2022-11-15 v1

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.

Keywords

Cite

@article{arxiv.2211.07216,
  title  = {Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS},
  author = {Igor Konnov and Markus Kuppe and Stephan Merz},
  journal= {arXiv preprint arXiv:2211.07216},
  year   = {2022}
}