Garbage-collected languages such as Java and C# are becoming more and more widely
used in both high-end software and real-time embedded applications. The correctness of the …

Garbage collectors are notoriously hard to verify, due to their low-level interaction with the
underlying system and the general difficulty in reasoning about reachability in graphs …

Verification of Parallel Programs with the Owicki-Gries and Rely-Guarantee Methods in
Isabelle/HOL Page 1 Verification of Parallel Programs with the Owicki-Gries and Rely-Guarantee …

We describe an implementation and a proof of correctness of binary decision diagrams
(BDDs), completely formalized in Coq. This allows us to run BDD-based algorithms inside …

This book is about formal veri? cation, that is, the use of mathematical reasoning to ensure
correct execution of computing systems. With the increasing use of c-puting systems in …

Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous
such algorithms have been proposed, implemented, and deployed-and yet the relationship …

螺旋槽干气密封在高压, 高速旋转时内部会产生一定量的热, 导致密封环发生热弹变形,
从而使运行不稳定和泄漏量增大. 首先在速度滑移边界条件下, 求出气膜压力和气膜速度; …

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 …

Concurrent garbage collectors are notoriously hard to design, implement, and verify. We
present a framework for the automatic exploration of a space of concurrent mark-and-sweep …

Distributed reference counting is a general purpose technique, which may be used, eg, to
detect termination of distributed programs or to implement distributed garbage collection. We …