Mark Moir

According to our database, Mark Moir authored at least 81 papers between 1993 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2022

Proof Engineering with Predicate Transformer Semantics.

Christa Jenkins, Mark Moir, Harold Carr

CoRR, 2022

An approach to translating Haskell programs to Agda and reasoning about them.

Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva

CoRR, 2022

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version.

Harold Carr, Christopher Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva

CoRR, 2022

Towards Formal Verification of HotStuff-Based Byzantine Fault Tolerant Consensus in Agda.

Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva

Proceedings of the NASA Formal Methods - 14th International Symposium, 2022

2021

Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version.

Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.

CoRR, 2021

Formal verification of authenticated, append-only skip lists in Agda.

Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.

Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021

2018

Authenticated modular maps in Haskell.

Victor Cacciari Miraldo, Harold Carr, Alex Kogan, Mark Moir, Maurice Herlihy

Proceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development, 2018

2016

Wait-Free Synchronization.

Mark Moir

Encyclopedia of Algorithms, 2016

Enhancing Accountability and Trust in Distributed Ledgers.

Maurice Herlihy, Mark Moir

CoRR, 2016

Blockchains and the Logic of Accountability: Keynote Address.

Maurice Herlihy, Mark Moir

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2014

Hardware extensions to make lazy subscription safe.

Dave Dice, Timothy L. Harris, Alex Kogan, Yossi Lev, Mark Moir

CoRR, 2014

Adaptive integration of hardware and software lock elision techniques.

Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

Towards formally specifying and verifying transactional memory.

Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir

Formal Aspects Comput., 2013

Scalable statistics counters.

Dave Dice, Yossi Lev, Mark Moir

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Using hardware transactional memory to correct and simplify and readers-writer lock algorithm.

Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores.

Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir

Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Constrained Data-Driven Parallelism.

Tim Harris, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Mark Moir

Proceedings of the 5th USENIX Workshop on Hot Topics in Parallelism, 2013

2012

A Framework for Formally Verifying Software Transactional Memory Algorithms.

Mohsen Lesani, Victor Luchangco, Mark Moir

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

On the power of hardware transactional memory to simplify memory management.

Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Lightweight parallel accumulators using C++ templates.

Yossi Lev, Mark Moir

Proceedings of the 4th International Workshop on Multicore Software Engineering, 2011

Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory.

Luke Dalessandro, François Carouge, Sean White, Yossi Lev, Mark Moir, Michael L. Scott, Michael F. Spear

Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems, 2011

2010

Simplifying concurrent algorithms by exploiting hardware transactional memory.

David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

What Kinds of Applications Can Benefit from Transactional Memory?

Mark Moir, Daniel Nussbaum

Proceedings of the Computer Architecture, 2010

2009

Nonblocking <i>k</i> -Compare-Single-Swap.

Victor Luchangco, Mark Moir, Nir Shavit

Theory Comput. Syst., 2009

Nonblocking Algorithms and Backward Simulation.

Simon Doherty, Mark Moir

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

NZTM: nonblocking zero-indirection transactional memory.

Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Early experience with a commercial hardware transactional memory implementation.

David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum

Proceedings of the 14th International Conference on Architectural Support for Programming Languages and Operating Systems, 2009

2008

Wait-Free Synchronization.

Mark Moir

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster).

Mark Moir, Kevin Moore, Daniel Nussbaum

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Toward high performance nonblocking software transactional memory.

Virendra J. Marathe, Mark Moir

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2008

2007

A Lazy Concurrent List-Based Set Algorithm.

Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit

Parallel Process. Lett., 2007

Efficient nonblocking software transactional memory.

Virendra J. Marathe, Mark Moir

Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2007

SNZI: scalable NonZero indicators.

Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006

A dynamic-sized nonblocking work stealing deque.

Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit

Distributed Comput., 2006

A flexible framework for implementing software transactional memory.

Maurice Herlihy, Victor Luchangco, Mark Moir

Proceedings of the 21th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2006

Composite Abortable Locks.

Virendra J. Marathe, Mark Moir, Nir Shavit

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Formal Verification of a Lazy Concurrent List-Based Set Algorithm.

Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

Hybrid transactional memory.

Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum

Proceedings of the 12th International Conference on Architectural Support for Programming Languages and Operating Systems, 2006

2005

Nonblocking memory management support for dynamic-sized data structures.

Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir

ACM Trans. Comput. Syst., 2005

Concurrency and synchronization in Java programs.

Mark Moir, Nir Shavit, Jan Vitek

Sci. Comput. Program., 2005

Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.

Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit

Proceedings of the Distributed Computing, 19th International Conference, 2005

Obstruction-Free Algorithms Can Be Practically Wait-Free.

Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit

Proceedings of the Distributed Computing, 19th International Conference, 2005

Using elimination to implement scalable and lock-free FIFO queues.

Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004

Concurrent Data Structures.

Mark Moir, Nir Shavit

Proceedings of the Handbook of Data Structures and Applications., 2004

DCAS is not a silver bullet for nonblocking algorithm design.

Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Bringing practical lock-free synchronization to 64-bit applications.

Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Formal Verification of a Practical Lock-Free Queue Algorithm.

Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

2003

Space and Time Adaptive Non-blocking Algorithms.

Maurice Herlihy, Victor Luchangco, Mark Moir

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

On the Uncontended Complexity of Consensus.

Victor Luchangco, Mark Moir, Nir Shavit

Proceedings of the Distributed Computing, 17th International Conference, 2003

Nonblocking k-compare-single-swap.

Victor Luchangco, Mark Moir, Nir Shavit

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Software transactional memory for dynamic-sized data structures.

Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Obstruction-Free Synchronization: Double-Ended Queues as an Example.

Maurice Herlihy, Victor Luchangco, Mark Moir

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002

DCAS-Based Concurrent Deques.

Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.

Theory Comput. Syst., 2002

Lock-free reference counting.

David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.

Distributed Comput., 2002

The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.

Maurice Herlihy, Victor Luchangco, Mark Moir

Proceedings of the Distributed Computing, 16th International Conference, 2002

Dynamic-sized lock-free data structures.

Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

A Simple Local-Spin Group Mutual Exclusion Algorithm.

Patrick Keane, Mark Moir

IEEE Trans. Parallel Distributed Syst., 2001

A simple proof technique for priority-scheduled systems.

James H. Anderson, Mark Moir, Srikanth Ramamurthy

Inf. Process. Lett., 2001

Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions.

Mark Moir

Distributed Comput., 2001

Correction: practical implementations of non-blocking synchronization primitives.

Mark Moir

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

A General Resource Allocation Synchronization Problem.

Patrick Keane, Mark Moir

Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

2000

Static-Priority Periodic Scheduling on Multiprocessors.

Srikanth Rarnarnurthy, Mark Moir

Proceedings of the 21st IEEE Real-Time Systems Symposium (RTSS 2000), 2000

netnice: nice is not only for CPUs-a simple subnetwork bandwidth management scheme.

Takashi Okumura, Mark Moir, Daniel Mossé

Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000

1999

Universal Constructions for Large Objects.

James H. Anderson, Mark Moir

IEEE Trans. Parallel Distributed Syst., 1999

Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources.

Mark Moir, Srikanth Ramamurthy

Proceedings of the 20th IEEE Real-Time Systems Symposium, 1999

Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling.

James H. Anderson, Mark Moir

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

Fast, Long-Lived Renaming Improved and Simplified.

Mark Moir

Sci. Comput. Program., 1998

Synchronization Mechanisms for SCRAMNet+ Systems.

Stephen Menke, Mark Moir, Srikanth Ramamurthy

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations.

James H. Anderson, Mark Moir

Distributed Comput., 1997

Transparent Support for Wait-Free Transactions.

Mark Moir

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Practical Implementations of Non-Blocking Synchronization Primitives.

Mark Moir

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996

Fast, Long-Lived Renaming Improved and Simplified.

Mark Moir, Juan A. Garay

Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Lock-Free Transactions for Real-Time Systems.

James H. Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay

Proceedings of the Online-Proceedings of the First International Workshop on Real-Time Databases: Issues and Applications, 1996

Real-Time Object Sharing with Minimal System Support (Extended Abstract).

Srikanth Ramamurthy, Mark Moir, James H. Anderson

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Fast, Long-Lived Renaming Improved and Simplified (Abstract).

Mark Moir, Juan A. Garay

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Wait-Free Algorithms for Fast, Long-Lived Renaming.

Mark Moir, James H. Anderson

Sci. Comput. Program., 1995

Long-Lived Renaming Made Fast.

Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Universal Constructions for Multi-Object Operations.

James H. Anderson, Mark Moir

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994

Fast, Long-Lived Renaming (Extended Abstract).

Mark Moir, James H. Anderson

Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract).

James H. Anderson, Mark Moir

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract).

James H. Anderson, Mark Moir

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993