Filters








664 Hits in 3.9 sec

Verifying a Concurrent Garbage Collector Using a Rely-Guarantee Methodology [chapter]

Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, Suresh Jagannathan, Jan Vitek
2017 Lecture Notes in Computer Science  
Equipped with this IR, we prove a fully concurrent garbage collector where mutators never have to wait for the collector.  ...  In this paper, we address this problem by proposing a mechanized proof methodology based on the popular Rely-Guarantee (RG) proof technique.  ...  We also thank Vincent Laporte for his work earlier in this project, and his help on implementing parts of the garbage collector presented here.  ... 
doi:10.1007/978-3-319-66107-0_31 fatcat:adfebobhnfgqrafgfejdty3ai4

Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology

Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, Suresh Jagannathan, Jan Vitek
2018 Journal of automated reasoning  
Equipped with this, we prove a fully concurrent garbage collector where mutators never have to wait for the collector.  ...  In this paper, we address this problem by proposing a mechanized proof methodology based on the Rely-Guarantee proof technique.  ...  We also thank Vincent Laporte for his work earlier in this project, and his help on implementing parts of the garbage collector presented here.  ... 
doi:10.1007/s10817-018-9489-x fatcat:56lgvogkubchbkl26o5ta7fsqq

Selected Extended Papers of ITP 2017

Mauricio Ayala-Rincón, César Muñoz
2018 Journal of automated reasoning  
The authors use a complete formalization of the simplex method, together with the proof of its correctness and termination.  ...  In A Formalization of Convex Polyhedra Based on the Simplex Method, Xavier Allamigeon and Ricardo D. Katz present a formalization in Coq of the theory of convex polyhedra using the MathComp library.  ...  verify in Coq a concurrent garbage collector.  ... 
doi:10.1007/s10817-018-09500-0 fatcat:no6wykx3jrdphd2kalkgqnocqi

Verified compilation of linearizable data structures

Yannick Zakowski, David Cachera, Delphine Demange, David Pichardie
2018 Proceedings of the 33rd Annual ACM Symposium on Applied Computing - SAC '18  
The garbage collector is implemented in a compiler intermediate representation featuring abstract concurrent data structures.  ...  At the crux of the proof lies a generic result establishing once and for all a simulation relation, starting from a carefully crafted rely-guarantee specification.  ...  In [31] , we recently presented a Coq formalization of a fully concurrent garbage collector, where mutators never have to wait for the collector.  ... 
doi:10.1145/3167132.3167333 dblp:conf/sac/ZakowskiCDP18 fatcat:7dxm4zpra5dg7ezvhuishqtnuq

High-level real-time programming in Java

David F. Bacon, Martin T. Vechev, Perry Cheng, David Grove, Michael Hind, V. T. Rajan, Eran Yahav, Matthias Hauswirth, Christoph M. Kirsch, Daniel Spoonhower
2005 Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05  
Our goals include construction of a provably correct real-time garbage collector capable of providing worst case latencies of 100 µs, capable of scaling from sensor nodes up to large multiprocessors; specialized  ...  While Metronome garbage collection has made it practical to use Java to implement real-time systems, many challenges remain for the construction of complex real-time systems, some specific to the use of  ...  We also thank Bob Blainey, Tom Henzinger, En-Kuang Lung, and Greg Porpora for many useful discussions.  ... 
doi:10.1145/1086228.1086242 dblp:conf/emsoft/BaconCGHRYHKSV05 fatcat:z37bw5vr7jcwfn5vsycbcafn7y

Lock-Free Parallel Garbage Collection [chapter]

H. Gao, J. F. Groote, W. H. Hesselink
2005 Lecture Notes in Computer Science  
This paper presents a lock-free parallel algorithm for garbage collection in a realistic model using synchronization primitives offered by machine architectures.  ...  Mutators and collectors can simultaneously operate on the data structure.  ...  The garbage collectors reclaim all garbage by adding them to a so called free-list, which keeps track of free memory.  ... 
doi:10.1007/11576235_31 fatcat:ptizfikfkfhrbkajlzx5aj4qcq

Distributed Garbage Collection for Mobile Actor Systems: The Pseudo Root Approach [chapter]

Wei-Jen Wang, Carlos A. Varela
2006 Lecture Notes in Computer Science  
Unreachability of active objects or actors from the root set is not a sufficient condition to collect actor garbage, making passive object GC algorithms unsafe when directly used on actor systems.  ...  Following this idea, we introduce a new direction of actor GC, and demonstrate it by developing a distributed GC framework.  ...  In Section 5 we briefly describe a concurrent, snapshot-based global actor garbage collector to collect distributed cyclic garbage. In Section 6 we show experimental results.  ... 
doi:10.1007/11745693_36 fatcat:a6puyehtgjdf7cyhlbymxnmaay

Lock-free parallel and concurrent garbage collection by mark&sweep

H. Gao, J.F. Groote, W.H. Hesselink
2007 Science of Computer Programming  
It is parallel in that garbage collection itself may employ several concurrent collector threads.  ...  This paper presents a lock-free algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked/store-conditional (LL/SC) or compare-and-swap (CAS) offered  ...  put into the free set by a garbage collector.  ... 
doi:10.1016/j.scico.2006.10.001 fatcat:v43neat4bvcmnfaqekn4yw24zq

Formal Derivation of Concurrent Garbage Collectors [article]

Dusko Pavlovic and Peter Pepper and Douglas R. Smith
2010 arXiv   pre-print
Concurrent garbage collectors are notoriously difficult to implement correctly.  ...  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  ...  Their profound knowledge on the challenges of practical real-world garbage collectors motivated us to push our original high-level and abstract treatment further towards concrete and detailed technical  ... 
arXiv:1006.4342v1 fatcat:q5g26b47xzeurdub4dqsxpwgji

Transactional Sapphire

Tomoharu Ugawa, Carl G. Ritson, Richard E. Jones
2018 ACM Transactions on Programming Languages and Systems  
Constructing a high-performance garbage collector is hard. Constructing a fully concurrent 'on-the-ly', compacting collector is much more so.  ...  We fully evaluate, for the irst time, and using realistic benchmarks, Sapphire's performance and suitability as a low latency collector.  ...  Transactional Sapphire: ACKNOWLEDGMENTS We are grateful to Rick Hudson and the Intel Corporation for providing us with a license to implement the Sapphire algorithm in Jikes RVM, and permitting others  ... 
doi:10.1145/3226225 fatcat:4owlkf4n35f3xlwebvt47ye3le

Lock-free garbage collection for multiprocessors

Maurice P. Herlihy, J. E. B. Moss
1991 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91  
Garbage collection algorithms for shared-memory multiprocessors typically rely on some form of global synchronization to preserve consistency.  ...  This paper presents the first algorithm for lock-free garbage collection in a realistic model.  ...  the collector, concurrently detects and reclaims inaccessible storage.  ... 
doi:10.1145/113379.113400 dblp:conf/spaa/HerlihyM91 fatcat:rs263hgzqbbs3ozsi4hrxyytti

The mapping collector

Michal Wegiel, Chandra Krintz
2008 SIGPLAN notices  
We implement both stop-the-world and concurrent MC in a generational garbage collection framework within the open-source HotSpot Java Virtual Machine.  ...  Through effective MRE-OS coordination, MC maintains the simplicity of a non-moving collector while providing efficient parallel and concurrent compaction.  ...  The Boehm-Demers-Weiser [8] garbage collector is a marksweep (non-compacting) collector for C/C++ which uses page unmapping as an optional and supplementary mechanism to reduce fragmentation.  ... 
doi:10.1145/1353536.1346294 fatcat:kmd6gulx4va4pjtuddugv6nd6a

The mapping collector

Michal Wegiel, Chandra Krintz
2008 ACM SIGOPS Operating Systems Review  
We implement both stop-the-world and concurrent MC in a generational garbage collection framework within the open-source HotSpot Java Virtual Machine.  ...  Through effective MRE-OS coordination, MC maintains the simplicity of a non-moving collector while providing efficient parallel and concurrent compaction.  ...  The Boehm-Demers-Weiser [8] garbage collector is a marksweep (non-compacting) collector for C/C++ which uses page unmapping as an optional and supplementary mechanism to reduce fragmentation.  ... 
doi:10.1145/1353535.1346294 fatcat:yrmruk2jhfchxmudkuqveehcey

The mapping collector

Michal Wegiel, Chandra Krintz
2008 Proceedings of the 13th international conference on Architectural support for programming languages and operating systems - ASPLOS XIII  
We implement both stop-the-world and concurrent MC in a generational garbage collection framework within the open-source HotSpot Java Virtual Machine.  ...  Through effective MRE-OS coordination, MC maintains the simplicity of a non-moving collector while providing efficient parallel and concurrent compaction.  ...  The Boehm-Demers-Weiser [8] garbage collector is a marksweep (non-compacting) collector for C/C++ which uses page unmapping as an optional and supplementary mechanism to reduce fragmentation.  ... 
doi:10.1145/1346281.1346294 dblp:conf/asplos/WegielK08 fatcat:aooimfd3gffrhmtw2d4t4sh6ke

The mapping collector

Michal Wegiel, Chandra Krintz
2008 SIGARCH Computer Architecture News  
We implement both stop-the-world and concurrent MC in a generational garbage collection framework within the open-source HotSpot Java Virtual Machine.  ...  Through effective MRE-OS coordination, MC maintains the simplicity of a non-moving collector while providing efficient parallel and concurrent compaction.  ...  The Boehm-Demers-Weiser [8] garbage collector is a marksweep (non-compacting) collector for C/C++ which uses page unmapping as an optional and supplementary mechanism to reduce fragmentation.  ... 
doi:10.1145/1353534.1346294 fatcat:l3miimwxojgltf52zkqstxkciq
« Previous Showing results 1 — 15 out of 664 results