default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Moir
Person information
- affiliation: University of Pittsburgh, Pennsylvania, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c63]Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva:
Towards Formal Verification of HotStuff-Based Byzantine Fault Tolerant Consensus in Agda. NFM 2022: 616-635- [i6]Harold Carr, Christopher Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva:
Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version. CoRR abs/2203.14711 (2022) - [i5]Harold Carr, Christa Jenkins, Mark Moir, Victor Cacciari Miraldo, Lisandra Silva:
An approach to translating Haskell programs to Agda and reasoning about them. CoRR abs/2205.08718 (2022) - [i4]Christa Jenkins, Mark Moir, Harold Carr:
Proof Engineering with Predicate Transformer Semantics. CoRR abs/2208.08070 (2022) - 2021
- [c62]Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.:
Formal verification of authenticated, append-only skip lists in Agda. CPP 2021: 122-136 - [i3]Victor Cacciari Miraldo, Harold Carr, Mark Moir, Lisandra Silva, Guy L. Steele Jr.:
Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version. CoRR abs/2103.04519 (2021)
2010 – 2019
- 2018
- [c61]Victor Cacciari Miraldo, Harold Carr, Alex Kogan, Mark Moir, Maurice Herlihy:
Authenticated modular maps in Haskell. TyDe@ICFP 2018: 1-13 - 2016
- [c60]Maurice Herlihy, Mark Moir:
Blockchains and the Logic of Accountability: Keynote Address. LICS 2016: 27-30 - [r3]Mark Moir:
Wait-Free Synchronization. Encyclopedia of Algorithms 2016: 2345-2351 - [i2]Maurice Herlihy, Mark Moir:
Enhancing Accountability and Trust in Distributed Ledgers. CoRR abs/1606.07490 (2016) - 2014
- [c59]Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir:
Adaptive integration of hardware and software lock elision techniques. SPAA 2014: 188-197 - [i1]Dave Dice, Timothy L. Harris, Alex Kogan, Yossi Lev, Mark Moir:
Hardware extensions to make lazy subscription safe. CoRR abs/1407.6968 (2014) - 2013
- [j15]Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir:
Towards formally specifying and verifying transactional memory. Formal Aspects Comput. 25(5): 769-799 (2013) - [c58]Tim Harris, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Mark Moir:
Constrained Data-Driven Parallelism. HotPar 2013 - [c57]Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir:
Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores. OPODIS 2013: 83-97 - [c56]Dave Dice, Yossi Lev, Yujie Liu, Victor Luchangco, Mark Moir:
Using hardware transactional memory to correct and simplify and readers-writer lock algorithm. PPoPP 2013: 261-270 - [c55]Dave Dice, Yossi Lev, Mark Moir:
Scalable statistics counters. PPoPP 2013: 307-308 - [c54]Dave Dice, Yossi Lev, Mark Moir:
Scalable statistics counters. SPAA 2013: 43-52 - 2012
- [c53]Mohsen Lesani, Victor Luchangco, Mark Moir:
A Framework for Formally Verifying Software Transactional Memory Algorithms. CONCUR 2012: 516-530 - 2011
- [c52]Luke Dalessandro, François Carouge, Sean White, Yossi Lev, Mark Moir, Michael L. Scott
, Michael F. Spear:
Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory. ASPLOS 2011: 39-52 - [c51]Yossi Lev, Mark Moir:
Lightweight parallel accumulators using C++ templates. IWMSE@ICSE 2011: 33-40 - [c50]Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir:
On the power of hardware transactional memory to simplify memory management. PODC 2011: 99-108 - 2010
- [c49]Mark Moir, Daniel Nussbaum:
What Kinds of Applications Can Benefit from Transactional Memory? ISCA Workshops 2010: 150-160 - [c48]David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski:
Simplifying concurrent algorithms by exploiting hardware transactional memory. SPAA 2010: 325-334
2000 – 2009
- 2009
- [j14]Victor Luchangco, Mark Moir, Nir Shavit:
Nonblocking k -Compare-Single-Swap. Theory Comput. Syst. 44(1): 39-66 (2009) - [c47]David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum:
Early experience with a commercial hardware transactional memory implementation. ASPLOS 2009: 157-168 - [c46]Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang:
NZTM: nonblocking zero-indirection transactional memory. SPAA 2009: 204-213 - [c45]Simon Doherty, Mark Moir:
Nonblocking Algorithms and Backward Simulation. DISC 2009: 274-288 - 2008
- [c44]Virendra J. Marathe, Mark Moir:
Toward high performance nonblocking software transactional memory. PPoPP 2008: 227-236 - [c43]Mark Moir, Kevin Moore, Daniel Nussbaum:
The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster). SPAA 2008: 362 - [r2]Mark Moir:
Wait-Free Synchronization. Encyclopedia of Algorithms 2008 - 2007
- [j13]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. Parallel Process. Lett. 17(4): 411-424 (2007) - [c42]Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir:
SNZI: scalable NonZero indicators. PODC 2007: 13-22 - [c41]Virendra J. Marathe, Mark Moir:
Efficient nonblocking software transactional memory. PPoPP 2007: 136-137 - 2006
- [j12]Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit:
A dynamic-sized nonblocking work stealing deque. Distributed Comput. 18(3): 189-207 (2006) - [c40]Peter Damron, Alexandra Fedorova, Yossi Lev, Victor Luchangco, Mark Moir, Daniel Nussbaum:
Hybrid transactional memory. ASPLOS 2006: 336-346 - [c39]Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir:
Formal Verification of a Lazy Concurrent List-Based Set Algorithm. CAV 2006: 475-488 - [c38]Virendra J. Marathe, Mark Moir, Nir Shavit:
Composite Abortable Locks. IPDPS 2006: 1-10 - [c37]Maurice Herlihy, Victor Luchangco, Mark Moir:
A flexible framework for implementing software transactional memory. OOPSLA 2006: 253-262 - 2005
- [j11]Mark Moir, Nir Shavit, Jan Vitek:
Concurrency and synchronization in Java programs. Sci. Comput. Program. 58(3): 291-292 (2005) - [j10]Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir:
Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23(2): 146-196 (2005) - [c36]Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Nir Shavit:
A Lazy Concurrent List-Based Set Algorithm. OPODIS 2005: 3-16 - [c35]Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit:
Using elimination to implement scalable and lock-free FIFO queues. SPAA 2005: 253-262 - [c34]Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
Obstruction-Free Algorithms Can Be Practically Wait-Free. DISC 2005: 78-92 - [c33]Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. DISC 2005: 493-494 - 2004
- [c32]Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir:
Formal Verification of a Practical Lock-Free Queue Algorithm. FORTE 2004: 97-114 - [c31]Simon Doherty, Maurice Herlihy, Victor Luchangco, Mark Moir:
Bringing practical lock-free synchronization to 64-bit applications. PODC 2004: 31-39 - [c30]Simon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
DCAS is not a silver bullet for nonblocking algorithm design. SPAA 2004: 216-224 - [r1]Mark Moir, Nir Shavit:
Concurrent Data Structures. Handbook of Data Structures and Applications 2004 - 2003
- [c29]Maurice Herlihy, Victor Luchangco, Mark Moir:
Obstruction-Free Synchronization: Double-Ended Queues as an Example. ICDCS 2003: 522-529 - [c28]Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III:
Software transactional memory for dynamic-sized data structures. PODC 2003: 92-101 - [c27]Victor Luchangco, Mark Moir, Nir Shavit:
Nonblocking k-compare-single-swap. SPAA 2003: 314-323 - [c26]Victor Luchangco, Mark Moir, Nir Shavit:
On the Uncontended Complexity of Consensus. DISC 2003: 45-59 - [c25]Maurice Herlihy, Victor Luchangco, Mark Moir:
Space and Time Adaptive Non-blocking Algorithms. CATS 2003: 260-280 - 2002
- [j9]David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.:
Lock-free reference counting. Distributed Comput. 15(4): 255-271 (2002) - [j8]Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
DCAS-Based Concurrent Deques. Theory Comput. Syst. 35(3): 349-386 (2002) - [c24]Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir:
Dynamic-sized lock-free data structures. PODC 2002: 131 - [c23]Maurice Herlihy, Victor Luchangco, Mark Moir:
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. DISC 2002: 339-353 - 2001
- [j7]Mark Moir:
Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. Distributed Comput. 14(4): 193-204 (2001) - [j6]James H. Anderson, Mark Moir, Srikanth Ramamurthy:
A simple proof technique for priority-scheduled systems. Inf. Process. Lett. 77(2-4): 63-70 (2001) - [j5]Patrick Keane, Mark Moir:
A Simple Local-Spin Group Mutual Exclusion Algorithm. IEEE Trans. Parallel Distributed Syst. 12(7): 673-685 (2001) - [c22]Patrick Keane, Mark Moir:
A General Resource Allocation Synchronization Problem. ICDCS 2001: 557-564 - [c21]David Detlefs, Paul Alan Martin, Mark Moir, Guy L. Steele Jr.:
Lock-free reference counting. PODC 2001: 190-199 - [c20]Mark Moir:
Correction: practical implementations of non-blocking synchronization primitives. PODC 2001: 323 - 2000
- [c19]Takashi Okumura, Mark Moir, Daniel Mossé:
netnice: nice is not only for CPUs-a simple subnetwork bandwidth management scheme. ICCCN 2000: 388-395 - [c18]Mark Moir:
Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions. PODC 2000: 61-70 - [c17]Srikanth Rarnarnurthy, Mark Moir:
Static-Priority Periodic Scheduling on Multiprocessors. RTSS 2000: 69-78
1990 – 1999
- 1999
- [j4]James H. Anderson, Mark Moir:
Universal Constructions for Large Objects. IEEE Trans. Parallel Distributed Syst. 10(12): 1317-1332 (1999) - [c16]Patrick Keane, Mark Moir:
A Simple Local-Spin Group Mutual Exclusion Algorithm. PODC 1999: 23-32 - [c15]James H. Anderson, Mark Moir:
Wait-Free Synchronization in Multiprogrammed Systems: Integrating Priority-Based and Quantum-Based Scheduling. PODC 1999: 123-132 - [c14]Mark Moir, Srikanth Ramamurthy:
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources. RTSS 1999: 294-303 - 1998
- [j3]Mark Moir:
Fast, Long-Lived Renaming Improved and Simplified. Sci. Comput. Program. 30(3): 287-308 (1998) - [c13]Stephen Menke, Mark Moir, Srikanth Ramamurthy:
Synchronization Mechanisms for SCRAMNet+ Systems. PODC 1998: 71-80 - 1997
- [j2]James H. Anderson, Mark Moir:
Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations. Distributed Comput. 11(1): 1-20 (1997) - [c12]Mark Moir:
Practical Implementations of Non-Blocking Synchronization Primitives. PODC 1997: 219-228 - [c11]Mark Moir:
Transparent Support for Wait-Free Transactions. WDAG 1997: 305-319 - 1996
- [c10]Mark Moir, Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified (Abstract). PODC 1996: 152 - [c9]Srikanth Ramamurthy, Mark Moir, James H. Anderson:
Real-Time Object Sharing with Minimal System Support (Extended Abstract). PODC 1996: 233-242 - [c8]James H. Anderson, Srikanth Ramamurthy, Mark Moir, Kevin Jeffay:
Lock-Free Transactions for Real-Time Systems. RTDB 1996: 103-110 - [c7]Mark Moir, Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified. WDAG 1996: 287-303 - 1995
- [j1]Mark Moir, James H. Anderson:
Wait-Free Algorithms for Fast, Long-Lived Renaming. Sci. Comput. Program. 25(1): 1-39 (1995) - [c6]James H. Anderson, Mark Moir:
Universal Constructions for Multi-Object Operations. PODC 1995: 184-193 - [c5]Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir:
Long-Lived Renaming Made Fast. PODC 1995: 194-203 - [c4]James H. Anderson, Mark Moir:
Universal Constructions for Large Objects. WDAG 1995: 168-182 - 1994
- [c3]James H. Anderson, Mark Moir:
Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract). PODC 1994: 141-150 - [c2]Mark Moir, James H. Anderson:
Fast, Long-Lived Renaming (Extended Abstract). WDAG 1994: 141-155 - 1993
- [c1]James H. Anderson, Mark Moir:
Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract). WDAG 1993: 39-53
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 2025-01-21 00:21 CET 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:
