| 2008 |
|---|
| 125 | EE | Marcos Kawazoe Aguilera,
Eli Gafni,
Leslie Lamport:
The Mailbox Problem.
DISC 2008: 1-15 |
| 124 | EE | Kaustuv Chaudhuri,
Damien Doligez,
Leslie Lamport,
Stephan Merz:
A TLA+ Proof System.
LPAR Workshops 2008 |
| 123 | EE | Kaustuv Chaudhuri,
Damien Doligez,
Leslie Lamport,
Stephan Merz:
A TLA+ Proof System
CoRR abs/0811.1914: (2008) |
| 122 | EE | Leslie Lamport:
Implementing dataflow with threads.
Distributed Computing 21(3): 163-181 (2008) |
| 2007 |
|---|
| 121 | EE | Leslie Lamport:
DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems.
DISC 2007: 504 |
| 120 | EE | James E. Johnson,
David E. Langworthy,
Leslie Lamport,
Friedrich H. Vogt:
Formal specification of a Web services protocol.
J. Log. Algebr. Program. 70(1): 34-52 (2007) |
| 2006 |
|---|
| 119 | EE | Leslie Lamport:
Checking a Multithreaded Algorithm with +CAL.
DISC 2006: 151-163 |
| 118 | EE | Leslie Lamport:
The +CAL Algorithm Language.
FORTE 2006: 23 |
| 117 | EE | Leslie Lamport:
The +CAL Algorithm Language.
NCA 2006: 5 |
| 116 | EE | Jim Gray,
Leslie Lamport:
Consensus on transaction commit.
ACM Trans. Database Syst. 31(1): 133-160 (2006) |
| 115 | EE | Leslie Lamport:
Lower bounds for asynchronous consensus.
Distributed Computing 19(2): 104-125 (2006) |
| 114 | EE | Leslie Lamport:
Fast Paxos.
Distributed Computing 19(2): 79-103 (2006) |
| 2005 |
|---|
| 113 | EE | Leslie Lamport:
Real-Time Model Checking Is Really Simple.
CHARME 2005: 162-175 |
| 112 | EE | Partha Dutta,
Rachid Guerraoui,
Leslie Lamport:
How Fast Can Eventual Synchrony Lead to Consensus?.
DSN 2005: 22-27 |
| 2004 |
|---|
| 111 | | Leslie Lamport:
Recent Discoveries from Paxos.
DSN 2004: 3 |
| 110 | EE | Leslie Lamport,
Mike Massa:
Cheap Paxos.
DSN 2004: 307-314 |
| 109 | EE | Jim Gray,
Leslie Lamport:
Consensus on Transaction Commit
CoRR cs.DC/0408036: (2004) |
| 108 | EE | James E. Johnson,
David E. Langworthy,
Leslie Lamport,
Friedrich H. Vogt:
Formal Specification of a Web Services Protocol.
Electr. Notes Theor. Comput. Sci. 105: 147-158 (2004) |
| 2003 |
|---|
| 107 | EE | Leslie Lamport:
Lower Bounds for Asynchronous Consensus.
Future Directions in Distributed Computing 2003: 22-23 |
| 106 | EE | Eli Gafni,
Leslie Lamport:
Disk Paxos.
Distributed Computing 16(1): 1-20 (2003) |
| 105 | EE | Leslie Lamport:
Arbitration-free synchronization.
Distributed Computing 16(2-3): 219-237 (2003) |
| 104 | EE | Rajeev Joshi,
Leslie Lamport,
John Matthews,
Serdar Tasiran,
Mark R. Tuttle,
Yuan Yu:
Checking Cache-Coherence Protocols with TLA+.
Formal Methods in System Design 22(2): 125-131 (2003) |
| 2002 |
|---|
| 103 | | Leslie Lamport:
Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers
Addison-Wesley 2002 |
| 102 | EE | Leslie Lamport,
John Matthews,
Mark R. Tuttle,
Yuan Yu:
Specifying and verifying systems with TLA+.
ACM SIGOPS European Workshop 2002: 45-48 |
| 101 | EE | Brannon Batson,
Leslie Lamport:
High-Level Specifications: Lessons from Industry.
FMCO 2002: 242-261 |
| 100 | | Leslie Lamport:
Paxos Made Simple, Fast, and Byzantine.
OPODIS 2002: 7-9 |
| 2000 |
|---|
| 99 | EE | Eli Gafni,
Leslie Lamport:
Disk Paxos.
DISC 2000: 330-344 |
| 98 | EE | Leslie Lamport:
Distributed algorithms in TLA (abstract).
PODC 2000: 3 |
| 97 | EE | Leslie Lamport:
Fairness and hyperfairness.
Distributed Computing 13(4): 239-245 (2000) |
| 96 | EE | Leslie Lamport,
Sharon E. Perl,
William E. Weihl:
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Inf. Process. Lett. 76(3): 131-134 (2000) |
| 1999 |
|---|
| 95 | EE | Yuan Yu,
Panagiotis Manolios,
Leslie Lamport:
Model Checking TLA+ Specifications.
CHARME 1999: 54-66 |
| 94 | EE | Homayoon Akhiani,
Damien Doligez,
Paul Harter,
Leslie Lamport,
Joshua Scheid,
Mark R. Tuttle,
Yuan Yu:
Cache Coherence Verification with TLA+.
World Congress on Formal Methods 1999: 1871-1872 |
| 93 | EE | Leslie Lamport,
Lawrence C. Paulson:
Should your specification language be typed.
ACM Trans. Program. Lang. Syst. 21(3): 502-526 (1999) |
| 92 | EE | Peter B. Ladkin,
Leslie Lamport,
Bryan Olivier,
Denis Roegel:
Lazy Caching in TLA.
Distributed Computing 12(2-3): 151-174 (1999) |
| 1998 |
|---|
| 91 | EE | Ernie Cohen,
Leslie Lamport:
Reduction in TLA.
CONCUR 1998: 317-331 |
| 90 | EE | Leslie Lamport:
The Part-Time Parliament.
ACM Trans. Comput. Syst. 16(2): 133-169 (1998) |
| 89 | EE | Leslie Lamport:
Proving Possibility Properties.
Theor. Comput. Sci. 206(1-2): 341-352 (1998) |
| 1997 |
|---|
| 88 | EE | Leslie Lamport:
Composition: A Way to Make Proofs Harder.
COMPOS 1997: 402-423 |
| 87 | | Leslie Lamport:
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor.
IEEE Trans. Computers 46(7): 779-782 (1997) |
| 86 | EE | Leslie Lamport:
Processes are in the Eye of the Beholder.
Theor. Comput. Sci. 179(1-2): 333-351 (1997) |
| 1996 |
|---|
| 85 | | Leslie Lamport:
Managing Proofs (Abstract).
TACAS 1996: 34 |
| 1995 |
|---|
| 84 | EE | Martín Abadi,
Leslie Lamport:
Conjoining Specifications.
ACM Trans. Program. Lang. Syst. 17(3): 507-534 (1995) |
| 83 | EE | Leslie Lamport:
TLA in Pictures.
IEEE Trans. Software Eng. 21(9): 768-775 (1995) |
| 1994 |
|---|
| 82 | | Leslie Lamport:
How good is your specification method?
FORTE 1994: 289 |
| 81 | | Leslie Lamport,
Stephan Merz:
Specifying and Verifying Fault-Tolerant Systems.
FTRTFT 1994: 41-76 |
| 80 | | Manfred Broy,
Leslie Lamport:
The RPC-Memory Specification Problem - Problem Statement.
Formal Systems Specification 1994: 1-4 |
| 79 | | Martín Abadi,
Leslie Lamport,
Stephan Merz:
A TLA Solution to the RPC-Memory Specification Problem.
Formal Systems Specification 1994: 21-66 |
| 78 | | Martín Abadi,
Leslie Lamport:
Open Systems in TLA.
PODC 1994: 81-90 |
| 77 | | Martín Abadi,
Leslie Lamport:
Decomposing Specifications of Concurrent Systems.
PROCOMET 1994: 327-340 |
| 76 | | Leslie Lamport:
TLZ.
Z User Workshop 1994: 267-268 |
| 75 | EE | Leslie Lamport:
The Temporal Logic of Actions.
ACM Trans. Program. Lang. Syst. 16(3): 872-923 (1994) |
| 74 | EE | Martín Abadi,
Leslie Lamport:
An Old-Fashined Recipe for Real-Time.
ACM Trans. Program. Lang. Syst. 16(5): 1543-1571 (1994) |
| 73 | | Leslie Lamport:
How to Write a Long Formula (Short Communication).
Formal Asp. Comput. 6(5): 580-584 (1994) |
| 1993 |
|---|
| 72 | | Robert P. Kurshan,
Leslie Lamport:
Verification of a Multiplier: 64 Bits and Beyond.
CAV 1993: 166-179 |
| 71 | | Leslie Lamport:
Verification and Specifications of Concurrent Programs.
REX School/Symposium 1993: 347-374 |
| 70 | EE | Martín Abadi,
Leslie Lamport:
Composing Specifications.
ACM Trans. Program. Lang. Syst. 15(1): 73-132 (1993) |
| 1992 |
|---|
| 69 | | Leslie Lamport:
Computer-Hindered Verification (Humans Can Do It Too).
CAV 1992: 1 |
| 68 | | Urban Engberg,
Peter Grønning,
Leslie Lamport:
Mechanical Verification of Concurrent Systems with TLA.
CAV 1992: 44-55 |
| 67 | | Leslie Lamport:
Hybrid Systems in TLA+.
Hybrid Systems 1992: 77-102 |
| 66 | | Urban Engberg,
Peter Grønning,
Leslie Lamport:
Mechanical Verification of Concurrent Systems with TLA.
Larch 1992: 86-97 |
| 65 | | Leslie Lamport:
Critique of the Lake Arrowhead Three.
Distributed Computing 6(1): 65-71 (1992) |
| 1991 |
|---|
| 64 | | Martín Abadi,
Leslie Lamport:
An Old-Fashioned Recipe for Real Time.
REX Workshop 1991: 1-27 |
| 63 | | Martín Abadi,
Bowen Alpern,
Krzysztof R. Apt,
Nissim Francez,
Shmuel Katz,
Leslie Lamport,
Fred B. Schneider:
Preserving Liveness: Comments on ``Safety and Liveness from a Methodological Point of View''.
Inf. Process. Lett. 40(3): 141-142 (1991) |
| 62 | | Martín Abadi,
Leslie Lamport:
The Existence of Refinement Mappings.
Theor. Comput. Sci. 82(2): 253-284 (1991) |
| 1990 |
|---|
| 61 | | Leslie Lamport,
Nancy A. Lynch:
Distributed Computing: Models and Methods.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1157-1199 |
| 60 | EE | Leslie Lamport:
Concurrent Reading and Writing of Clocks.
ACM Trans. Comput. Syst. 8(4): 305-310 (1990) |
| 59 | | Leslie Lamport:
win and sin: Predicate Transformers for Concurrency.
ACM Trans. Program. Lang. Syst. 12(3): 396-428 (1990) |
| 58 | | Leslie Lamport:
A Theorem on Atomicity in Distributed Algorithms.
Distributed Computing 4: 59-68 (1990) |
| 1989 |
|---|
| 57 | | Martín Abadi,
Leslie Lamport,
Pierre Wolper:
Realizable and Unrealizable Specifications of Reactive Systems.
ICALP 1989: 1-17 |
| 56 | | Martín Abadi,
Leslie Lamport:
Composing Specifications.
REX Workshop 1989: 1-41 |
| 55 | | Leslie Lamport:
A Simple Approach to Specifying Concurrent Systems.
Commun. ACM 32(1): 32-45 (1989) |
| 1988 |
|---|
| 54 | | Leslie Lamport:
While Waiting for the Millennium: Formal Specification and Verficiation of Concurrent Systems Now (Abstract).
Concurrency 1988: 3 |
| 53 | | Martín Abadi,
Leslie Lamport:
The Existence of Refinement Mappings
LICS 1988: 165-175 |
| 52 | EE | Jennifer L. Welch,
Leslie Lamport,
Nancy A. Lynch:
A Lattice-Structured Proof of a Minimum Spanning.
PODC 1988: 28-43 |
| 51 | EE | Leslie Lamport:
Control Predicates are Better than Dummy Variables for Reasoning about Program Control.
ACM Trans. Program. Lang. Syst. 10(2): 267-281 (1988) |
| 1987 |
|---|
| 50 | EE | Leslie Lamport:
A Fast Mutual Exclusion Algorithm.
ACM Trans. Comput. Syst. 5(1): 1-11 (1987) |
| 1986 |
|---|
| 49 | | Leslie Lamport:
LaTeX: User's Guide & Reference Manual
Addison-Wesley 1986 |
| 48 | | Leslie Lamport:
On Interprocess Communication. Part I: Basic Formalism.
Distributed Computing 1(2): 77-85 (1986) |
| 47 | | Leslie Lamport:
On Interprocess Communication. Part II: Algorithms.
Distributed Computing 1(2): 86-101 (1986) |
| 46 | EE | Leslie Lamport:
The mutual exclusion problem: part I - a theory of interprocess communication.
J. ACM 33(2): 313-326 (1986) |
| 45 | EE | Leslie Lamport:
The mutual exclusion problem: partII - statement and solutions.
J. ACM 33(2): 327-348 (1986) |
| 44 | | Leslie Lamport,
P. M. Melliar-Smith:
Byzantine Clock Synchronization.
Operating Systems Review 20(3): 10-16 (1986) |
| 1985 |
|---|
| 43 | | Mack W. Alford,
Jean-Pierre Ansart,
Günter Hommel,
Leslie Lamport,
Barbara Liskov,
Geoff P. Mullery,
Fred B. Schneider:
Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985 Munich
Springer 1985 |
| 42 | | Leslie Lamport,
Fred B. Schneider:
Constraints: A Uniform Approach to Aliasing and Typing.
POPL 1985: 205-216 |
| 41 | | Leslie Lamport:
What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority.
POPL 1985: 78-83 |
| 40 | EE | K. Mani Chandy,
Leslie Lamport:
Distributed Snapshots: Determining Global States of Distributed Systems
ACM Trans. Comput. Syst. 3(1): 63-75 (1985) |
| 39 | EE | Leslie Lamport,
P. M. Melliar-Smith:
Synchronizing Clocks in the Presence of Faults
J. ACM 32(1): 52-78 (1985) |
| 38 | | Leslie Lamport:
Solved Problems, Unsolved Problems and Non-Problems in Concurrency.
Operating Systems Review 19(4): 34-44 (1985) |
| 1984 |
|---|
| 37 | | Leslie Lamport,
Fred B. Schneider:
Formal Foundation for Specification and Verification.
Advanced Course: Distributed Systems 1984: 203-285 |
| 36 | | Fred B. Schneider,
Leslie Lamport:
Paradigms for Distributed Programs.
Advanced Course: Distributed Systems 1984: 431-480 |
| 35 | | Mack W. Alford,
Leslie Lamport,
Geoff P. Mullery:
Basic Concepts.
Advanced Course: Distributed Systems 1984: 7-43 |
| 34 | | Leslie Lamport:
Solved Problems, Unsolved Problems and Non-Problems in Concurrency (Invited Address).
PODC 1984: 1-11 |
| 33 | | Leslie Lamport,
P. M. Melliar-Smith:
Byzantine Clock Synchronization.
PODC 1984: 68-74 |
| 32 | EE | Leslie Lamport:
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Trans. Program. Lang. Syst. 6(2): 254-280 (1984) |
| 31 | EE | Leslie Lamport,
Fred B. Schneider:
The ``Hoare Logic'' of CSP, and All That.
ACM Trans. Program. Lang. Syst. 6(2): 281-296 (1984) |
| 1983 |
|---|
| 30 | | Leslie Lamport:
What Good is Temporal Logic?
IFIP Congress 1983: 657-668 |
| 29 | | Leslie Lamport:
Reasoning About Nonatomic Operations.
POPL 1983: 28-37 |
| 28 | | Leslie Lamport:
Problems from the Workshop on the Analysis of Concurrent Systems.
The Analysis of Concurrent Systems 1983: 252-270 |
| 27 | EE | Leslie Lamport:
Specifying Concurrent Program Modules.
ACM Trans. Program. Lang. Syst. 5(2): 190-222 (1983) |
| 26 | EE | Leslie Lamport:
The Weak Byzantine Generals Problem
J. ACM 30(3): 668-676 (1983) |
| 1982 |
|---|
| 25 | EE | Leslie Lamport,
Robert E. Shostak,
Marshall C. Pease:
The Byzantine Generals Problem.
ACM Trans. Program. Lang. Syst. 4(3): 382-401 (1982) |
| 24 | EE | Susan S. Owicki,
Leslie Lamport:
Proving Liveness Properties of Concurrent Programs.
ACM Trans. Program. Lang. Syst. 4(3): 455-495 (1982) |
| 23 | | Leslie Lamport:
An Assertional Correctness Proof of a Distributed Algorithm.
Sci. Comput. Program. 2(3): 175-206 (1982) |
| 1981 |
|---|
| 22 | | Leslie Lamport:
TIMESETS -- A New Method for Temporal Reasoning about Programs.
Logic of Programs 1981: 177-196 |
| 21 | | Leslie Lamport,
Susan S. Owicki:
Program Logics and Program Verification (position paper).
Logic of Programs 1981: 197-199 |
| 20 | | Leslie Lamport:
Password Authentification with Insecure Communication.
Commun. ACM 24(11): 770-772 (1981) |
| 1980 |
|---|
| 19 | | Leslie Lamport:
``Sometime'' is Sometimes ``Not Never'' - On the Temporal Logic of Programs.
POPL 1980: 174-185 |
| 18 | | Leslie Lamport:
The `Hoare Logic' of Concurrent Programs.
Acta Inf. 14: 21-37 (1980) |
| 17 | EE | Marshall C. Pease,
Robert E. Shostak,
Leslie Lamport:
Reaching Agreement in the Presence of Faults.
J. ACM 27(2): 228-234 (1980) |
| 1979 |
|---|
| 16 | EE | Leslie Lamport:
A New Approach to Proving the Correctness of Multiprocess Programs.
ACM Trans. Program. Lang. Syst. 1(1): 84-97 (1979) |
| 15 | | Leslie Lamport:
On the Proof of Correctness of a Calendar Program.
Commun. ACM 22(10): 554-556 (1979) |
| 14 | | Leslie Lamport:
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs.
IEEE Trans. Computers 28(9): 690-691 (1979) |
| 1978 |
|---|
| 13 | | Leslie Lamport:
The specification and proof of correctness of interactive programs.
Mathematical Studies of Information Processing 1978: 474-537 |
| 12 | | Edsger W. Dijkstra,
Leslie Lamport,
Alain J. Martin,
Carel S. Scholten,
Elisabeth F. M. Steffens:
On-the-Fly Garbage Collection: An Exercise in Cooperation.
Commun. ACM 21(11): 966-975 (1978) |
| 11 | | Leslie Lamport:
Time, Clocks, and the Ordering of Events in a Distributed System.
Commun. ACM 21(7): 558-565 (1978) |
| 10 | | Leslie Lamport:
The Implementation of Reliable Distributed Multiprocess Systems.
Computer Networks 2: 95-114 (1978) |
| 1977 |
|---|
| 9 | | Leslie Lamport:
Concurrent Reading and Writing.
Commun. ACM 20(11): 806-811 (1977) |
| 8 | | Leslie Lamport:
Proving the Correctness of Multiprocess Programs.
IEEE Trans. Software Eng. 3(2): 125-143 (1977) |
| 1976 |
|---|
| 7 | | Leslie Lamport:
The Synchronization of Independent Processes
Acta Inf. 7: 15-34 (1976) |
| 6 | | Leslie Lamport:
Comments on "A Synchronization Anomaly".
Inf. Process. Lett. 4(4): 88-89 (1976) |
| 1975 |
|---|
| 5 | | Edsger W. Dijkstra,
Leslie Lamport,
Alain J. Martin,
Carel S. Scholten,
Elisabeth F. M. Steffens:
On-the-fly garbage collection: an exercise in cooperation.
Language Hierarchies and Interfaces 1975: 43-56 |
| 4 | | Leslie Lamport:
Multiple Byte Processing with Full-Word Instructions.
Commun. ACM 18(8): 471-475 (1975) |
| 1974 |
|---|
| 3 | | Leslie Lamport:
The Hyperplane Method for an Array Computer.
Sagamore Computer Conference 1974: 113-131 |
| 2 | | Leslie Lamport:
The Parallel Execution of DO Loops.
Commun. ACM 17(2): 83-93 (1974) |
| 1 | | Leslie Lamport:
A New Solution of Dijkstra's Concurrent Programming Problem.
Commun. ACM 17(8): 453-455 (1974) |
