Herlihy; Maurice

Patent Applications and Registrations

Patent applications and USPTO patent grants for Herlihy; Maurice.The latest application filed is for "adding concurrency to smart contracts".

Company Profile

1.22.18

Herlihy; Maurice - Brookline MA
Herlihy; Maurice - Cambridge N/A GB

*profile and listings may contain filings by different individuals or companies with the same name. Review application materials to confirm ownership/assignment.

Patent Activity

Patent	Date
Adding Concurrency To Smart Contracts App 20190087793 - Dickerson; Thomas ; et al.	2019-03-21
Obstruction-free data structures and mechanisms with separable and/or substitutable contention management mechanisms Grant 9,323,586 - Moir , et al. April 26, 2	2016-04-26
Obstruction-free Data Structures And Mechanisms With Separable And/or Substitutable Contention Management Mechanisms App 20150269008 - Moir; Mark S. ; et al.	2015-09-24
Obstruction-free data structures and mechanisms with separable and/or substitutable contention management mechanisms Grant 9,052,944 - Moir , et al. June 9, 2	2015-06-09
System and method for performing memory management using hardware transactions Grant 9,043,363 - Dragojevic , et al. May 26, 2	2015-05-26
Value recycling facility for multithreaded computations Grant 8,412,894 - Moir , et al. April 2, 2	2013-04-02
System and Method for Performing Memory Management Using Hardware Transactions App 20120310987 - Dragojevic; Aleksandar ; et al.	2012-12-06
Obstruction-free synchronization for shared data structures Grant 8,244,990 - Moir , et al. August 14, 2	2012-08-14
Software transactional memory for dynamically sizable shared data structures Grant 8,176,264 - Moir , et al. May 8, 2	2012-05-08
Using transactional memory with early release to implement non-blocking dynamic-sized data structure Grant 8,074,030 - Moir , et al. December 6, 2	2011-12-06
Space-and time-adaptive nonblocking algorithms Grant 8,019,785 - Moir , et al. September 13, 2	2011-09-13
Value Recycling Facility for Multithreaded Computations App 20110167231 - Moir; Mark S. ; et al.	2011-07-07
Software Transactional Memory for Dynamically Sizable Shared Data Structures App 20110138134 - Moir; Mark S. ; et al.	2011-06-09
Value recycling facility for multithreaded computations Grant 7,908,441 - Moir , et al. March 15, 2	2011-03-15
Software transactional memory for dynamically sizable shared data structures Grant 7,895,401 - Moir , et al. February 22, 2	2011-02-22
Method and system for implementing a concurrent set of objects Grant 7,788,242 - Shavit , et al. August 31, 2	2010-08-31
Technique to allow a first transaction to wait on condition that affects its working set Grant 7,703,098 - Moir , et al. April 20, 2	2010-04-20
Obstruction-free mechanism for atomic update of multiple non-contiguous locations in shared memory Grant 7,685,583 - Moir , et al. March 23, 2	2010-03-23
Space-and Time- Adaptive Nonblocking Algorithms App 20080229139 - Moir; Mark S. ; et al.	2008-09-18
Space- and time-adaptive nonblocking algorithms Grant 7,395,274 - Moir , et al. July 1, 2	2008-07-01
Software Transactional Memory for Dynamically Sizable Shared Data Structures App 20080098181 - Moir; Mark S. ; et al.	2008-04-24
Method and system for implementing a concurrent set of objects App 20080059470 - Shavit; Nir N. ; et al.	2008-03-06
Software transactional memory for dynamically sizable shared data structures Grant 7,328,316 - Moir , et al. February 5, 2	2008-02-05
Single-word lock-free reference counting Grant 7,299,242 - Moir , et al. November 20, 2	2007-11-20
Lock-free implementation of dynamic-sized shared data structure Grant 7,254,597 - Moir , et al. August 7, 2	2007-08-07
Non-blocking memory management mechanism for supporting dynamic-sized data structures Grant 7,194,495 - Moir , et al. March 20, 2	2007-03-20
Obstruction-free data structures and mechanisms with separable and/or substitutable contention management mechanisms App 20060173885 - Moir; Mark S. ; et al.	2006-08-03
Space- and time-adaptive nonblocking algorithms App 20040153687 - Moir, Mark S. ; et al.	2004-08-05
Obstruction-free mechanism for atomic update of multiple non-contiguous locations in shared memory App 20040034673 - Moir, Mark S. ; et al.	2004-02-19
Obstruction-free synchronization for shared data structures App 20040015510 - Moir, Mark S. ; et al.	2004-01-22
Software transactional memory for dynamically sizable shared data structures App 20040015642 - Moir, Mark S. ; et al.	2004-01-22
Value recycling facility for multithreaded computations App 20030182462 - Moir, Mark S. ; et al.	2003-09-25
Lock-free implementation of dynamic-sized shared data structure App 20030182465 - Moir, Mark S. ; et al.	2003-09-25
Non-blocking memory management mechanism for supporting dynamic-sized data structures App 20030174572 - Moir, Mark S. ; et al.	2003-09-18
Single-word lock-free reference counting App 20030140085 - Moir, Mark S. ; et al.	2003-07-24
Methods and systems for securing computer software App 20020111997 - Herlihy, Maurice	2002-08-15
System for achieving atomic non-sequential multi-word operations in shared memory Grant 5,428,761 - Herlihy , et al. June 27, 1	1995-06-27

uspto.report is an independent third-party trademark research tool that is not affiliated, endorsed, or sponsored by the United States Patent and Trademark Office (USPTO) or any other governmental organization. The information provided by uspto.report is based on publicly available data at the time of writing and is intended for informational purposes only.

While we strive to provide accurate and up-to-date information, we do not guarantee the accuracy, completeness, reliability, or suitability of the information displayed on this site. The use of this site is at your own risk. Any reliance you place on such information is therefore strictly at your own risk.

All official trademark data, including owner information, should be verified by visiting the official USPTO website at www.uspto.gov. This site is not intended to replace professional legal advice and should not be used as a substitute for consulting with a legal professional who is knowledgeable about trademark law.