Title :
An Application of a Method for Analysis of Cyclic Prog rams
Author_Institution :
Department of Computer Science, University of Southern California
Abstract :
A parallel program, Dijkstra\´s "on-the-fly" garbage collector, is proved correct using analysis along the lines suggested by Francez and Pnueli for cyclic programs. The method is briefly reviewed, and the proof is compared to another proof by D. Gries, based on a method by S. Owickd. The differences between the two approaches are discussed.
Keywords :
Concurrent programs; correctness; cyclic programs; eventual behavior; interface predicates; invariants; specification; temporal predicates; verification; Computer science; Counting circuits; Mathematics; Concurrent programs; correctness; cyclic programs; eventual behavior; interface predicates; invariants; specification; temporal predicates; verification;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1978.233857
