Is sometimes ever better than always?

1. Manna, Z. and R. Waldinger. Is "sometime" sometimes better than "always"? CACM 21 (February 1978), 159–171.

   Article  Google Scholar 

2. Hoare, C.A.R. An axiomatic basis for computer programming. CACM 12 (October 1969), 576–580, 583.

   Article  Google Scholar 

3. Dijkstra, E.W. A Discipline of Programming, Prentice Hall, 1976.

   Google Scholar 

4. Knuth, D.E. The Art of Computer Programming, Vol. I, Addison-Wesley, Reading, Mass. 1968.

   MATH  Google Scholar 

5. Burstall, R.M. Program proving as hand simulation with a little induction. Proc. IFIP Congress 1974, Amsterdam. (308–312).

   Google Scholar 

6. Topor, R.W. A simple proof of the Schorr-Waite garbage collection algorithm, to appear in Acta Informatica?

   Google Scholar 

7. Gries, D. The Schorr-Waite graph marking algorithm. Computer Science, Cornell University, 1977. Submitted to Acta Informatica.

   Google Scholar 

8. Gries, D. An exercise in proving parallel programs correct. CACM 20 (December 1977), 921–930.

   Article  MathSciNet  Google Scholar 

9. Soundararajan, N. Axiomatic proofs of total correctness of programs. NCSDCT, Tata Inst. of Fundamental Research, Bombay, India, 1978.

   MATH  Google Scholar 

Download references