default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark R. Tuttle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j11]Byron Cook, Kareem Khazem, Daniel Kroening, Serdar Tasiran, Michael Tautschnig, Mark R. Tuttle:
Model checking boot code from AWS data centers. Formal Methods Syst. Des. 57(1): 34-52 (2021)- [j10]Nathan Chong
, Byron Cook, Jonathan Eidelman, Konstantinos Kallas, Kareem Khazem, Felipe R. Monteiro, Daniel Schwartz-Narbonne, Serdar Tasiran, Michael Tautschnig, Mark R. Tuttle:
Code-level model checking in the software development workflow at Amazon Web Services. Softw. Pract. Exp. 51(4): 772-797 (2021) - 2011
- [j9]Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle:
Many Random Walks Are Faster Than One. Comb. Probab. Comput. 20(4): 481-502 (2011) - 2008
- [j8]Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
A game of timing and visibility. Games Econ. Behav. 62(2): 643-660 (2008) - [j7]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) - 2003
- [j6]Rajeev Joshi, Leslie Lamport, John Matthews, Serdar Tasiran, Mark R. Tuttle, Yuan Yu:
Checking Cache-Coherence Protocols with TLA+. Formal Methods Syst. Des. 22(2): 125-131 (2003) - 2000
- [j5]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
Tight bounds for k-set agreement. J. ACM 47(5): 912-943 (2000) - 1999
- [j4]Soma Chaudhuri, Maurice Herlihy, Mark R. Tuttle:
Wait-Free Implementations in Message-Passing Systems. Theor. Comput. Sci. 220(1): 211-245 (1999) - 1993
- [j3]Gil Neiger, Mark R. Tuttle:
Common Knowledge and Consistent Simultaneous Coordination. Distributed Comput. 6(3): 181-192 (1993) - [j2]Joseph Y. Halpern, Mark R. Tuttle:
Knowledge, Probability, and Adversaries. J. ACM 40(4): 917-962 (1993) - 1988
- [j1]Yoram Moses, Mark R. Tuttle:
Programming Simultaneous Actions Using Common Knowledge. Algorithmica 3: 121-169 (1988)
Conference and Workshop Papers
- 2020
- [c37]Nathan Chong, Byron Cook, Konstantinos Kallas, Kareem Khazem, Felipe R. Monteiro, Daniel Schwartz-Narbonne, Serdar Tasiran, Michael Tautschnig, Mark R. Tuttle:
Code-level model checking in the software development workflow. ICSE (SEIP) 2020: 11-20 - 2018
- [c36]Byron Cook, Kareem Khazem, Daniel Kroening, Serdar Tasiran, Michael Tautschnig, Mark R. Tuttle:
Model Checking Boot Code from AWS Data Centers. CAV (2) 2018: 467-486 - 2015
- [c35]Oleksandr Bazhaniuk, John Loucaides, Lee Rosenbaum, Mark R. Tuttle, Vincent Zimmer:
Symbolic Execution for BIOS Security. WOOT 2015 - 2012
- [c34]Amit Goel, Sava Krstic, Rebekah Leslie, Mark R. Tuttle:
SMT-Based System Verification with DVF. SMT@IJCAR 2012: 32-43 - [c33]Mark R. Tuttle, Amit Goel:
Protocol Proof Checking Simplified with SMT. NCA 2012: 195-202 - 2011
- [c32]Maurice Herlihy, Yoram Moses, Mark R. Tuttle:
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions. PODC 2011: 231-238 - 2009
- [c31]John W. O'Leary, Murali Talupur, Mark R. Tuttle:
Protocol verification using flows: An industrial experience. FMCAD 2009: 172-179 - [c30]John W. O'Leary, Bratin Saha, Mark R. Tuttle:
Model Checking Transactional Memory with Spin. ICDCS 2009: 335-342 - 2008
- [c29]Murali Talupur, Mark R. Tuttle:
Going with the Flow: Parameterized Verification Using Message Flows. FMCAD 2008: 1-8 - [c28]John W. O'Leary, Bratin Saha, Mark R. Tuttle:
Model checking transactional memory with spin. PODC 2008: 424 - [c27]David James, Tim Leonard, John W. O'Leary, Murali Talupur, Mark R. Tuttle:
Extracting models from design documents with mapster. PODC 2008: 456 - [c26]Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle:
Many random walks are faster than one. SPAA 2008: 119-128 - 2007
- [c25]Ariel Cohen, John W. O'Leary, Amir Pnueli, Mark R. Tuttle, Lenore D. Zuck:
Verifying Correctness of Transactional Memories. FMCAD 2007: 37-44 - 2006
- [c24]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
- [c23]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Adaptive Collaboration in Peer-to-Peer Systems. ICDCS 2005: 71-80 - [c22]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Improved recommendation systems. SODA 2005: 1174-1183 - [c21]Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Collaborate with strangers to find own preferences. SPAA 2005: 263-269 - [c20]Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Timing Games and Shared Memory. DISC 2005: 507-508 - 2004
- [c19]Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle:
Collaboration of untrusting peers with changing interests. EC 2004: 112-119 - [c18]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems. GETCO@DISC 2004: 79-102 - 2003
- [c17]David B. Lomet, Mark R. Tuttle:
A Theory of Redo Recovery. SIGMOD Conference 2003: 397-406 - 2002
- [c16]Leslie Lamport, John Matthews, Mark R. Tuttle, Yuan Yu:
Specifying and verifying systems with TLA+. ACM SIGOPS European Workshop 2002: 45-48 - 2001
- [c15]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
A New Synchronous Lower Bound for Set Agreement. DISC 2001: 136-150 - 2000
- [c14]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
An Overview of Synchronous Message-Passing and Topology. GETCO 2000: 1-17 - 1999
- [c13]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 - [c12]David B. Lomet, Mark R. Tuttle:
Logical Logging to Extend Recovery to New Domains. SIGMOD Conference 1999: 73-84 - 1998
- [c11]Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
Unifying Synchronous and Asynchronous Message-Passing Models. PODC 1998: 133-142 - 1995
- [c10]David B. Lomet, Mark R. Tuttle:
Redo Recovery after System Crashes. VLDB 1995: 457-468 - 1994
- [c9]Soma Chaudhuri, Mark R. Tuttle:
Fast Increment Registers. WDAG 1994: 74-88 - 1993
- [c8]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for k-Set Agreement. FOCS 1993: 206-215 - 1991
- [c7]Martín Abadi, Mark R. Tuttle:
A Semantics for a Logic of Authentication (Extended Abstract). PODC 1991: 201-216 - 1990
- [c6]Maurice Herlihy, Mark R. Tuttle:
Lower Bounds for Wait-Free Computation in Message-Passing Systems. PODC 1990: 347-362 - [c5]Gil Neiger, Mark R. Tuttle:
Common Knowledge and Consistent Simultaneous Coordination. WDAG 1990: 334-352 - 1989
- [c4]Joseph Y. Halpern, Mark R. Tuttle:
Knowledge, Probability, and Adversaries. PODC 1989: 103-118 - 1988
- [c3]Joseph Y. Halpern, Yoram Moses, Mark R. Tuttle:
A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report). STOC 1988: 132-147 - 1987
- [c2]Nancy A. Lynch, Mark R. Tuttle:
Hierarchical Correctness Proofs for Distributed Algorithms. PODC 1987: 137-151 - 1986
- [c1]Yoram Moses, Mark R. Tuttle:
Programming Simultaneous Actions Using Common Knowledge: Preliminary Version. FOCS 1986: 208-221
Parts in Books or Collections
- 1995
- [p1]Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle:
A Tight Lower Bound for Processor Coordination. Responsive Computer Systems 1995: 1-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
