1999
DOI: 10.1007/3-540-48153-2_6
|View full text |Cite
|
Sign up to set email alerts
|

Model Checking TLA+ Specifications

Abstract: TLA + is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA + specification by checking invariance properties of a finite-state model of the specification. It accepts a subclass of TLA + specifications that should include most descriptions of real system designs. It has been used by engineers to find errors in the cache coherence protocol for a new Compaq multiprocessor. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
115
0

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 183 publications
(127 citation statements)
references
References 13 publications
0
115
0
Order By: Relevance
“…We have also reprogrammed the above experiment in TLA + [Lam02] and used the TLC model checker (version 3.5 of the TLA Toolbox) [YML99]. Indeed, TLA + and the B-Method share a common basis of predicate logic and set theory.…”
Section: A Performance Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…We have also reprogrammed the above experiment in TLA + [Lam02] and used the TLC model checker (version 3.5 of the TLA Toolbox) [YML99]. Indeed, TLA + and the B-Method share a common basis of predicate logic and set theory.…”
Section: A Performance Experimentsmentioning
confidence: 99%
“…The model checker TLC (version 3.5 of the TLA Toolbox) [YML99], is written in Java and is capable of evaluating complicated predicates and finding solutions for variables. Like AnimB, TLC deals with conjuncts from left-to-right (see page 239 in Chap.…”
Section: Advantages and Difficulties Of Constraint Propagationmentioning
confidence: 99%
“…The main tool supporting TLA + is the model checker tlc [45]. It can analyse system specifications in standard form written in a sublanguage of TLA + that ensures that the next-state relation can be effectively computed.…”
Section: Discussionmentioning
confidence: 99%
“…3.2 since this condition cannot be evaluated unless requirements are represented formally. However, if requirements are indeed represented formally, e.g., in the language Temporal Logic of Actions (TLA) + [45], then an approach such as [81] can be used to evaluate condition (9) of Theorem 1.…”
Section: Additional Condition-enforcing Supportmentioning
confidence: 99%