- A Tight Lower Bound for k-Set Agreement Soma Chaudhuri Maurice Herlihyy
- Programming Simultaneous Actions Using Common Knowledge \Lambda
- Common Knowledge and Consistent Simultaneous Coordination \Lambda
- An Introduction to Input/Output Automata Nancy A. Lynch and Mark R. Tuttle
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous
- A Tight Lower Bound for kSet Agreement Soma Chaudhuri \Lambda Maurice Herlihy y Nancy A. Lynch z Mark R. Tuttle x
- Collaboration of Untrusting Peers with Changing Interests
- Fast Increment Registers Soma Chaudhuriy
- A Semantics for a Logic of Authentication (Extended Abstract)
- Games and Economic Behavior 62 (2008) 643660 www.elsevier.com/locate/geb
- Knowledge and Distributed Computation Mark R. Tuttle
- Cache Coherence Verification with TLA+ Homayoon Akhiani, Damien Doligez, Paul Harter, Leslie Lamport, Joshua
- Adaptive Collaboration in PeertoPeer Systems (Extended Abstract)
- Improved Recommendation Systems # Extended Abstract
- Knowledge, Probability, and Adversaries (Preliminary Report)
- Many Random Walks Are Faster Than One Tel Aviv University
- Common Knowledge and Consistent Simultaneous Coordination
- Logical Logging to Extend Recovery to New Domains David Lomet Mark Tuttle
- Fast Increment Registers \Lambda Soma Chaudhuri y
- TimeConstrained Automata \Lambda (Extended Abstract)
- WaitFree Implementations in MessagePassing Systems \Lambda
- Brief Announcement: Extracting Models from Design Documents with Mapster
- Common Knowledge and Consistent Simultaneous Coordination
- PARKAVENUE CONGREGATIONALCHURCH,ARLINGTON The organin the ParkAvenue C h ~ c hwas originallybuilt in 1917for St. Mark's School
- Brief Announcement: Model Checking Transactional Memory with Spin
- Hierarchical Correctness Proofs Distributed Algorithms
- Brief Announcement: Timing Games and Shared Memory
- An Overview of Synchronous MessagePassing and Topology
- A Theory of Redo Recovery David Lomet
- A Tight Lower Bound for Processor Coordination \Lambda Soma Chaudhuri y Maurice Herlihy z Nancy A. Lynch y Mark R. Tuttle z
- A KnowledgeBased Analysis of Zero Knowledge (Preliminary Report)
- strating such impressive performance typically have input languages that are too lowlevel for the kinds of protocol verification that we
- Tight Bounds for k-Set Agreement Soma Chaudhuri
- A New Synchronous Lower Bound for Set Maurice Herlihy 1 , Sergio Rajsbaum 2 , and Mark Tuttle 2
- Knowledge, Probability, and Adversaries (Preliminary Report)
- Tight Bounds for kSet Agreement Soma Chaudhuri # Maurice Herlihy + Nancy A. Lynch #
- Unifying Synchronous and Asynchronous MessagePassing Models Maurice Herlihy
- A Semantics for a Logic of Authentication (Extended Abstract)
- An Introduction to Input/Output Automata Nancy A. Lynch and Mark R. Tuttle
- Time-Constrained Automata (Extended Abstract)
- WaitFree Implementations in MessagePassing Systems Soma Chaudhuri Maurice Herlihy Mark R. Tuttle
- Wait-Free Computation in Message-Passing Systems: Preliminary Report
- Knowledge and Distributed Computation Mark R. Tuttle
- A Tight Lower Bound for Processor Coordination Soma Chaudhuriy Maurice Herlihyz Nancy A. Lynchy Mark R. Tuttlez
- Wait-Free Implementations in Message-Passing Soma Chaudhuri
- Tight Bounds for kSet Agreement Soma Chaudhuri Maurice Herlihy Nancy A. Lynch Mark R. Tuttle
- WaitFree Computation in MessagePassing Systems: Preliminary Report
- Knowledge, Probability, and Adversaries Joseph Y. Halpern
- An Overview of Synchronous Message-Passing and Topology
- Wait-Free Implementations in Message-Passing Systems Soma Chaudhuri Maurice Herlihy Mark R. Tuttle
- Tight Bounds for k-Set Agreement Soma Chaudhuri Maurice Herlihy Nancy A. Lynch Mark R. Tuttle
- Mark Rogers Tuttle Intel Corporation
- 7 Ashwood Road Acton, MA 01720
- Certifying Compositional Model Checking Algorithms in ACL2 Sandip Ray y John Matthews z Mark Tuttle x
- introduction, committeebased algorithms are simply un acceptable in a distributed setting, due to their inherent
- Hierarchical Correctness Proofs Distributed Algorithms
- Programming Simultaneous Actions Using Common Knowledge: Preliminary Version \Lambda
- Redo Recovery after System Crashes David Lomet
- Hierarchical Correctness Proofs Distributed Algorithms
- Going with the Flow: Parameterized Verification using Message Flows
- Verifying Correctness of Transactional Memories Ariel Cohen (CS/CIMS/NYU, arielc@cs.nyu.edu) John W. O'Leary (Intel, john.w.oleary@intel.com) Amir Pnueli
- Brief Announcement: Timing Games and Shared Memory
- Improved Recommendation Systems Extended Abstract
- An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous
- Collaboration of Untrusting Peers with Changing Interests
- A Theory of Redo Recovery David Lomet
- A New Synchronous Lower Bound for Set Maurice Herlihy1
- Cache Coherence Verification with TLA+ Homayoon Akhiani, Damien Doligez, Paul Harter, Leslie Lamport, Joshua
- Logical Logging to Extend Recovery to New Domains David Lomet Mark Tuttle
- Redo Recovery after System Crashes David Lomet
- A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report)
- Hierarchical Correctness Proofs Distributed Algorithms
- Programming Simultaneous Actions Using Common Knowledge: Preliminary Version
- Theory Comput Syst DOI 10.1007/s00224-007-9016-7
- Knowledge, Probability, and Adversaries Joseph Y. Halpern
- Programming Simultaneous Actions Using Common Knowledge
- Boston Chapter, American Guild of Organists Organ Advisory Committee
- C H A R L E S N . C L U T Z , A I A E M E R I T U S 296 GEORGETOWNE DRIVE H Y D E PARK, M A 01236 617.364.0912
- S. L. Huntington G Co. 29 BAYVIEW AVENUE, BOX 56, STONINGTON, CONNECTICUT 06378 (401-348.-82.~8)
- Common Knowledge and Consistent Simultaneous Coordination
- Unifying Synchronous and Asynchronous Message-Passing Models Maurice Herlihy
- Parametric Verification of Industrial Cache Protocols MURALI TALUPUR SAVA KRSTI C JOHN O'LEARY MARK R. TUTTLE
- Model checking transactional memory John O'Leary
- Protocol verification using flows: An industrial experience
- Transforming Worst-case Optimal Solutions for Simultaneous Tasks into All-case Optimal Solutions
- Model checking transactional memory with Spin John O'Leary
