Verifying Concurrent Memory Reclamation Algorithms with Grace

DOI10.1007/978-3-642-37036-6_15zbMath1381.68053OpenAlexW20815996MaRDI QIDQ5326289

Alexey Gotsman, Noam Rinetzky, Hongseok Yang

Publication date: 5 August 2013

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37036-6_15

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

The ERA Theorem for Safe Memory Reclamation ⋮ On the relation between concurrent separation logic and concurrent Kleene algebra

This page was built for publication: Verifying Concurrent Memory Reclamation Algorithms with Grace