Lazy caching in TLA

Authors:
Peter Ladkin;Leslie Lamport;Bryan Olivier;Denis Roegel
Affiliations:
Universität Bielefeld, Technische Fakultät, Postfach 10 01 31, D-33501 Bielefeld, Germany;Sytems Research Center, i30 Lytton Avenue, Palo Alto, CA;Kattenburgergracht 17, Appt. E, NL-1018 KN Amsterdam, The Netherlands;LORIA, Campus Scientifique, B.P. 239, F-54506 Vandeouvre-les-Nancy Cedex, France
Venue:
Distributed Computing - Special issue: Verification of lazy caching
Year:
1999

Citing 15
Cited 11

Parallel program design: a foundation

Parallel program design: a foundation
A simple approach to specifying concurrent systems

Communications of the ACM
Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
The existence of refinement mappings

Theoretical Computer Science
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Lazy caching

ACM Transactions on Programming Languages and Systems (TOPLAS)
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor

IEEE Transactions on Computers
Should your specification language be typed

ACM Transactions on Programming Languages and Systems (TOPLAS)
Social processes and proofs of theorems and programs

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Specifying and Verifying Fault-Tolerant Systems

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Hybrid Systems in TLA+

Hybrid Systems
Mechanical Verification of Concurrent Systems with TLA

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Sequential consistency and the lazy caching algorithm

Distributed Computing - Special issue: Verification of lazy caching

Using “test model-checking” to verify the Runway-PA8000 memory model

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Formal Verification of Coherence for a Shared Memory Multiprocessor Model

PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Extending Memory Consistency of Finite Prefixes to Infinite Computations

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model Checking TLA+ Specifications

CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Verifying Sequential Consistency on Shared-Memory Multiprocessor Systems

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Using Timestamping and History Variables to Verify Sequential Consistency

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking

IEEE Transactions on Parallel and Distributed Systems
Eternity variables to prove simulation of specifications

ACM Transactions on Computational Logic (TOCL)
Universal extensions to simulate specifications

Information and Computation
Simulation refinement for concurrency verification

Science of Computer Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 Actions). We then describe how to construct and check a formal TLA correctness proof.