Abstract is missing.
- A More Formal Treatment of a Less Simple ExampleEdsger W. Dijkstra. 2-20
- Stationary Behaviour of Some Ternary NetworksEdsger W. Dijkstra. 21-23
- Finding the Correctness Proof of a Concurrent ProgramEdsger W. Dijkstra. 24-34
- On the Interplay between Mathematics and ProgrammingEdsger W. Dijkstra. 35-46
- A Theorem about Odd Powers of Odd IntegersEdsger W. Dijkstra. 47-48
- In Honour of FibonacciEdsger W. Dijkstra. 49-50
- On the Foolishness of Natural Language Programming Edsger W. Dijkstra. 51-53
- Program InversionEdsger W. Dijkstra. 54-57
- The Schorr-Waite Graph Marking AlgorithmDavid Gries. 58-69
- Eliminating the ChaffDavid Gries. 70-74
- Current Ideas in Programming MethodologyDavid Gries. 77-93
- Basic Axiomatic DefinitionsDavid Gries. 94-99
- The Multiple Assignment StatementDavid Gries. 100-112
- Is Sometimes Ever Better Than Always?David Gries. 113-124
- A Case Study in Language Design: EuclidJames J. Horning. 125-132
- Proof Rules for the Programming Language EuclidRalph L. London, John V. Guttag, James J. Horning, Butler W. Lampson, James G. Mitchell, Gerald J. Popek. 133-163
- Verification of Euclid ProgramsJames J. Horning. 164-173
- Specifications and Proofs for Abstract Data Types in Concurrent ProgramsSusan S. Owicki. 174-197
- Specification and Verification of a Network Nail SystemSusan S. Owicki. 198-234
- Program Development by Stepwise Transformations - The Project CIP. Appendix: Programming Languages under Educational and under Professional AspectsFriedrich L. Bauer. 237-272
- Systematics of Transformation RulesFriedrich L. Bauer, Manfred Broy, Helmuth Partsch, Peter Pepper, Hans Wössner. 273-289
- Special Transformation TechniquesHans Wössner, Peter Pepper, Helmuth Partsch, Friedrich L. Bauer. 290-321
- A Study on Transformational SemanticsPeter Pepper. 322-405
- Detailization and Lazy Evaluation, Infinite Objects and Pointer RepresentationFriedrich L. Bauer. 406-420
- Examples for Change of Types and Object StructuresHelmuth Partsch, Manfred Broy. 421-463
- Development of the Schorr-Waite AlgorithmMichael Griffiths. 464-471
- A Derivation Oriented Proof of the Schorr-Waite Marking AlgorithmSusan L. Gerhart. 472-492
- Programming Languages for Reliable Computing SystemsJames J. Horning. 494-530
- Programming Methodology and Language ImplicationsMichael Griffiths. 531-542
- Towards a Wide Spectrum Language to Support Program Specification and Program DevelopmentFriedrich L. Bauer, Manfred Broy, Rupert Gnatz, Wolfgang Hesse, Bernd Krieg-Brückner, Helmuth Partsch, Peter Pepper, Hans Wössner. 543-552
- Semantics of Nondeterministic and Noncontinuous ConstructsManfred Broy, Rupert Gnatz, Martin Wirsing. 553-592
- Notes on Type AbstractionJohn V. Guttag. 593-616
- Some Theoretical Aspects of Program ConstructionClaude Pair. 617-651