The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leslie Lamport: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  117. Computer Science and State Machines. [Citation Graph (, )][DBLP]


  118. Verifying Safety Properties with the TLA+ Proof System. [Citation Graph (, )][DBLP]


  119. The PlusCal Algorithm Language. [Citation Graph (, )][DBLP]


  120. The TLA+ Proof System: Building a Heterogeneous Verification Platform. [Citation Graph (, )][DBLP]


  121. A TLA+ Proof System. [Citation Graph (, )][DBLP]


  122. Vertical paxos and primary-backup replication. [Citation Graph (, )][DBLP]


  123. Specifying and verifying systems with TLA+. [Citation Graph (, )][DBLP]


  124. The Mailbox Problem. [Citation Graph (, )][DBLP]


  125. A TLA+ Proof System [Citation Graph (, )][DBLP]


  126. Implementing dataflow with threads. [Citation Graph (, )][DBLP]


Search in 0.193secs, Finished in 0.199secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002