Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-06-22
Computer Science
Distributed, Parallel, and Cluster Computing
38 pages, 21 figures. The short version of this paper appeared in the Proceedings of MPC 2010
Scientific paper
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.
Pavlovic Dusko
Pepper Peter
Smith Douglas R.
No associations
LandOfFree
Formal Derivation of Concurrent Garbage Collectors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Formal Derivation of Concurrent Garbage Collectors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Derivation of Concurrent Garbage Collectors will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-108641