Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
"Algorithms for on-the-fly garbage collection" revisited
Information Processing Letters
Distributed systems analysis with CCS
Distributed systems analysis with CCS
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Mechanical Verification of a Garbage Collector
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
On-the-fly garbage collection for several mutators
Distributed Computing
Completeness of the Owicki-Gries System for Parameterized Parallel Programs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Hi-index | 0.00 |
Using a formalization of the Owicki-Gries method in the theorem prover Isabelle/HOL, we obtain mechanized correctness proofs for two incremental garbage collection algorithms, the second one parametric in the number of mutators. The Owicki-Gries method allows to reason directly on the program code; it also splits the proof into many small goals, most of which are very simple, and can thus be proved automatically. Thanks to Isabelle's facilities in dealing with syntax, the formalization can be done in a natural way.