Formal derivation of concurrent garbage collectors

From MaRDI portal
Publication:3575280

DOI10.1007/978-3-642-13321-3_20zbMATH Open1286.68090arXiv1006.4342OpenAlexW2109524688MaRDI QIDQ3575280FDOQ3575280


Authors: Dusko Pavlovic, Peter Pepper, Douglas R. Smith Edit this on Wikidata


Publication date: 26 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and-prove verification or on the application of domain-specific templates and transformations. We show how to derive the upper reaches of a family of concurrent garbage collectors by refinement from a formal specification, emphasizing the application of domain-independent design theories and transformations. A key contribution is an extension to the classical lattice-theoretic fixpoint theorems to account for the dynamics of concurrent mutation and collection.


Full work available at URL: https://arxiv.org/abs/1006.4342




Recommendations




Cited In (11)





This page was built for publication: Formal derivation of concurrent garbage collectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575280)