NATO ASI DPD 1996: Marktoberdorf, Germany

Manfred Broy (Ed.): Proceedings of the NATO Advanced Study Institute on Deductive Program Design, Marktoberdorf, Germany. 1996, ISBN 3-540-60947-4

Fred B. Schneider: On traditions in Marktoberdorf. 1-4
Edsger W. Dijkstra: Fibonacci and the greatest common divisor. 7-10
Edsger W. Dijkstra: The balance and the coins. 11-13
Edsger W. Dijkstra: Bulterman's theorem on shortest trees. 15-16
Edsger W. Dijkstra: A prime is in at most 1 way the sum of 2 squares. 17-20
Edsger W. Dijkstra: A bagatelle on Euclid's algorithm. 21-23
Edsger W. Dijkstra: On two equations that have the same extreme solution. 25-26
Edsger W. Dijkstra: An alternative of the ETAC to EWD1163. 27-28
Edsger W. Dijkstra: The argument about the arithmetic mean and the geometric mean, heuristics included. 29-32
Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan: Interaction categories and the foundations of typed concurrent programming. 35-113
C. A. R. Hoare: Mathematical models for computing science. 115-164
Richard S. Bird, Oege de Moor: The algebra of programming. 167-203
David Gries: Data refinement and the transform. 205-232
Martín Abadi, Stephan Merz: On TLA as a logic. 235-271
Manfred Broy: Specification and refinement of a buffer of length one. 273-304
Edmund M. Clarke, Orna Grumberg, David E. Long: Model checking. 305-349
Fred B. Schneider: Notes on proof outline logic. 351-394
Michael P. Fourman: Proof and design. 397-439
Alain J. Martin: A program transformation approach to asynchronous VLSI design. 441-467

Last update Mon Feb 13 04:37:52 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page