This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Application of a Method for Analysis of Cyclic Prog rams
September 1978 (vol. 4 no. 5)
pp. 371-378
N. Francez, Department of Computer Science, University of Southern California
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.
Index Terms:
verification, Concurrent programs, correctness, cyclic programs, eventual behavior, interface predicates, invariants, specification, temporal predicates
Citation:
N. Francez, "An Application of a Method for Analysis of Cyclic Prog rams," IEEE Transactions on Software Engineering, vol. 4, no. 5, pp. 371-378, Sept. 1978, doi:10.1109/TSE.1978.233857
Usage of this product signifies your acceptance of the Terms of Use.