- Specifying Concurrent Systems with TLA+ Leslie Lamport
- When Does a Correct Mutual Exclusion Algorithm Guarantee Mutual Exclusion?
- An Axiomatic Semantics of Concurrent Programming Languages
- l!soMEr~ME!l IS so&fETIMEs IINOT NEv~Rll On the Temporal Logic of Programs
- The Mutual Exclusion Problem Has Been Solved Leslie Lamport
- A Fast Mutual Exclusion Algorithm Leslie Lamport
- Marching to Many Distant Drummers Leslie Lamport and Timothy Mann
- Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View"
- Another Position Paper on "Fairness" Fred B. Schneider 1
- On the Glitch Phenomenon Leslie Lamport and Richard Palais 1
- Eli Gafni 1 and Leslie Lamport 2 1 Computer Science Department, UCLA
- Buridan's Principle Leslie Lamport
- Processes are in the Eye of the Beholder Leslie Lamport
- Critique of the "Lake Arrowhead Three" Leslie Lamport
- Using Time Instead of Timeout for Fault-Tolerant Distributed Systems
- On a ``Theorem'' of Peterson Leslie Lamport
- Lower Bounds for Asynchronous Leslie Lamport
- Recursive Compiling and Programming Environments
- 6. Conclusion It has been shown that the existence of a a-coloration
- A Temporal Logic of Actions Leslie Lamport
- Hybrid Systems in TLA+ Leslie Lamport
- The Future of Computing: Logic or Biology Text of a talk given at
- Vertical Paxos and Primary-Backup Replication
- Chapter on Distributed Computing Leslie Lamport and Nancy Lynch
- Hybrid Systems in TLA + Leslie Lamport
- Synchronizing Time Servers Leslie Lamport
- Pretending Atomicity Leslie Lamport and Fred B. Schneider
- Lower Bounds for Asynchronous Leslie Lamport
- The Temporal Logic of Actions LESLIE LAMPORT
- A Simple Approach to Specifying Concurrent Systems
- Measuring Celebrity Leslie Lamport
- Concurrent Reading and Writing of Clocks LESLIE LAMPORT
- Mechanical Verification of Concurrent Systems with TLA
- Byzantine Generals Transaction Commit Protocols
- On Hair Color in France Ellen Gilkerson
- Sun 12 Apr 1992 [14:36] 1 ACTION DEFINITIONS
- What It Means for a Concurrent Program to Satisfy a Specification
- TLA in Pictures Leslie Lamport
- Checking a Multithreaded Algorithm Leslie Lamport
- High-Level Specifications: Lessons from Brannon Batson
- The Mutual Exclusion Problem Has Been Solved Leslie Lamport
- Fairness and Hyperfairness Leslie Lamport
- Formal Aspects of Computing (1994) 3: 1--000 How to Write a Long Formula
- When Does a Correct Mutual Exclusion Algorithm Guarantee Mutual Exclusion?
- A Temporal Logic of Actions Leslie Lamport
- Fairness and Hyperfairness Leslie Lamport
- Real-Time Model Checking is Really Simple
- SRC Technical Note December 18, 1996
- Pretending Atomicity Leslie Lamport and Fred B. Schneider
- Proving Possibility Properties Leslie Lamport
- Verification and Specification of Concurrent Programs
- How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor
- An OldFashioned Recipe for Real Time Martn Abadi and Leslie Lamport
- Control Predicates Are Better Than Dummy Variables For Reasoning About Program Control
- A Theorem on Atomicity in Distributed Algorithms
- Preserving Liveness: Comments on ``Safety and Liveness from a Methodological Point of View''
- SRC Technical Note December 18, 1996
- Chapter on Distributed Computing Leslie Lamport and Nancy Lynch
- Concurrent Reading and Writing of Clocks LESLIE LAMPORT
- Specification Problem Manfred Broy
- Byzantine Generals Transaction Commit Protocols
- The Weak Byzantine Generals Problem SRI International, Menlo Park, Califorma
- Distributed Snapshots: Determining Global States of Distributed Systems
- Specifying Concurrent Systems with TLA + Leslie Lamport
- Derivation of a Simple Synchronization Algorithm
- Lower Bounds on Consensus Leslie Lamport
- Reduction in TLA Ernie Cohen and Leslie Lamport
- A Formal Basis for the Specification of Concurrent Notes for the NATO Advanced Study Institute, Izmir, Turkey
- 1 Introduction 1 2 The General Case 2
- Adding "Process Algebra" to TLA Leslie Lamport
- Should Your Specification Language Be Typed? LESLIE LAMPORT
- Verification of a Multiplier: 64 Bits and Beyond R. P. Kurshan
- Lazy Caching in TLA Peter Ladkin Leslie Lamport Bryan Olivier
- Open Systems in TLA Martn Abadi and Leslie Lamport
- Specifying and Verifying Fault-Tolerant Systems
- Proof of the TLA Reduction Theorem Leslie Lamport
- Formal Specification of a Web Services James E. Johnson, David E. Langworthy, Leslie Lamport
- SRC Technical Note December 16, 1994
- Reduction in TLA Ernie Cohen and Leslie Lamport
- My Writings Leslie Lamport
- Document Production: Visual or Logical? Leslie Lamport
- On a "Theorem" of Peterson Leslie Lamport
- Synchronizing Time Servers Leslie Lamport
- Operating R.S. Gaines Systems Editor
- Document Production: Visual or Logical? Leslie Lamport
- Composition: A Way to Make Proofs Harder Leslie Lamport
- TLA + Verification of CacheCoherence Homayoon Akhiani, Damien Doligez # , Paul Harter, Leslie Lamport,
- Adding ``Process Algebra'' to TLA Leslie Lamport
- Computer Science Department Leslie Lamport
- The Mutual Exclusion Problem Part II: Statement and Solutions
- The Existence of Re nement Mappings Mart n Abadi and Leslie Lamport
- Should Your Specification Language Be Typed? LESLIE LAMPORT
- The PartTime Parliament Leslie Lamport
- An Axiomatic Semantics of Concurrent Programming Languages
- What Process Algebra Proofs Use Instead of Leslie Lamport
- Formal Specification of a Web Services James E. Johnson, David E. Langworthy, Leslie Lamport
- Conjoining Specifications Martn Abadi and Leslie Lamport
- Cheap Paxos Leslie Lamport and Mike Massa
- Jonathan P. BOWEN 1.1 Overview of the Z Notation . . . . . . . . . . . . . . . . . . . . . . . 3
- Constraints: A Uniform Approach to Aliasing and Typing
- How to Write a Proof Leslie Lamport
- How Fast Can Eventual Synchrony Lead to Consensus?
- Synchronizi.ngClocks in the Presenceof Faults LESLIE LAMPORT AND P. M. MELLIAR-SMITH
- Verification of a Multiplier: 64 Bits and Beyond R. P. Kurshan
- Stoppable Paxos Leslie Lamport Dahlia Malkhi Lidong Zhou
- Lower Bounds on Consensus Leslie Lamport
- Computation and State Machines Leslie Lamport
- The "Hoare Logic" of CSP, and All That LESLIE LAMPORT
- Leslie Lamport Chapter on TLA+
- How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor
- Arbitration-Free Synchronization Leslie Lamport
- win and sin: Predicate Transformers for Concurrency
- On Interprocess Communication Leslie Lamport
- Specifying and Verifying Systems With TLA + Leslie Lamport
- Specifying and Verifying FaultTolerant Systems
- The Mutual Exclusion Problem Part I: A Theory of Interprocess Communication
- A Theorem on Atomicity in Distributed Algorithms
- The Future of Computing: Logic or Biology Text of a talk given at
- August 2002 A Discussion with Leslie Lamport
- win and sin: Predicate Transformers for Concurrency
- Erratum to Lamport's "On Interprocess Communication --Part I: Basic Formalism"
- A New Approach to Proving the Correctness of Multiprocess
- 1983 Invited Address Problems, Unsolved Problems and
- }~Ek\i[A];~/I( ON ALGORITHM 292 [$22]* ]~EGULAR COULOMB WAVE FUNCTIONS [Walter
- 1A COMPLETENESS THEOREM FOR TLA Preface: A Quick Introduction to TLA
- Proof of the TLA Reduction Theorem Leslie Lamport
- What Process Algebra Proofs Use Instead of Leslie Lamport
- The Wildfire Challenge Problem Leslie Lamport, Madhu Sharma, Mark Tuttle, and Yuan Yu
- A COMPLETENESS THEOREM FOR TLA Preface: A Quick Introduction to TLA
- A Formal Basis for the Specification of Concurrent Notes for the NATO Advanced Study Institute, Izmir, Turkey
- SRC Technical Note December 16, 1994
- A Simple Approach to Specifying Concurrent Systems
- Paxos Made Simple Leslie Lamport
- Model Checking TLA + Specifications Yuan Yu, Panagiotis Manolios, and Leslie Lamport
- A GENERAL CONSTRUCTION FOR EXPRESSING REPETITIO N L . Lampor t
- Conjoining Specifications Martin Abadi and Leslie Lamport
- Proving Liveness Properties of Concurrent Programs
- A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm
- 1Sun 12 Apr 1992 [14:36] 1 ACTION DEFINITIONS
- On Hair Color in France Ellen Gilkerson
- 1 Introduction 1 2 The General Case 2
- Composing Specifications MART IN ABADI and LESLIE LAMPORT
- TLZ (Abstract) Leslie Lamport
- Decomposing Specifications of Concurrent Systems # Martn Abadi and Leslie Lamport
- The Existence of Refinement Mappings Mart'in Abadi and Leslie Lamport
- I am told that, in the world of objets d'art, anything over twentyfive years old is considered an antique. It seems appropriate to celebrate Paul's
- Buridan's Principle Leslie Lamport
- out destroying the 1D C-R property, it is necessary and sufficient that the same record appear in two queries.
- On the Glitch Phenomenon Leslie Lamport and Richard Palais 1
- 1240 PROCEEDINGS OF THEIEEE, VOL. 66, NO. 10, OCTOBER 1978 SIFT: Design and Analysis of a Fault-Tolerant
- IEEE TRANSACTIONS ON COMPUTERS, VOL. C-28, NO. 9, SEPTEMBER 1979 [1] C. Black, C.-E. Sundberg, and W. K. S. Walker, "Development of a spaceborne
- Reaching Agreement in the Presence of Faults M. PEASE, R, SHOSTAK, AND L. LAMPORT
- ample, a voice print. Such a mechanism is beyond the scope of this paper, so we restrict ourselves to the prob-
- Reasoning About Nonatomic Operations Leslie Lamport `
- LESLIE LAMPORT SRI International
- Byzantine Clock Synchronization Leslie Lamport 1
- The Mutual Exclusion Problem Part I: A Theory of Interprocess Communication
- The Mutual Exclusion Problem Part II: Statement and Solutions
- What It Means for a Concurrent Program to Satisfy a Specification
- Recursive Compiling and Programming Environments
- On Interprocess Communication Leslie Lamport
- A Fast Mutual Exclusion Algorithm Leslie Lamport
- Derivation of a Simple Synchronization Algorithm
- Control Predicates Are Better Than Dummy Variables For Reasoning About Program Control
- Another Position Paper on "Fairness" Fred B. Schneider1
- Mechanical Verification of Concurrent Systems with TLA
- Composing Specifications MARTIN ABADI and LESLIE LAMPORT
- Verification and Specification of Concurrent Programs
- How to Write a Proof Leslie Lamport
- Open Systems in TLA Martin Abadi and Leslie Lamport
- TLZ (Abstract) Leslie Lamport
- Formal Aspects of Computing (1994) 3: 1000 How to Write a Long Formula
- TLA in Pictures Leslie Lamport
- Speci cation Problem Manfred Broy
- A TLA Solution to the RPC-Memory Speci cation Problem
- I am told that, in the world of objets d'art, anything over twenty-five years old is considered an antique. It seems appropriate to celebrate Paul's
- Marching to Many Distant Drummers Leslie Lamport and Timothy Mann
- Processes are in the Eye of the Beholder Leslie Lamport
- SRC Technical Note March 11, 1998
- Composition: A Way to Make Proofs Harder Leslie Lamport
- Proving Possibility Properties Leslie Lamport
- Verification of Cache-Coherence Homayoon Akhiani, Damien Doligez
- Model Checking TLA+ Specifications
- Computer Science Department Leslie Lamport
- Specifying and Verifying Systems With TLA+ Leslie Lamport
- The PlusCal Algorithm Language Leslie Lamport
- The Mailbox Problem Marcos K. Aguilera1
- State the Problem Before Describing the Solutio n Leslie Lampor t
- Critique of the ``Lake Arrowhead Three'' Leslie Lamport
- Arbitration-Free Synchronization Leslie Lamport
- How (L A )T E X changed the face of Mathematics How (L A )T E X changed the face of Mathematics
- The Wildfire Challenge Problem Leslie Lamport, Madhu Sharma, Mark Tuttle, and Yuan Yu
- Checking CacheCoherence Protocols with TLA + Rajeev Joshi
- Constraints: A Uniform Approach to Aliasing and Typing
- Lazy Caching in TLA Peter Ladkin Leslie Lamport Bryan Olivier
- An Old-Fashioned Recipe for Real Time Martin Abadi and Leslie Lamport
- Decomposing Specifications of Concurrent Systems Martin Abadi and Leslie Lamport
- Implementing and Combining Specifications
- forumComments on Social Processes There follow a number of letters
- The Temporal Logic of Actions LESLIE LAMPORT
- SRC Technical Note March 11, 1998
- Cheap Paxos Leslie Lamport and Mike Massa
- High-Level Speci cations: Lessons from Brannon Batson
- Programming G. Manacher Techniques Editor
- Computer Science and State Machines Leslie Lamport
- and Leslie Lamport2 Computer Science Department, UCLA
- Leaderless Byzantine Paxos Leslie Lamport
- Constructing Digital Signatures from a One Way Function Leslie Lamport
- Byzantizing Paxos by Refinement Leslie Lamport
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-3, NO. 2, MARCH 1977 Proving the Correctness of Multiprocess Programs
- Leaderless Byzantine Paxos Leslie Lamport
- How to Write a 21st Century Proof
- Euclid Writes an Algorithm: A Fairytale
