Mark Moir - RankMe

87 papers A* 22A 11B 17C 1Journal 21Unranked 12

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	An approach to translating Haskell programs to Agda and reasoning about them. CoRR Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva
2022	J	`jnl`	Proof Engineering with Predicate Transformer Semantics. CoRR Christa Jenkins, Mark Moir, Harold Carr
2022	—	`conf`	Towards Formal Verification of HotStuff-Based Byzantine Fault Tolerant Consensus in Agda. NFM Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva
2022	J	`jnl`	Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version. CoRR Harold Carr, Christopher Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva
2021	J	`jnl`	Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version. CoRR Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.
2021	B	`conf`	Formal verification of authenticated, append-only skip lists in Agda. CPP Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.
2018	—	`conf`	Authenticated modular maps in Haskell. TyDe@ICFP Victor Cacciari Miraldo, Harold Carr, Alex Kogan, Mark Moir, Maurice Herlihy
2016	A*	`conf`	Blockchains and the Logic of Accountability: Keynote Address. LICS Maurice Herlihy, Mark Moir
2016	J	`jnl`	Enhancing Accountability and Trust in Distributed Ledgers. CoRR Maurice Herlihy, Mark Moir
2016	—	`ch.`	Wait-Free Synchronization. Encyclopedia of Algorithms Mark Moir
2014	B	`conf`	Adaptive integration of hardware and software lock elision techniques. SPAA Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir
2014	J	`jnl`	Hardware extensions to make lazy subscription safe. CoRR Dave Dice, Timothy L. Harris, Alex Kogan, Yossi Lev, Mark Moir
2013	—	`conf`	Constrained Data-Driven Parallelism. HotPar Tim Harris, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Mark Moir
2013	B	`conf`	Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores. OPODIS Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir
2013	B	`conf`	Scalable statistics counters. PPoPP Dave Dice, Yossi Lev, Mark Moir
2013	B	`conf`	Scalable statistics counters. SPAA Dave Dice, Yossi Lev, Mark Moir
2013	J	`jnl`	Towards formally specifying and verifying transactional memory. Formal Aspects Comput. Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir
2013	B	`conf`	Using hardware transactional memory to correct and simplify and readers-writer lock algorithm. PPoPP Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir
2012	B	`conf`	A Framework for Formally Verifying Software Transactional Memory Algorithms. CONCUR Mohsen Lesani, Victor Luchangco, Mark Moir
2011	A*	`conf`	Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory. ASPLOS Luke Dalessandro, François Carouge, Sean White, Yossi Lev, Mark Moir, Michael L. Scott, Michael F. Spear
2011	—	`conf`	Lightweight parallel accumulators using C++ templates. IWMSE@ICSE Yossi Lev, Mark Moir
2011	A*	`conf`	On the power of hardware transactional memory to simplify memory management. PODC Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir
2010	B	`conf`	Simplifying concurrent algorithms by exploiting hardware transactional memory. SPAA David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski
2010	—	`conf`	What Kinds of Applications Can Benefit from Transactional Memory? ISCA Workshops Mark Moir, Daniel Nussbaum
2009	A*	`conf`	Early experience with a commercial hardware transactional memory implementation. ASPLOS David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum
2009	B	`conf`	NZTM: nonblocking zero-indirection transactional memory. SPAA Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang
2009	J	`jnl`	Nonblocking Theory Comput. Syst. Victor Luchangco, Mark Moir, Nir Shavit
2009	A	`conf`	Nonblocking Algorithms and Backward Simulation. DISC Simon Doherty, Mark Moir
2008	B	`conf`	The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster). SPAA Mark Moir, Kevin Moore, Daniel Nussbaum
2008	B	`conf`	Toward high performance nonblocking software transactional memory. PPoPP Virendra J. Marathe, Mark Moir
2008	—	`ch.`	Wait-Free Synchronization. Encyclopedia of Algorithms Mark Moir
2007	J	`jnl`	A Lazy Concurrent List-Based Set Algorithm. Parallel Process. Lett. Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit
2007	B	`conf`	Efficient nonblocking software transactional memory. PPoPP Virendra J. Marathe, Mark Moir
2007	A*	`conf`	SNZI: scalable NonZero indicators. PODC Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir
2006	J	`jnl`	A dynamic-sized nonblocking work stealing deque. Distributed Comput. Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit
2006	A	`conf`	A flexible framework for implementing software transactional memory. OOPSLA Maurice Herlihy, Victor Luchangco, Mark Moir
2006	A	`conf`	Composite Abortable Locks. IPDPS Virendra J. Marathe, Mark Moir, Nir Shavit
2006	A*	`conf`	Formal Verification of a Lazy Concurrent List-Based Set Algorithm. CAV Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir
2006	A*	`conf`	Hybrid transactional memory. ASPLOS Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum
2005	B	`conf`	A Lazy Concurrent List-Based Set Algorithm. OPODIS Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit
2005	J	`jnl`	Concurrency and synchronization in Java programs. Sci. Comput. Program. Mark Moir, Nir Shavit, Jan Vitek
2005	J	`jnl`	Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
2005	A	`conf`	Obstruction-Free Algorithms Can Be Practically Wait-Free. DISC Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
2005	A	`conf`	Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. DISC Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
2005	B	`conf`	Using elimination to implement scalable and lock-free FIFO queues. SPAA Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
2004	A*	`conf`	Bringing practical lock-free synchronization to 64-bit applications. PODC Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir
2004	—	`ch.`	Concurrent Data Structures. Handbook of Data Structures and Applications Mark Moir, Nir Shavit
2004	B	`conf`	DCAS is not a silver bullet for nonblocking algorithm design. SPAA Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
2004	C	`conf`	Formal Verification of a Practical Lock-Free Queue Algorithm. FORTE Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir
2003	B	`conf`	Nonblocking k-compare-single-swap. SPAA Victor Luchangco, Mark Moir, Nir Shavit
2003	A	`conf`	Obstruction-Free Synchronization: Double-Ended Queues as an Example. ICDCS Maurice Herlihy, Victor Luchangco, Mark Moir
2003	A	`conf`	On the Uncontended Complexity of Consensus. DISC Victor Luchangco, Mark Moir, Nir Shavit
2003	A*	`conf`	Software transactional memory for dynamic-sized data structures. PODC Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III
2003	—	`conf`	Space and Time Adaptive Non-blocking Algorithms. CATS Maurice Herlihy, Victor Luchangco, Mark Moir
2002	J	`jnl`	DCAS-Based Concurrent Deques. Theory Comput. Syst. Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.
2002	A*	`conf`	Dynamic-sized lock-free data structures. PODC Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir
2002	J	`jnl`	Lock-free reference counting. Distributed Comput. David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.
2002	A	`conf`	The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. DISC Maurice Herlihy, Victor Luchangco, Mark Moir
2001	A	`conf`	A General Resource Allocation Synchronization Problem. ICDCS Patrick Keane, Mark Moir
2001	J	`jnl`	A Simple Local-Spin Group Mutual Exclusion Algorithm. IEEE Trans. Parallel Distributed Syst. Patrick Keane, Mark Moir
2001	J	`jnl`	A simple proof technique for priority-scheduled systems. Inf. Process. Lett. James H. Anderson, Mark Moir, Srikanth Ramamurthy
2001	A*	`conf`	Correction: practical implementations of non-blocking synchronization primitives. PODC Mark Moir
2001	J	`jnl`	Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. Distributed Comput. Mark Moir
2001	A*	`conf`	Lock-free reference counting. PODC David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.
2000	A*	`conf`	Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions. PODC Mark Moir
2000	A	`conf`	Static-Priority Periodic Scheduling on Multiprocessors. RTSS Srikanth Rarnarnurthy, Mark Moir
2000	B	`conf`	netnice: nice is not only for CPUs-a simple subnetwork bandwidth management scheme. ICCCN Takashi Okumura, Mark Moir, Daniel Mossé
1999	A*	`conf`	A Simple Local-Spin Group Mutual Exclusion Algorithm. PODC Patrick Keane, Mark Moir
1999	A	`conf`	Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources. RTSS Mark Moir, Srikanth Ramamurthy
1999	J	`jnl`	Universal Constructions for Large Objects. IEEE Trans. Parallel Distributed Syst. James H. Anderson, Mark Moir
1999	A*	`conf`	Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling. PODC James H. Anderson, Mark Moir
1998	J	`jnl`	Fast, Long-Lived Renaming Improved and Simplified. Sci. Comput. Program. Mark Moir
1998	A*	`conf`	Synchronization Mechanisms for SCRAMNet+ Systems. PODC Stephen Menke, Mark Moir, Srikanth Ramamurthy
1997	A*	`conf`	Practical Implementations of Non-Blocking Synchronization Primitives. PODC Mark Moir
1997	—	`conf`	Transparent Support for Wait-Free Transactions. WDAG Mark Moir
1997	J	`jnl`	Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations. Distributed Comput. James H. Anderson, Mark Moir
1996	A*	`conf`	Fast, Long-Lived Renaming Improved and Simplified (Abstract). PODC Mark Moir, Juan A. Garay
1996	—	`conf`	Fast, Long-Lived Renaming Improved and Simplified. WDAG Mark Moir, Juan A. Garay
1996	—	`conf`	Lock-Free Transactions for Real-Time Systems. RTDB James H. Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay
1996	A*	`conf`	Real-Time Object Sharing with Minimal System Support (Extended Abstract). PODC Srikanth Ramamurthy, Mark Moir, James H. Anderson
1995	A*	`conf`	Long-Lived Renaming Made Fast. PODC Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir
1995	—	`conf`	Universal Constructions for Large Objects. WDAG James H. Anderson, Mark Moir
1995	A*	`conf`	Universal Constructions for Multi-Object Operations. PODC James H. Anderson, Mark Moir
1995	J	`jnl`	Wait-Free Algorithms for Fast, Long-Lived Renaming. Sci. Comput. Program. Mark Moir, James H. Anderson
1994	—	`conf`	Fast, Long-Lived Renaming (Extended Abstract). WDAG Mark Moir, James H. Anderson
1994	A*	`conf`	Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract). PODC James H. Anderson, Mark Moir
1993	—	`conf`	Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract). WDAG James H. Anderson, Mark Moir