| Publication | Date of Publication | Type |
|---|
| Concurrent algorithms | 2024-10-28 | Paper |
| On-the-fly garbage collection: an exercise in cooperation | 2024-10-28 | Paper |
| Mathematical proof between generations | 2024-09-26 | Paper |
| Disk paxos | 2020-12-04 | Paper |
| Arbitration-free synchronization | 2020-12-04 | Paper |
| Fairness and hyperfairness | 2020-12-03 | Paper |
| Lazy caching in TLA | 2020-12-03 | Paper |
| The mutual exclusion problem. I: A theory of interprocess communication | 2020-11-10 | Paper |
| The mutual exclusion problem: part II---Statement and solutions | 2020-11-10 | Paper |
| The Byzantine generals problem | 2020-11-10 | Paper |
| The part-time parliament | 2020-11-10 | Paper |
| Time, clocks, and the ordering of events in a distributed system | 2020-11-10 | Paper |
| The computer science of concurrency: the early years | 2020-11-10 | Paper |
| A new solution of Dijkstra's concurrent programming problem | 2020-11-10 | Paper |
| How to make a microprocessor computer that correctly executes multiprocess programs | 2020-11-10 | Paper |
| If you're not writing a program, don't use a programming language | 2019-12-09 | Paper |
| Open systems in TLA | 2017-09-29 | Paper |
| Formal specification of a web services protocol | 2013-09-11 | Paper |
| Implementing dataflow with threads | 2013-06-28 | Paper |
| Fast Paxos | 2013-06-20 | Paper |
| Lower bounds for asynchronous consensus | 2013-06-20 | Paper |
| Buridan's principle | 2013-01-07 | Paper |
| How to write a 21\(^{\text{st}}\) century proof | 2012-12-05 | Paper |
| TLA + Proofs | 2012-11-08 | Paper |
| The mailbox problem | 2012-02-06 | Paper |
| Byzantizing Paxos by refinement | 2011-10-28 | Paper |
| Computer science and state machines | 2010-03-09 | Paper |
| The PlusCal Algorithm Language | 2009-08-20 | Paper |
| The Mailbox Problem | 2008-11-20 | Paper |
| Checking a Multithreaded Algorithm with + CAL | 2008-09-09 | Paper |
| Formal specification of a web services protocol | 2007-01-09 | Paper |
| Correct Hardware Design and Verification Methods | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413396 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766889 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934623 | 2001-05-06 | Paper |
| When does a correct mutual exclusion algorithm guarantee mutual exclusion? | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4261731 | 1999-09-30 | Paper |
| Proving possibility properties | 1999-02-02 | Paper |
| Processes are in the eye of the beholder | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385544 | 1998-05-14 | Paper |
| How to Write a Proof | 1997-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873664 | 1996-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320537 | 1995-02-01 | Paper |
| Critique of the Lake Arrowhead three | 1992-09-27 | Paper |
| The existence of refinement mappings | 1991-01-01 | Paper |
| A theorem on atomicity in distributed algorithms | 1990-01-01 | Paper |
| On interprocess communication. I: Basic formalism | 1986-01-01 | Paper |
| On interprocess communication. II: Algorithms | 1986-01-01 | Paper |
| The mutual exclusion problem | 1986-01-01 | Paper |
| The mutual exclusion problem | 1986-01-01 | Paper |
| Synchronizing clocks in the presence of faults | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3704884 | 1985-01-01 | Paper |
| The ``Hoare Logic of CSP, and All That | 1984-01-01 | Paper |
| Specifying Concurrent Program Modules | 1983-01-01 | Paper |
| The Weak Byzantine Generals Problem | 1983-01-01 | Paper |
| The Byzantine Generals Problem | 1982-01-01 | Paper |
| Proving Liveness Properties of Concurrent Programs | 1982-01-01 | Paper |
| An assertional correctness proof of a distributed algorithm | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945578 | 1982-01-01 | Paper |
| Reaching Agreement in the Presence of Faults | 1980-01-01 | Paper |
| The Hoare logic of concurrent programs | 1980-01-01 | Paper |
| How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs | 1979-01-01 | Paper |
| A New Approach to Proving the Correctness of Multiprocess Programs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190101 | 1979-01-01 | Paper |
| On the proof of correctness of a calendar program | 1979-01-01 | Paper |
| Time, clocks, and the ordering of events in a distributed system | 1978-01-01 | Paper |
| Proving the Correctness of Multiprocess Programs | 1977-01-01 | Paper |
| Concurrent reading and writing | 1977-01-01 | Paper |
| The synchronization of independent processes | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4057582 | 1975-01-01 | Paper |
| Multiple byte processing with full-word instructions | 1975-01-01 | Paper |
| A new solution of Dijkstra's concurrent programming problem | 1974-01-01 | Paper |
| The parallel execution of DO loops | 1974-01-01 | Paper |
| An extension of a theorem of Hamada on the Cauchy problem with singular data | 1973-01-01 | Paper |
| Comment on Bell's quadratic quotient method for hash coded searching | 1970-01-01 | Paper |
