Mathematics of Program Construction : Third International Conference, MPC '95 Kloster Irsee, Germany, July 17-21, 1995 Proceedings /

Mathematics of Program Construction : Third International Conference, MPC '95 Kloster Irsee, Germany, July 17-21, 1995 Proceedings /

Saved in:
Bibliographic Details
Meeting name:MPC '95 (1995 : Kloster Irsee)
Imprint:Berlin, Heidelberg : Springer-Verlag, 1995.
Description:1 online resource : v.: digital.
Language:English
Series:Lecture Notes in Computer Science, 0302-9743 ; 947
Lecture notes in computer science ; 947.
Subject:
Computer science.
Software engineering.
Computer software.
Logic design.
Combinatorial analysis.
Combinatorial analysis.
Computer science.
Computer software.
Logic design.
Software engineering.
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11077979
Hidden Bibliographic Details
Other authors / contributors:Möller, Bernhard, 1953-
ISBN:9783540494454
3540494456
9783540601173
Notes:Includes bibliographical references.
Summary: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.
Other form:Print version: MPC '95 (1995 : Kloster Irsee). Mathematics of Program Construction. Berlin, Heidelberg : Springer-Verlag, 1995 3540601171
Table of Contents:
  • Towards automatic parallelization of logic programs / K.R. Apt
  • Functional algorithm design / R.S. Bird
  • Mathematics of software engineering / M. Broy
  • Program construction in intuitionistic type theory / T. Coquand
  • Computer-aided computing / N. Shankar
  • Derivation of parallel algorithms from functional specifications to CSP processes / A.E. Abdallah
  • Architecture independent massive parallelization of divide-and-conquer algorithms / K. Achatz, W. Schulte
  • Exploring summation and product operators in the refinement calculus / R.-J.R. Back, M. Butler
  • An action system specification of the Caltech asynchronous microprocessor / R.-J.R. Back, A.J. Martin, K. Sere
  • Formal derivation of CSP programs from temporal specifications / R. Berghammer, B. von Karger
  • A compositional proof system for asynchronously communicating processes / F.S. de Boer, M. van Hulst
  • A graphical calculus / S. Curtis, G. Lowe
  • A simple, efficient, and flexible implementation of flexible arrays / V.J. Dielissen, A. Kaldewaij
  • Induction and recursion on datatypes / H. Doornbos, R. Backhouse
  • Program construction by parts / M. Frappier, A. Mili, J. Desharnais
  • An initial-algebra approach to directed acrylic graphs / J. Gibbons
  • Algebraic proof assistants in HOL / R. Groenboom [and others]
  • Angelic termination in Dijkstra's calculus / W.H. Hesselink
  • Extracting programs with exceptions in an impredicative type system / J.-F. Monin
  • Synthesising proofs from programs in the calculus of inductive constructions / C. Parent
  • A general scheme for breadth-first graph traversal / M. Russling
  • SPECWARE : formal support for composing software / Y.V. Srinivas, R. Jüllig
  • A refinement relation supporting the transition from unbounded to bounded communication buffers / K. Stølen
  • ImpUNITY : UNITY with procedures and local variables / R.T. Udink, J.N. Kok.

Similar Items