Results 1  10
of
109
On the Logic of TLA+
 Computers and Informatics
, 2003
"... TLA+ is a language intended for the highlevel specification of reactive, distributed, and in particular asynchronous systems. Combining the lineartime temporal logic TLA and classical settheory, it provides an expressive specification formalism and supports assertional verification. ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
TLA+ is a language intended for the highlevel specification of reactive, distributed, and in particular asynchronous systems. Combining the lineartime temporal logic TLA and classical settheory, it provides an expressive specification formalism and supports assertional verification.
TLA in Pictures
, 1995
"... Predicateaction diagrams, which are similar to standard statetransition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specificationand those descriptions then proved correct even when the ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
Predicateaction diagrams, which are similar to standard statetransition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specificationand those descriptions then proved correct even when
TLA+ Proofs
"... TLA + is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA + proofs and check them with TLAPS, the TLA + Proof System. We use Peterson’s mutual exclusion algorithm as a simple example and show how TLAP ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
TLA + is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA + proofs and check them with TLAPS, the TLA + Proof System. We use Peterson’s mutual exclusion algorithm as a simple example and show how
Hybrid Systems in TLA+
, 1993
"... . TLA + is a general purpose, formal specification language based on the Temporal Logic of Actions, with no builtin primitives for specifying realtime properties. Here, we use TLA + to define operators for specifying the temporal behavior of physical components obeying integral equations of ev ..."
Abstract

Cited by 57 (5 self)
 Add to MetaCart
. TLA + is a general purpose, formal specification language based on the Temporal Logic of Actions, with no builtin primitives for specifying realtime properties. Here, we use TLA + to define operators for specifying the temporal behavior of physical components obeying integral equations
Model checking TLA+ specifications
 Correct Hardware Design and Verification Methods
, 1999
"... Abstract. TLA+ is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full firstorder logic and ZF set theory. TLC is a new model checker for debugging a TLA+ specification by checking invariance properties of a finitestate model of the specificat ..."
Abstract

Cited by 56 (8 self)
 Add to MetaCart
Abstract. TLA+ is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full firstorder logic and ZF set theory. TLC is a new model checker for debugging a TLA+ specification by checking invariance properties of a finitestate model
A formulation of TLA in Isabelle
 In Higher Order Logic Theorem Proving and Its Applications (HOL'95), volume 971 of Lect. Notes in Comp. Sci
, 1995
"... The Temporal Logic of Actions is a formalism for reasoning about concurrent and reactive systems. In this paper I present a formulation of TLA in the Isabelle theorem prover, in which I make extensive use of facilities in the Isabelle system for embedding different logics, particularly the syntax ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The Temporal Logic of Actions is a formalism for reasoning about concurrent and reactive systems. In this paper I present a formulation of TLA in the Isabelle theorem prover, in which I make extensive use of facilities in the Isabelle system for embedding different logics, particularly
Lazy caching in TLA
, 1999
"... We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA +, a formal specification language based on TLA (the Temporal Logic of Ac ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA +, a formal specification language based on TLA (the Temporal Logic
Mechanical Verification of Concurrent Systems with TLA
, 1992
"... We describe an initial version of a system for mechanically checking the correctness proof of a concurrent system. Input to the system consists of the correctness properties, expressed in TLA (the temporal logic of actions), and their proofs, written in a humanly readable, hierarchically structured ..."
Abstract

Cited by 54 (8 self)
 Add to MetaCart
We describe an initial version of a system for mechanically checking the correctness proof of a concurrent system. Input to the system consists of the correctness properties, expressed in TLA (the temporal logic of actions), and their proofs, written in a humanly readable, hierarchically structured
An Encoding of TLA in Isabelle
, 1999
"... This note describes the representation of Lamport's Temporal Logic of Actions that comes with the standard distribution of the generic theorem prover Isabelle. It is based on a simple technique for embedding possibleworlds based logics in Isabelle. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This note describes the representation of Lamport's Temporal Logic of Actions that comes with the standard distribution of the generic theorem prover Isabelle. It is based on a simple technique for embedding possibleworlds based logics in Isabelle.
Results 1  10
of
109