Theoretical Foundations of Programming Methodology (eBook, PDF)

Lecture Notes of an International Summer School, directed by F. L. Bauer, E. W. Dijkstra and C. A. R. Hoare
Redaktion: Broy, M.; Schmidt, Günther

• Format: PDF

Produktbeschreibung

Papers presented at the Marktoberdorf Summer School on Theoretical Foundations of Programming Methodology, organized under the auspices of the Technical University Münich and sponsored by the NATO Scientific Affairs Division, Germany, 1981

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Netherlands
• Seitenzahl: 672
• Erscheinungstermin: 6. Dezember 2012
• Englisch
• ISBN-13: 9789400978935
• Artikelnr.: 44173851

Inhaltsangabe

I: Program Development and Verification.
Smoothsort, an Alternative for Sorting in Situ.
Lambek and Moser Revisited.
A General Axiom of Assignment.
Assignment and Linked Data Structures.
A Proof of the Schorr
Waite Algorithm.
Verification of Sequential Programs: Temporal Axiomatization.
Specification and Derivation of Programs.
Repaying Our Debts.
II: Denotational Semantics.
Lectures on a Mathematical Theory of Computation.
Semantic Models.
III: Abstract Data Types.
Algebras, Theories and Freeness: An Introduction for Computer Scientists.
An Analysis of Semantic Models for Algebraic Specifications.
IV: Infinite Structures.
Fundamental Properties of Infinite Trees.
Behaviors of Processes and Synchronized Systems of Processes.
V: Concurrent Programs.
A Tutorial on the Split Binary Semaphore.
A Fixed Point Approach to Applicative Multiprogramming.
Discrete Event Simulation Based on Communicating Sequential Processes.
Structure of an Operating System.

---

I: Program Development and Verification.- Smoothsort, an Alternative for Sorting in Situ.- Lambek and Moser Revisited.- A General Axiom of Assignment.- Assignment and Linked Data Structures.- A Proof of the Schorr-Waite Algorithm.- Verification of Sequential Programs: Temporal Axiomatization.- Specification and Derivation of Programs.- Repaying Our Debts.- II: Denotational Semantics.- Lectures on a Mathematical Theory of Computation.- Semantic Models.- III: Abstract Data Types.- Algebras, Theories and Freeness: An Introduction for Computer Scientists.- An Analysis of Semantic Models for Algebraic Specifications.- IV: Infinite Structures.- Fundamental Properties of Infinite Trees.- Behaviors of Processes and Synchronized Systems of Processes.- V: Concurrent Programs.- A Tutorial on the Split Binary Semaphore.- A Fixed Point Approach to Applicative Multiprogramming.- Discrete Event Simulation Based on Communicating Sequential Processes.- Structure of an Operating System.