Relaxing safely: verified on-the-fly garbage collection for x86-TSO

P Gammie, AL Hosking, K Engelhardt - ACM SIGPLAN Notices, 2015 - dl.acm.org
ACM SIGPLAN Notices, 2015dl.acm.org
We report on a machine-checked verification of safety for a state-of-the-art, on-the-fly,
concurrent, mark-sweep garbage collector that is designed for multi-core architectures with
weak memory consistency. The proof explicitly incorporates the relaxed memory semantics
of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of
safety for such a garbage collector. We couch the proof in a framework that system
implementers will find appealing, with the fundamental components of the system specified …
We report on a machine-checked verification of safety for a state-of-the-art, on-the-fly, concurrent, mark-sweep garbage collector that is designed for multi-core architectures with weak memory consistency. The proof explicitly incorporates the relaxed memory semantics of x86 multiprocessors. To our knowledge, this is the first fully machine-checked proof of safety for such a garbage collector. We couch the proof in a framework that system implementers will find appealing, with the fundamental components of the system specified in a simple and intuitive programming language. The abstract model is detailed enough for its correspondence with an assembly language implementation to be straightforward.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果