| 2009 |
38 | | John W. O'Leary,
Murali Talupur,
Mark R. Tuttle:
Protocol verification using flows: An industrial experience.
FMCAD 2009: 172-179 |
37 | | John W. O'Leary,
Bratin Saha,
Mark R. Tuttle:
Model Checking Transactional Memory with Spin.
ICDCS 2009: 335-342 |
36 | | Maurice Herlihy,
Sergio Rajsbaum,
Mark R. Tuttle:
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems.
Electr. Notes Theor. Comput. Sci. 230: 79-102 (2009) |
| 2008 |
35 | | Murali Talupur,
Mark R. Tuttle:
Going with the Flow: Parameterized Verification Using Message Flows.
FMCAD 2008: 1-8 |
34 | | John W. O'Leary,
Bratin Saha,
Mark R. Tuttle:
Model checking transactional memory with spin.
PODC 2008: 424 |
33 | | David James,
Tim Leonard,
John W. O'Leary,
Murali Talupur,
Mark R. Tuttle:
Extracting models from design documents with mapster.
PODC 2008: 456 |
32 | | Noga Alon,
Chen Avin,
Michal Koucký,
Gady Kozma,
Zvi Lotker,
Mark R. Tuttle:
Many random walks are faster than one.
SPAA 2008: 119-128 |
31 | | Baruch Awerbuch,
Yossi Azar,
Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Collaborate with Strangers to Find Own Preferences.
Theory Comput. Syst. 42(1): 27-41 (2008) |
| 2007 |
30 | | Ariel Cohen,
John W. O'Leary,
Amir Pnueli,
Mark R. Tuttle,
Lenore D. Zuck:
Verifying Correctness of Transactional Memories.
FMCAD 2007: 37-44 |
| 2006 |
29 | | Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Publish and perish: definition and analysis of an n-person publication impact game.
SPAA 2006: 11-18 |
| 2005 |
28 | | Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Timing Games and Shared Memory.
DISC 2005: 507-508 |
27 | | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Mark R. Tuttle:
Adaptive Collaboration in Peer-to-Peer Systems.
ICDCS 2005: 71-80 |
26 | | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Mark R. Tuttle:
Improved recommendation systems.
SODA 2005: 1174-1183 |
25 | | Baruch Awerbuch,
Yossi Azar,
Zvi Lotker,
Boaz Patt-Shamir,
Mark R. Tuttle:
Collaborate with strangers to find own preferences.
SPAA 2005: 263-269 |
| 2004 |
24 | | Baruch Awerbuch,
Boaz Patt-Shamir,
David Peleg,
Mark R. Tuttle:
Collaboration of untrusting peers with changing interests.
ACM Conference on Electronic Commerce 2004: 112-119 |
| 2003 |
23 | | David B. Lomet,
Mark R. Tuttle:
A Theory of Redo Recovery.
SIGMOD Conference 2003: 397-406 |
22 | | 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 |
21 | | Leslie Lamport,
John Matthews,
Mark R. Tuttle,
Yuan Yu:
Specifying and verifying systems with TLA+.
ACM SIGOPS European Workshop 2002: 45-48 |
| 2001 |
20 | | Maurice Herlihy,
Sergio Rajsbaum,
Mark R. Tuttle:
A New Synchronous Lower Bound for Set Agreement.
DISC 2001: 136-150 |
19 | | Maurice Herlihy,
Sergio Rajsbaum,
Mark R. Tuttle:
An Overview of Synchronous Message-Passing and Topology.
Electr. Notes Theor. Comput. Sci. 39(2): (2001) |
| 2000 |
18 | | Soma Chaudhuri,
Maurice Herlihy,
Nancy A. Lynch,
Mark R. Tuttle:
Tight bounds for k-set agreement.
J. ACM 47(5): 912-943 (2000) |
| 1999 |
17 | | David B. Lomet,
Mark R. Tuttle:
Logical Logging to Extend Recovery to New Domains.
SIGMOD Conference 1999: 73-84 |
16 | | 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 |
15 | | Soma Chaudhuri,
Maurice Herlihy,
Mark R. Tuttle:
Wait-Free Implementations in Message-Passing Systems.
Theor. Comput. Sci. 220(1): 211-245 (1999) |
| 1998 |
14 | | Maurice Herlihy,
Sergio Rajsbaum,
Mark R. Tuttle:
Unifying Synchronous and Asynchronous Message-Passing Models.
PODC 1998: 133-142 |
| 1995 |
13 | | David B. Lomet,
Mark R. Tuttle:
Redo Recovery after System Crashes.
VLDB 1995: 457-468 |
| 1994 |
12 | | Soma Chaudhuri,
Mark R. Tuttle:
Fast Increment Registers.
WDAG 1994: 74-88 |
| 1993 |
11 | | Soma Chaudhuri,
Maurice Herlihy,
Nancy A. Lynch,
Mark R. Tuttle:
A Tight Lower Bound for k-Set Agreement
FOCS 1993: 206-215 |
10 | | Gil Neiger,
Mark R. Tuttle:
Common Knowledge and Consistent Simultaneous Coordination.
Distributed Computing 6(3): 181-192 (1993) |
9 | | Joseph Y. Halpern,
Mark R. Tuttle:
Knowledge, Probability, and Adversaries.
J. ACM 40(4): 917-962 (1993) |
| 1991 |
8 | | Martín Abadi,
Mark R. Tuttle:
A Semantics for a Logic of Authentication (Extended Abstract).
PODC 1991: 201-216 |
| 1990 |
7 | | Maurice Herlihy,
Mark R. Tuttle:
Lower Bounds for Wait-Free Computation in Message-Passing Systems.
PODC 1990: 347-362 |
6 | | Gil Neiger,
Mark R. Tuttle:
Common Knowledge and Consistent Simultaneous Coordination.
WDAG 1990: 334-352 |
| 1989 |
5 | | Joseph Y. Halpern,
Mark R. Tuttle:
Knowledge, Probability, and Adversaries.
PODC 1989: 103-118 |
| 1988 |
4 | | Joseph Y. Halpern,
Yoram Moses,
Mark R. Tuttle:
A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report)
STOC 1988: 132-147 |
3 | | Yoram Moses,
Mark R. Tuttle:
Programming Simultaneous Actions Using Common Knowledge.
Algorithmica 3: 121-169 (1988) |
| 1987 |
2 | | Nancy A. Lynch,
Mark R. Tuttle:
Hierarchical Correctness Proofs for Distributed Algorithms.
PODC 1987: 137-151 |
| 1986 |
1 | | Yoram Moses,
Mark R. Tuttle:
Programming Simultaneous Actions Using Common Knowledge: Preliminary Version
FOCS 1986: 208-221 |