Theoretical Foundations of Programming Methodology: Lecture Notes of an International Summer School, directed by F. L. Bauer, E. W. Dijkstra and C. A. R. Hoare

Description

Front Matter....Pages i-xiii Front Matter....Pages 1-1 Smoothsort, an Alternative for Sorting in Situ....Pages 3-17 Lambek and Moser Revisited....Pages 19-23 A General Axiom of Assignment....Pages 25-34 Assignment and Linked Data Structures....Pages 35-41 A Proof of the Schorr-Waite Algorithm....Pages 43-51 Verification of Sequential Programs: Temporal Axiomatization....Pages 53-102 Specification and Derivation of Programs....Pages 103-133 Repaying Our Debts....Pages 135-141 Front Matter....Pages 143-143 Lectures on a Mathematical Theory of Computation....Pages 145-292 Semantic Models....Pages 293-325 Front Matter....Pages 327-327 Algebras, Theories and Freeness: An Introduction for Computer Scientists....Pages 329-349 An Analysis of Semantic Models for Algebraic Specifications....Pages 351-413 Front Matter....Pages 415-415 Fundamental Properties of Infinite Trees....Pages 417-471 Behaviors of Processes and Synchronized Systems of Processes....Pages 473-551 Front Matter....Pages 553-553 A Tutorial on the Split Binary Semaphore....Pages 555-564 A Fixed Point Approach to Applicative Multiprogramming....Pages 565-623 Discrete Event Simulation Based on Communicating Sequential Processes....Pages 625-642 Structure of an Operating System....Pages 643-658