C. Pixley. An incremental garbage collection algorithm for multimutator systems. Distributed Computing, 3(1):41 -- 50, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a window during which the collector cannot tell which objects are referenced by the mutator. These algorithms synchronize largely through read and write operations, although some kind of mutual exclusion appears to be necessary for the free list and other auxiliary data structures. Pixley [19] gives a generalization of Ben Ari s algorithm in which a single collector process cleans up after multiple concurrent mutators. This algorithm, as Pixley notes, behaves incorrectly in the presence of certain race conditions, which Pixley explicitly assumes do not occur. Our algorithm introduces ....

C. Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3(1):41--49, December 1988.

....possibly have been addressed by writing a recursive function to count the sharing nodes, then verifying some properties of it as in the proof of the garbage collection algorithm. We haven t tried this yet. justifications of Ben Ari s algorithm were also given by Van de Snepscheut [18] and Pixley [15]. However, these proofs were informal pencil and paper proofs. Later, this modified algorithm was mechanically proved by Russinoff [16] using the Boyer Moore theorem prover. A formulation of the same algorithm was also proved by Havelund and Shankar in PVS [10] and [11] The proofs of both [10] ....

C. Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3(1):41--50, 1988.

....to the algorithm. This claim turned out to be wrong, and was discovered by the authors just before the proof reached publication. Ben Ari later proposed the same modification to his algorithm and argued for its correctness without discovering its flaw. Counterexamples were later given by Pixley [Pix88] and van de Snepscheut [dS87] Furthermore, although Ben Ari s algorithm (which is the one we verify in PVS) is correct, his proof of the safety property was found to be flawed. This flaw was essentially reproduced by Pixley[Pix88] where it again survived the review process, and was only ....

....discovering its flaw. Counterexamples were later given by Pixley [Pix88] and van de Snepscheut [dS87] Furthermore, although Ben Ari s algorithm (which is the one we verify in PVS) is correct, his proof of the safety property was found to be flawed. This flaw was essentially reproduced by Pixley[Pix88] where it again survived the review process, and was only discovered ten years later by Russinoff during the course of his mechanical verification [Rus94] Ben Ari also gave a flawed proof of a liveness property (every garbage node will eventually be collected) that was later observed and ....

C. Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3, 1988.

....revealed a (sometimes deep) bug. Their solution involves three colours. Ben Ari s later solution is based on the same algorithm, but it only uses two colours, and the proof is therefore simpler. Alternative proofs of Ben Ari s algorithm were then later published by Van de Snepscheut [6] and Pixley [17]. All of these proofs were informal pencil and paper proofs. Ben Ari defends this as follows: So as not to obscure the main ideas, the exposition is limited to the critical facets of the proof. A mechanically verifiable proof would need all sorts of trivial invariants . and elementary ....

....(colouring before pointer redirection) This claim was, however, wrong, but was discovered by the authors before the proof reached publication. Ben Ari then later again proposed this modification and argued for its correctness without discovering its flaw. Counter examples were later given in [17] and [6] Furthermore, although Ben Ari s algorithm (which is the one we verify in PVS) is correct, his proof of the safety property was flawed. This flaw was essentially repeated in [17] where it yet again survived the review process, and was only discovered 10 years after when Russinoff detected ....

[Article contains additional citation context not shown here]

C. Pixley. An Incremental Garbage Collection Algorithm for Multi-mutator Systems. Distributed Computing, 3, 1988.

....revealed a (sometimes deep) bug. Their solution involves three colours. Ben Ari s later solution is based on the same algorithm, but it only uses two colours, and the proof is therefore simpler. Alternative proofs of Ben Ari s algorithm were then later published by Van de Snepscheut [4] and Pixley [10]. All of these proofs were informal pencil and paper proofs. Ben Ari defends this as follows: So as not to obscure the main ideas, the exposition is limited to the critical facets of the proof. A mechanically verifiable proof would need all sorts of trivial invariants : and elementary ....

....(colouring before pointer redirection) This claim was, however, wrong, but was discovered by the authors before the proof reached publication. Ben Ari then later again proposed this modification and argued for its correctness without discovering its flaw. Counter examples were later given in [10] and [4] Furthermore, although Ben Ari s algorithm (which is the one we verify in PVS) is correct, his proof of the safety property was flawed. This flaw was essentially repeated in [10] where it yet again survived the review process, and was only discovered 10 years after when Russinoff detected ....

[Article contains additional citation context not shown here]

C. Pixley. An incremental garbage collection algorithm for multimutator systems. Distributed Computing, 3, 1988.

....locality. To keep the cost of callcc and throw relatively cheap, we could use techniques described by Hieb, et al. 24] Concurrent GC: As mentioned in Section 5.5, concurrent garbage collection is an important goal. There have been many proposals for concurrent and or parallel garbage collection [8, 10, 23, 29, 36]. Parallel GC on a shared bus machine might be unattractive since GC is a memory intensive operation. We expect that a bus would rapidly become saturated as more processors helped with the collection. Collecting garbage while the computation proceeds seems more appealing, but most of the ....

C. Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3(1):41--49, Dec. 1988.

....revealed a (sometimes deep) bug. Their solution involves three colours. Ben Ari s later solution is based on the same algorithm, but it only uses two colours, and the proof is therefore simpler. Alternative proofs of Ben Ari s algorithm were then later published by Van de Snepscheut [5] and Pixley [11]. All of these proofs were informal pencil and paper proofs. Ben Ari defends this as follows: So as not to obscure the main ideas, the exposition is limited to the critical facets of the proof. A mechanically verifiable proof would need all sorts of trivial invariants . and elementary ....

....(colouring before pointer redirection) This claim was, however, wrong, but was discovered by the authors before the proof reached publication. Ben Ari then later again proposed this modification and argued for its correctness without discovering its flaw. Counter examples were later given in [11] and [5] Furthermore, although Ben Ari s algorithm (which is the one we verify in PVS) is correct, his proof of the safety property was flawed. This flaw was essentially repeated in [11] where it yet again survived the review process, and was only discovered 10 years after when Russinoff detected ....

[Article contains additional citation context not shown here]

C. Pixley. An incremental garbage collection algorithm for multimutator systems. Distributed Computing, 3, 1988.

....the algorithm was described to illustrate a technique to prove the correctness of concurrent programs, the inefficiencies were not considered further. Due to its concurrency, the algorithm was named on the fly collection. The algorithm and its proof has later been refined, e.g. see [Ben Ari 84, Pixley 88] Almost simultaneous to [Dijkstra 78] Kung and Song developed another concurrent markand sweep collector with lower overhead [Kung 77] They does not put the free list in the root set, and use a dequeue to hold information about gray objects that must be traversed . 31 A A white object ....

Carl Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3(1):41--50, 1988.

No context found.

C. Pixley. An incremental garbage collection algorithm for multimutator systems. Distributed Computing, 3(1):41 -- 50, 1988.

No context found.

C. Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3(1):41--50, 1988.

No context found.

C. Pixley. An incremental garbage collection algorithm for multi-mutator systems. Distributed Computing, 3(1):41--50, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC