Mark R. Tuttle

According to our database1, Mark R. Tuttle authored at least 41 papers between 1986 and 2018.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Model Checking Boot Code from AWS Data Centers.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2015
Symbolic Execution for BIOS Security.
Proceedings of the 9th USENIX Workshop on Offensive Technologies, 2015

2012
Protocol Proof Checking Simplified with SMT.
Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

SMT-Based System Verification with DVF.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2009
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems.
Electr. Notes Theor. Comput. Sci., 2009

Model Checking Transactional Memory with Spin.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

Protocol verification using flows: An industrial experience.
Proceedings of 9th International Conference on Formal Methods in Computer-Aided Design, 2009

2008
A game of timing and visibility.
Games and Economic Behavior, 2008

Many random walks are faster than one.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Model checking transactional memory with spin.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Extracting models from design documents with mapster.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Going with the Flow: Parameterized Verification Using Message Flows.
Proceedings of the Formal Methods in Computer-Aided Design, 2008

2007
Verifying Correctness of Transactional Memories.
Proceedings of the Formal Methods in Computer-Aided Design, 7th International Conference, 2007

2006
Publish and perish: definition and analysis of an n-person publication impact game.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

2005
Timing Games and Shared Memory.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Collaborate with strangers to find own preferences.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Improved recommendation systems.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Adaptive Collaboration in Peer-to-Peer Systems.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

2004
Collaboration of untrusting peers with changing interests.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2003
Checking Cache-Coherence Protocols with TLA+.
Formal Methods in System Design, 2003

A Theory of Redo Recovery.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

2002
Specifying and verifying systems with TLA+.
Proceedings of the 10th ACM SIGOPS European Workshop, Saint-Emilion, France, July 1, 2002, 2002

2001
An Overview of Synchronous Message-Passing and Topology.
Electr. Notes Theor. Comput. Sci., 2001

A New Synchronous Lower Bound for Set Agreement.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Tight bounds for k-set agreement.
J. ACM, 2000

1999
Wait-Free Implementations in Message-Passing Systems.
Theor. Comput. Sci., 1999

Logical Logging to Extend Recovery to New Domains.
Proceedings of the SIGMOD 1999, 1999

Cache Coherence Verification with TLA+.
Proceedings of the FM'99 - Formal Methods, 1999

1998
Unifying Synchronous and Asynchronous Message-Passing Models.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1995
Redo Recovery after System Crashes.
Proceedings of the VLDB'95, 1995

1994
Fast Increment Registers.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

1993
A Tight Lower Bound for k-Set Agreement
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991
A Semantics for a Logic of Authentication (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
Common Knowledge and Consistent Simultaneous Coordination.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Lower Bounds for Wait-Free Computation in Message-Passing Systems.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989
Knowledge, Probability, and Adversaries.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988
Programming Simultaneous Actions Using Common Knowledge.
Algorithmica, 1988

A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
Hierarchical Correctness Proofs for Distributed Algorithms.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986
Programming Simultaneous Actions Using Common Knowledge: Preliminary Version
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986


  Loading...