Verifying Concurrent Memory Reclamation Algorithms with Grace
- 1 January 2013
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Verifying Concurrent Memory Reclamation Algorithms with GraceLecture Notes in Computer Science, 2013
- Reasoning about Optimistic Concurrency Using a Program Logic for HistoryLecture Notes in Computer Science, 2010
- A calculus of atomic actionsACM SIGPLAN Notices, 2009
- Modular verification of a non-blocking stackPublished by Association for Computing Machinery (ACM) ,2007
- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee ReasoningLecture Notes in Computer Science, 2007
- Local Action and Abstract Separation LogicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- Checking Interference with Fractional PermissionsLecture Notes in Computer Science, 2003
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data StructuresLecture Notes in Computer Science, 2002
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990