The reviewed record of science sign in
Pith

arxiv: 2404.16075 · v2 · pith:5EACDXR5 · submitted 2024-04-24 · cs.PL · cs.SE

Validating Traces of Distributed Programs Against TLA+ Specifications

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5EACDXR5record.jsonopen to challenge →

classification cs.PL cs.SE
keywords programstracesdistributedspecificationsmodelcheckerdiscrepanciesframework
0
0 comments X
read the original abstract

TLA+ is a formal language for specifying systems, including distributed algorithms, that is supported by powerful verification tools. In this work we present a framework for relating traces of distributed programs to high-level specifications written in TLA+. The problem is reduced to a constrained model checking problem, realized using the TLC model checker. Our framework consists of an API for instrumenting Java programs in order to record traces of executions, of a collection of TLA+ operators that are used for relating those traces to specifications, and of scripts for running the model checker. Crucially, traces only contain updates to specification variables rather than full values, and developers may choose to trace only certain variables. We have applied our approach to several distributed programs, detecting discrepancies between the specifications and the implementations in all cases. We discuss reasons for these discrepancies, best practices for instrumenting programs, and how to interpret the verdict produced by TLC.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Can LLMs Write Correct TLA+ Specifications? Evaluating Natural-Language-to-TLA+ Generation

    cs.AI 2026-06 accept novelty 8.0

    Across 30 LLMs and 205 TLA+ tasks, syntactic correctness reaches at most 26.6% and semantic correctness 8.6%, with all successes limited to progressive prompting and no advantage from larger models.