Descript 
1 online resource : v.: digital 
Series 
Lecture Notes in Computer Science, 03029743 ; 947


Lecture notes in computer science ; 947. 03029743

Note 
Includes bibliographical references 

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 

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  Computeraided computing / N. Shankar  Derivation of parallel algorithms from functional specifications to CSP processes / A.E. Abdallah  Architecture independent massive parallelization of divideandconquer 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 initialalgebra approach to directed acrylic graphs / J. Gibbons  Algebraic proof assistants in HOL / R. Groenboom ... [et al.]  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 breadthfirst 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 
Link 
Original 3540601171 (DLC) 95032984 (OCoLC)32821138

Subject 
Computer science


Software engineering


Computer software


Logic design


Combinatorial analysis


Computer Science


Programming Techniques


Software Engineering


Algorithm Analysis and Problem Complexity


Logics and Meanings of Programs


Mathematical Logic and Formal Languages


Combinatorial analysis. fast (OCoLC)fst00868961


Computer science. fast (OCoLC)fst00872451


Computer software. fast (OCoLC)fst00872527


Logic design. fast (OCoLC)fst01002045


Software engineering. fast (OCoLC)fst01124185


Electronic books


Conference proceedings. fast (OCoLC)fst01423772

Alt Author 
Möller, Bernhard, 1953

