Mathematics of Program Construction: Third International Conference, MPC ’95 Kloster Irsee, Germany, July 17–21, 1995 Proceedings

Krzysztof R. Apt (auth.), Bernhard Möller (eds.)3540601171, 9783540601173

This volume constitutes the proceedings of the Third International Conference on the Mathematics of Program Construction, held at Kloster Irsee, Germany in July 1995.
Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 submissions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed are program transformation, program analysis, program verification, as well as convincing case studies.

---

Table of contents :
Towards automatic parallelization of logic programs….Pages 1-1
Functional Algorithm Design….Pages 2-17
Mathematics of software engineering….Pages 18-48
Program construction in intuitionistic Type Theory….Pages 49-49
Computer-aided computing….Pages 50-66
Derivation of parallel algorithms from functional specifications to CSP processes….Pages 67-96
Architecture independent massive parallelization of divide-and-conquer algorithms….Pages 97-127
Exploring summation and product operators in the refinement calculus….Pages 128-158
An action system specification of the caltech asynchronous microprocessor….Pages 159-179
Formal derivation of CSP programs from temporal specifications….Pages 180-196
A compositional proof system for asynchronously communicating processes….Pages 197-213
A graphical calculus….Pages 214-231
A simple, efficient, and flexible implementation of flexible arrays….Pages 232-241
Induction and recursion on datatypes….Pages 242-256
Program construction by parts….Pages 257-281
An initial-algebra approach to directed acyclic graphs….Pages 282-303
Algebraic proof assistants in HOL….Pages 304-321
Angelic termination in Dijkstra’s calculus….Pages 322-334
Extracting programs with exceptions in an impredicative type system….Pages 335-350
Synthesizing proofs from programs in the Calculus of Inductive Constructions….Pages 351-379
A general scheme for breadth-first graph traversal….Pages 380-398
Specware: Formal support for composing software….Pages 399-422
A refinement relation supporting the transition from unbounded to bounded communication buffers….Pages 423-451
ImpUNITY: UNITY with procedures and local variables….Pages 452-472