Abstract is missing.
- A Formal Approach To Large Software ConstructionJean-Raymond Abrial. 1-20
- Mathematics of Program Construction Applied to Analog Neural NetworksK. Mani Chandy. 21-35
- Termination is TimingEric C. R. Hehner. 36-47
- Towards Totally Verified SystemsDavid May, David Shepherd. 48-65
- Constructing a Calculus of ProgramsLambert G. L. T. Meertens. 66-90
- Specifications of Concurrently Accessed DataJayadev Misra. 91-114
- Stepwise Refinement of Action SystemsRalph-Johan Back, Kaisa Sere. 115-138
- A Lattice-theoretical Basis for a Specification LanguageRalph-Johan Back, Joakim von Wright. 139-156
- Transformational Programming and ForestsA. Bijlsma. 157-173
- Networks of Communicating Processes and Their (De-)CompositionWei Chen, Jan Tijmen Udding, Tom Verhoeff. 174-196
- Towards a Calculus of Data RefinementWei Chen, Jan Tijmen Udding. 197-218
- Stepwise Refinement and Concurrency: A Small ExerciseE. Pascal Gribomont. 219-238
- Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional LanguageJohn Hannan, Dale Miller. 239-255
- Realizability Models for Program ConstructionMartin C. Henson. 256-272
- Initialisation with a Final Value, an Exercise in Program TransformationWim H. Hesselink. 273-280
- A Derivation of a Systolic Rank Order Filter with Constant Response TimeAnne Kaldewaij, Martin Rem. 281-296
- Searching by EliminationAnne Kaldewaij, Berry Schoenmakers. 297-306
- The Projection of Systolic ProgramsChristian Lengauer, Jeff W. Sanders. 307-324
- The Formal Construction of a Parallel Triangular System SolverL. D. J. C. Loyens, Rob H. Bisseling. 325-334
- Homomorphisms and PromotabilityGrant Malcolm. 335-347
- Applicative AssertionsBernhard Möller. 348-362
- Types and Invariants in the Refinement CalculusCarroll Morgan. 363-378
- Algorithm Theories and Design TacticsDouglas R. Smith, Michael R. Lowry. 379-398
- A Categorial Approch to the Theory of ListsJ. Michael Spivey. 399-408
- Rabbitcount : = Rabbitcount - 1Jaap van der Woude. 409-420