Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Bibliography [1] Rodney M. Burstall. Some techniques for proving correctness of pro-

Summary: Bibliography
[1] Rodney M. Burstall. Some techniques for proving correctness of pro-
grams which alter data structures. In Bernard Meltzer and Donald
Michie, editors, Machine Intelligence 7, pages 2350. Edinburgh Uni-
versity Press, Edinburgh, Scotland, 1972.
[2] Tomasz Kowaltowski. Correctness of Programs Manipulating Data
Structures. Ph. D. dissertation, University of California, Berkeley, Cal-
ifornia, December 1973. Also Electronics Research Laboratory Memo-
randum ERL-M404, September 1973.
[3] Stephen A. Cook and Derek C. Oppen. An assertion language for data
structures. In Conference Record of the Second ACM Symposium on
Principles of Programming Languages, pages 160166, New York, 1975.
[4] Derek C. Oppen and Stephen A. Cook. Proving assertions about pro-
grams that manipulate data structures. In Proceedings of Seventh An-
nual ACM Symposium on Theory of Computing, pages 107116, New
York, 1975. ACM.
[5] Joseph M. Morris. A general axiom of assignment; assignment and
linked data structures; a proof of the Schorr-Waite algorithm. In Man-
fried Broy and Gunther Schmidt, editors, Theoretical Foundations of


Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University


Collections: Mathematics