Maurice Herlihy's Publications
2007
Eddon, G., and Herlihy, M. Language Support and Compiler Optimizations for STM and Transactional Boosting. ICDCIT 2007, pp. 209-224.
Ferri, C., Moreshet, T., Bahar, R., Benini, L., and Herlihy, M. A hardware/software framework for supporting transactional memory in a MPSoC environment. 47-54. [ postscript ]
Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N. A., and Newport, C. C. On the weakest failure detector ever. PODC 2007, pp. 235-243.
Herlihy, M., Lev, Y., Luchangco, V., and Shavit, N. A Simple Optimistic Skiplist Algorithm. SIROCCO 2007, pp. 124-138.
2006
Dvir, O., Herlihy, M., and Shavit, N. Virtual Leashing: Creating a computational foundation for software protection. Journal of Parallel and Distributed Computing, Sep 2006. [ pdf ]
Gafni, E., Rajsbaum, S., and Herlihy, M. Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. In Lecture Notes in Computer Science. Sigmod 06, 2006, pp. 329-338. [ pdf ]
Guerraoui, R., Herlihy, M., and Pochon, B. A Topological Treatment of Early-Deciding Set-Agreement. OPODIS, pp. 20-35. [ pdf ]
Herlihy, M., Kuhn, F., Tirthapura, S., and Wattenhofer, R. Dynamic Analysis of the Arrow Distributed Protocol. Theory of Computing Systems 39, 6 (Sep 2006), 875-901. [ pdf ]
Herlihy, M., Luchangco, V., and Moir, M. A flexible framework for implementing software transactional memory. In Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications (2006), Conference on Object Oriented Programming Systems Languages and Applications, pp. 253-262. [ pdf ]
Herlihy, M., and Tirthapura, S. Randomized Smoothing Networks. Journal of Parallel and Distributed Computing 66, 5 (2006), 626-632. [ pdf ]
Moreshet, T., Bahar, R. I., and Herlihy, M. Energy implications of multiprocessor synchronization. In Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures (2006), ACM Symposium on Parallel Algorithms and Architectures, p. 329. [ pdf ]
Tirthapura, S., and Herlihy, M. Self-Stabilizing Distributed Queuing. IEEE Transactions on Parallel and Distributed Systems 17, 7 (Jul 2006), 646-655. [ pdf ]
Vafeiadis, V., Herlihy, M., Hoare, T., and Shapiro, M. Proving correctness of highly-concurrent linearisable objects. In Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming (2006), Principles and Practice of Parallel Programming, pp. 129-136. [ pdf ]
2005
Cole, C., and Herlihy, M. Snapshots and Software Transactional Memory. Science of Computer Programming 58, 3 (Dec 2005), 310-324. [ pdf ]
Dvir, O., Herlihy, M., and Shavit, N. Virtual Leashing: Internet-Based Software Piracy Protection. In Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS) (2005), pp. 283-292. [ pdf ]
Freiling, F., Herlihy, M., and Penso, L. Optimal Randomized Omission-Tolerant Uniform Consensus in Message Passing Systems. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS) (Dec 2005). [ pdf ]
Guerraoui, R., Herlihy, M. P., and Pochon, S. Polymorphic Contention Management. In Proceedings of the 19th International Symposium on Distributed Computing (DISC05) (Cracow, Poland, Sep 2005), pp. 303-323. [ pdf ]
Guerraoui, R., Herlihy, M., and Pochon, B. Toward a Theory of Transactional Contention Managers. In Proceedings of the 24th Annual Symposium on Principles of Distributed Computing (PODC) (Jul 2005), pp. 258-264. [ pdf ]
Harris, T., Marlowe, S., Peyton-Jones, S., and Herlihy, M. Composable Memory Transactions. In Principles and Practice of Parallel Programming (PPOPP) (2005), pp. 48-60. [ pdf ]
Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, B., and Shavit, N. A Lazy Concurrent List-based Set Algorithm. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS) (Dec 2005). [ pdf ]
Herlihy, M., and Sun, Y. Distributed Transactional Memory for Metric-Space Networks. In Proceedings of the 19th International Symposium on Distributed Computing (DISC-05) (Sep 2005), P. Fraigniaud, Ed., Springer, pp. 324-338. [ pdf ]
Herlihy, M., Luchangco, V., Martin, P., and Moir, M. Nonblocking Memory Management Support for Dynamic-sized Data Structures. ACM Transactions on Computer Systems 23, 2 (2005), 146-196. [ pdf ]
Moreshet, T., Bahar, R. I., and Herlihy, M. Energy Reduction in Multiprocessor Systems Using Transactional Memory. In Proceedings of the International Symposium on Low Power Electronics and Design (Aug 2005), pp. 331-334. [ pdf ]
Rajwar, R., Herlihy, M., and Lai, K. Virtualizing Transactional Memory. In Proceedings of the 32nd Annual International Symposium on Computer Architecture (2005), pp. 494-505. [ pdf ]
2004
Doherty, S., Herlihy, M., Luchangco, V., and Moir, M. Bringing Practical Lock-free Synchronization to 64-bit Applications. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC-04) (New York, NY, USA, 2004), ACM Press, pp. 31-39. [ pdf ]
Fatourou, P., and Herlihy, M. Read-modify-write Networks. Distributed Computing 17, 1 (2004), 33-46. [ pdf ]
Herlihy, M. P., Rajsbaum, S., and Tuttle, M. An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems. In Proceedings of the Sixth Workshop on Geometric and Topological Methods in Concurrency and Distributed Computing (Oct 2004). [ pdf ]
Herlihy, M. P., and Tirthapura, S. Randomized Smoothing Networks. In Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS-04) (2004). [ pdf ]
2003
Herlihy, M., Luchangco, V., and Moir, M. Obstruction-free Synchronization: Double-ended Queues as an Example. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (May 2003), pp. 522-529. [ pdf ]
Herlihy, M., and Tirthapura, S. Self-Stabilizing Smoothing and Counting. In Proceedings of the 23rd International Conference on Distributed Computing Systems (May 2003), pp. 4-11. [ pdf ]
Herlihy, M., Luchangco, V., and Moir, M. Space and Time Adaptive Non-blocking Algorithms. Electr. Notes Theor. Comput. Sci. 78 (2003). [ pdf ]
Herlihy, M., Luchangco, V., Moir, M., and Scherer, W. Software Transactional Memory for Dynamic-sized Data Structures. In Proceedings of the 22nd Annual ACM Special Interest Group on Operating Systems (SIGOPS) - Special Interest Group on Algorithms and Computation Theory (SIGACT) Symposium on Principles of Distributed Computing (Jul 2003). [ pdf ]
Herlihy, M., and Penso, L. D. Tight Bounds for k-Set Agreement with Limited-scope Failure Detectors. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC-03) (New York, NY, USA, 2003), ACM Press, p. 221. [ pdf ]
2002
Busch, C., and Herlihy, M. Sorting and Counting Networks of Small Depth and Arbitrary Width. Theory of Computing Systems 35, 2 (2002), 99-138. [ pdf ]
Busch, C., Demetriou, N., Herlihy, M., and Mavronicolas, M. Threshold Counters with Increments and Decrements. Theoretical Computer Science 270, 1-2D (Jan 2002), 811-826. [ pdf ]
Herlihy, M., and Rajsbaum, S. A Classification of Wait-Free Loop Agreement Tasks. Theoretical Computer Science 291, 1 (Nov 2002), 55-77. [ pdf ]
Herlihy, M., Luchangco, V., and Moir, M. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structure. In Proceedings of the 16th International Symposium on Distributed Computing (Oct 2002), pp. 339-353. [ pdf ]
2001
Busch, C., Herlihy, M., and Wattenhofer, R. Routing without Flow Control. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, Hersonissos, Greece (Jul 2001), pp. 11-20. [ pdf ]
Fatourou, P., and Herlihy, M. Adding Networks. In Proceedings of the 15th International Symposium on Distributed Computing (DISC 2001), Lisbon, Portugal (Oct 2001), pp. 330-342. [ pdf ]
Herlihy, M. On Beyond Registers: Wait-free Readable Objects. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 01) (2001), ACM Press, pp. 26-42. [ pdf ]
Herlihy, M. P., Tirthapura, S., and Wattenhofer, R. Competitive Concurrent Distributed Queuing. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC01) (2001), pp. 127-133. [ pdf ]
Herlihy, M., Rajsbaum, S., and Tuttle, M. A New Synchronous Lower Bound for Set Agreement. In Proceedings of the 15th International Symposium on Distributed Computing (DISC 2001), Lisbon, Portugal (Oct 2001), pp. 136-150. [ pdf ]
Herlihy, M., Tirthapura, S., and Wattenhofer, R. Ordered Multicast and Distributed Swap. Operating Systems Review 35, 1 (2001), 85-95. [ pdf ]
Herlihy, M., and Tirthapura, S. Self-Stabilizing Distributed Queueing. In Proceedings of the 15th International Symposium on Distributed Computing (Oct 2001), pp. 209-223. [ pdf ]
2000
Aiello, W., Busch, C., Herlihy, M., Mavronicolas, M., Shavit, N., and Touitou, D. Supporting Increment and Decrement Operations in Balancing Networks. Chicago Journal of Theoretical Computer Science (2000). [ pdf ]
Busch, C., Demetriou, N., Herlihy, M., and Mavronicolas, M. A Combinatorial Characterization of Properties Preserved by Antitokens. Bulletin of the European Association for Theoretical Computer Science, 71 (Jun 2000), 114-132. [ pdf ]
Busch, C., Demetriou, N., Herlihy, M., and Mavronicolas, M. A Combinatorial Characterization of Properties Preserved by Antitokens. In Euro-Par 2000 (2000), pp. 575-582. [ pdf ]
Busch, C., Herlihy, M., and Wattenhofer, R. Hard-Potato Routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000), ACM Press, pp. 278-285. [ pdf ]
Busch, C., Herlihy, M., and Wattenhofer, R. Randomized Greedy Hot-Potato Routing. In Proceedings of the 11th Annual ACM Society for Industrial and Applied Mathematics (SIAM) Symposium on Discrete Algorithms (2000), ACM Press, pp. 458-466. [ pdf ]
Herlihy, M., and Rajsbaum, S. Algebraic Spans. Mathematical Structures in Computer Science 10, 4 (2000), 549-573. [ pdf ]
Herlihy, M., and Ruppert, E. On the Existence of Booster Types. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FOCS) (Nov 2000), pp. 653-663. [ pdf ]
Herlihy, M., and Warres, M. P. A Tale of Two Directories: Implementing Distributed Shared Objects in Java. Concurrency: Practice and Experience 12, 7 (2000), 555-572. [ pdf ]
1999
Aiello, W., Busch, C., Herlihy, M., Mavronicolas, M., Shavit, N., and Touitou, D. Supporting Increment and Decrement Operations in Balancing Networks. In Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (Trier, Germany, Mar 1999), pp. 393-403. [ pdf ]
Busch, C., and Herlihy, M. Sorting and Counting Networks of Small Depth and Arbitrary Width. In Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (1999), ACM Press, pp. 64-73. [ pdf ]
Busch, C., Demetriou, N., Herlihy, M., and Mavronicolas, M. Threshold Counters with Increments and Decrements. In Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO99) (Lacaneau, France, Jun 1999), pp. 47-61.
Dwork, C., Herlihy, M. P., Plotkin, S., and Waarts, O. Time-Lapse Snapshots. SIAM Journal on Computing 28, 5 (1999), 1848-1874. [ pdf ]
Herlihy, M. The Aleph Toolkit: Support for Scalable Distributed Shared Objects. In Proceedings of the Workshop on Communication, Architecture, and Applications for Network-based Parallel Computing (Jan 1999), pp. 137-149.
Herlihy, M., and Rajsbaum, S. New Perspectives in Distributed Computing. In Mathematical Foundations of Computer Science (Sep 1999), pp. 170-186. [ pdf ]
Herlihy, M., and Shavit, N. The Topological Structure of Asynchronous Computability. Journal of the Association for Computing Machinery (ACM) 46, 6 (1999), 858-923. [ pdf ]
Herlihy, M. P., and Warres, M. P. A Tale of Two Directories: Implementing Distributed Shared Objects in Java. In Proceedings of the ACM Java Grande Conference (Palo Alto, California, Jun 1999), pp. 99-108. [ pdf ]
Soma Chaudhuri, M. H., and Tuttle, M. R. Wait-free Implementations in Message-passing Systems. Theoretical Computer Science 220 (Jun 1999), 211-245. [ pdf ]
1998
Demmer, M. J., and Herlihy, M. P. The Arrow Directory Protocol. In Proceedings of the 12th International Symposium on Distributed Computing (1998), pp. 119-133. [ pdf ]
Fich, F., Herlihy, M., and Shavit, N. On the Space Complexity of Randomized Synchronization. Journal of the Association for Computing Machinery (ACM) 45, 5 (1998), 843-862. [ pdf ]
Herlihy, M., Rajsbaum, S., and Tuttle, M. R. Unifying Synchronous and Asynchronous Message-passing Models. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (1998), ACM Press, pp. 133-142. [ pdf ]
Herlihy, M., and Rajsbaum, S. A Wait-Free Classification of Loop Agreement Tasks. In Proceedings of the 12th International Symposium on Distributed Computing (DISC98) Andros, Greece (Sep 1998), pp. 175-185. [ pdf ]
1997
Dwork, C., Herlihy, M., and Waarts, O. Contention in Shared Memory Algorithms. Journal of the Association for Computing Machinery (ACM) 44, 6 (1997), 779-805. [ pdf ]
Herlihy, M., and Rajsbaum, S. The Decidability of Distributed Decision Tasks (Extended Abstract). In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997), ACM Press, pp. 589-598. [ pdf ]
1996
Herlihy, M. P., and Shavit, N. Applications of Algebraic Topology to Concurrent Computation. In Applications of Advanced Architecture Computers, G. Astfalk, Ed. SIAM Press, 1996.
Herlihy, M., and Rajsbaum, S. Algebraic Topology and Distributed Computing - a Primer. In Computer Science Today - Recent Trends and Developments, J. van Leeuwen, Ed. Springer-Verlag, 1996. [ pdf ]
Herlihy, M., Shavit, N., and Waarts, O. Linearizable Counting Networks. Distributed Computing 9, 4 (1996). [ pdf ]
1995
Attiya, H., Herlihy, M., and Rachman, O. Atomic Snapshots in Expected O(n) Operations Using Lattice Agreement. Distributed Computing 8, 3 (Mar 1995), 121-132.
Herlihy, M. P., and Rajsbaum, S. Algebraic Spans. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (Ottawa, Aug 1995). [ pdf ]
Herlihy, M., Lim, B.-H., and Shavit, N. Scalable Concurrent Counting. ACM Transactions on Computer Systems 13, 4 (1995), 343-364. [ pdf ]
1994
Herlihy, M. P., and Shavit, N. A Simple Constructive Computability Theorem for Wait-Free Computation. In Proceedings of the 26th Annual Symposium on Theory of Computing (Montreal, May 1994), pp. 243-252. [ pdf ]
Aspnes, J., Herlihy, M., and Shavit, N. Counting Networks. Journal of the ACM 41, 5 (1994), 1020-1048. [ pdf ]
Herlihy, M., and Rajsbaum, S. Set Consensus Using Arbitrary Objects (preliminary version). In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (1994), ACM Press, pp. 324-333. [ pdf ]
1993
Herlihy, M. P., and Shavit, N. The Asynchronous Computability Theorem for t-Resilient Tasks. In 25th Annual Symposium on Theory of Computing (San Diego, California, May 1993), pp. 111-120. [ pdf ]
Chaudhuri, S., Herlihy, M. P., Lynch, N., and Tuttle, M. R. A Tight Lower Bound for k-set Agreement. In Proceedings of the ACM Symposium on Foundations of Computer Science (Oct 1993), pp. 206-215. [ pdf ]
Dwork, C., and Herlihy, M. Bounded Round Numbers. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (1993), ACM Press, pp. 53-64. [ pdf ]
Fich, F., Herlihy, M. P., and Shavit, N. On the Complexity of Randomized Synchronization. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (Ithaca, NY, Aug 1993).
Herlihy, M. A Methodology for Implementing Highly Concurrent Data Objects. ACM Transactions on Programming Languages and Systems 15, 5 (Nov 1993), 745-770. [ pdf ]
Herlihy, M., and Moss, J. E. B. Transactional Memory: Architectural Support For Lock-Free Data Structures. In Proceedings of the Twentieth Annual International Symposium on Computer Architecture (1993), pp. 289-300. [ pdf ]
1992
Attiya, H., Herlihy, M. P., and Rachman, O. Efficient Atomic Snapshots Using Lattice Agreement. In Proceedings of the 6th International Workshop on Distributed Algorithms (Nov 1992), A. Segall and S. Zaks, Eds., Springer-Verlag, pp. 33-53.
Dwork, C., Herlihy, M., Plotkin, S. A., and Waarts, O. Time-Lapse Snapshots. In Proceedings of the Israel Symposium on Theory of Computing Systems (1992), pp. 154-170.
Herlihy, M., Lynch, N., Merritt, M., and Weihl, W. On the Correctness of Orphan Management Algorithms. Journal of the Association for Computing Machinery (ACM) 39, 4 (1992), 881-930. [ pdf ]
Herlihy, M., and Moss, J. Lock-Free Garbage Collection for Multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3, 2 (Apr 1992), 304-311. [ pdf ]
1991
Aspnes, J., Herlihy, M. P., and Shavit, N. Counting Networks and Multiprocessor Coordination. In Proceedings of the 23rd Annual Symposium on Theory of Computing (New Orleans, Louisiana, May 1991). [ pdf ]
Herlihy, M., and Weihl, W. Hybrid Concurrency Control for Abstract Data Types. Journal of Computer and System Sciences, 41 (1991), 25-61.
Herlihy, M. Impossibility Results for Asynchronous PRAM. In Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures (Jul 1991), pp. 327-336. [ pdf ]
Herlihy, M. P., Shavit, N., and Waarts, O. Low Contention Linearizable Counting. In Proceedings of the ACM Symposium on Foundations of Computer Science (San Juan, Puerto Rico, Oct 1991). [ pdf ]
Herlihy, M. P., and Moss, J. E. B. Lock-Free Garbage Collection for Multiprocessors. In Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures (Hilton Head, North Carolina, Jul 1991), pp. 229-236. [ pdf ]
Herlihy, M. Randomized Wait-free Concurrent Objects (extended abstract). In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (1991), ACM Press, pp. 11-21. [ pdf ]
Herlihy, M., and Wing, J. Specifying Graceful Degradation. IEEE Transactions on Parallel and Distributed Systems 2, 1 (Jul 1991), 93-104. [ pdf ]
Herlihy, M. Wait-free Synchronization. ACM Transactions on Programming Languages and Systems 13, 1 (1991), 124-149. [ pdf ]
1990
Aspnes, J., and Herlihy, M. Fast Randomized Consensus Using Shared Memory. Journal of Algorithms 11, 3 (1990), 441-461. [ pdf ]
Aspnes, J., and Herlihy, M. Wait-free Data Structures in the Asynchronous PRAM Model. In Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures (1990), ACM Press, pp. 340-349. [ pdf ]
Herlihy, M. Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types. ACM Transactions on Database Systems 15, 1 (1990), 96-124. [ pdf ]
Herlihy, M. Concurrency and Availability as Dual Properties of Replicated Atomic Data. Journal of the Association for Computing Machinery (ACM) 37, 2 (1990), 257-278. [ pdf ]
Herlihy, M. P., and Tuttle, M. R. Lower Bounds for Wait-Free Computation in Message-Passing Systems. In Proceedings of the 9th Annual Symposium on Principles of Distributed Systems (Quebec City, Canada, Aug 1990), pp. 347-362. [ pdf ]
Herlihy, M. P., and Wing, J. M. Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems 12, 3 (1990), 463-492. [ pdf ]
Herlihy, M. P. A Methodology for Implementing Highly Concurrent Data Structures. In Proceedings of the 2nd ACM Special Interest Group: Programming Languages (SIGPLAN) Symposium on Principles and Practice of Parallel Programming (Seattle, WA, Mar 1990), pp. 197-206. [ pdf ]
1989
Herlihy, M., and Tygar, J. Implementing Distributed Capabilities Without a Trusted Kernel. In Proceedings of the International Working Conference on Dependable Computing for Critical Applications (Aug 1989).
Herlihy, M. P., and Wing, J. M. Specifying Security Constraints with Relaxation Lattices. In Computer Security Foundations Workshop II (Jun 1989), pp. 47-53. [ pdf ]
Herlihy, M., and McKendry, M. Timestamp-based Orphan Elimination. IEEE Transactions on Software Engineering 15, 7 (Jul 1989), 825-831. [ pdf ]
1988
Detlefs, D., Herlihy, M., and Wing, J. Inheritance of Synchronization and Recovery Properties in Avalon/C++. IEEE Computer 21, 12 (Dec 1988), 57-69.
Detlefs, D. L., Herlihy, M. P., and Wing, J. M. Inheritance of Synchronization and Recovery Properties in Avalon/C++. In Proceedings of the Hawaii International Conference on Systems Science (HICSS) (Jan 1988).
Herlihy, M. P., and Weihl, W. E. Hybrid Concurrency Control for Abstract Data Types. In Proceedings of the 7th ACM Special Interest Group On Management of Data (SIGMOD) - Special Interest Group on Algorithms and Computation Theory (SIGACT) Symposium on Principles of Database Systems (Mar 1988), pp. 201-210.
Herlihy, M. P. Impossibility and Universality Results for Wait-free Synchronization. In Proceedings of the Seventh ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) - Special Interest Group on Operating Systems (SIGOPS) Symposium on Principles of Distributed Computing (Aug 1988), pp. 276-290.
Herlihy, M. P., and Wing, J. M. Reasoning About Atomic Objects. In Proceedings of the Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (Sep 1988), pp. 193-208.
1987
Herlihy, M. P., and Wing, J. M. Axioms for Concurrent Objects. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages (Jan 1987), pp. 13-26.
Herlihy, M., and Wing, J. Avalon: Language Support for Reliable Distributed Systems. In Proceedings of the 17th Symposium on Fault-Tolerant Computer Systems (Jul 1987).
Herlihy, M. P., Lynch, N. A., Merritt, M., and Weihl, W. E. On the Correction of Orphan Elimination Algorithms. In Proceedings of the 17th Symposium on Fault-Tolerant Computer Systems (Jul 1987).
Herlihy, M. Concurrency Versus Availability: Atomicity Mechanisms for Replicated Data. ACM Transactions on Computer Systems 5, 3 (1987), 249-274.
Herlihy, M. Dynamic Quorum Adjustment for Partitioned Data. ACM Transactions on Database Systems 12, 2 (1987), 170-194. [ pdf ]
Herlihy, M. Extending Multiversion Timestamping Protocols to Exploit Type Information. IEEE Transactions on Computers C-35, 4 (Apr 1987), 443-449.
Herlihy, M., and Tygar, J. D. How to Make Replicated Data Secure. In CRYPTO (1987), pp. 379-391. [ pdf ]
Herlihy, M. P., and Wing, J. M. Specifying Graceful Degradation in Distributed Systems. In Proceedings of the 6th ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) - Special Interest Group on Operating Systems (SIGOPS) Symposium on Priniciples of Distributed Computing (Aug 1987), pp. 167-177.
1986
Herlihy, M. P. Optimistic Concurrency Control for Abstract Data Types. In Proceedings of the Fifth ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) - Special Interest Group on Operating Systems (SIGOPS) Symposium on Principles of Distributed Computing (Aug 1986), pp. 206-217.
Herlihy, M. A Quorum-Consensus Replication Method for Abstract Data Types. ACM Transactions on Computer Systems 4, 1 (1986), 32-53. [ pdf ]
Liskov, B., Herlihy, M., and Gilbert, L. Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing. In Proceedings of the 13th ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) - Special Interest Group for Programming Languages (SIGPLAN) Symposium on Principles of Programming Languages (1986), ACM Press, pp. 150-159.
McKendry, M. S., and Herlihy, M. P. Time-driven Orphan Elimination. In Proceedings of the Fifth Symposium on Reliability in Distributed Software and Database Systems (Jan 1986), pp. 42-48.
1985
Herlihy, M. P. Comparing How Atomicity Mechanisms Support Replication. In Proceedings of the Fourth ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) - Special Interest Group on Operating Systems (SIGOPS) Symposium on Principles of Distributed Computing (Aug 1985), pp. 102-110.
1982
Herlihy, M. P., and Liskov, B. A Value Transmission Method for Abstract Data Types. ACM Transactions on Programming Languages and Systems 4, 4 (1982), 527-551. [ pdf ]
| Page Owner: Maurice Herlihy | Last Modified: Fri Nov 3 15:46:54 2006 |