04838nam 22006975 450 99646604270331620200701172739.03-540-49445-610.1007/3-540-60117-1(CKB)1000000000234306(SSID)ssj0000324706(SSID)ssj0000321548(DE-He213)978-3-540-49445-4(PPN)155182404(EXLCZ)99100000000023430620121227d1995 u| 0engurnn#008mamaatxtccrMathematics of Program Construction[electronic resource] Third International Conference, MPC '95, Kloster Irsee, Germany, July 17 - 21, 1995. Proceedings /edited by Bernhard Möller1st ed. 1995.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1995.1 online resource (IX, 479 p.)Lecture Notes in Computer Science,0302-9743 ;947Bibliographic Level Mode of Issuance: Monograph3-540-60117-1 Towards automatic parallelization of logic programs -- Functional Algorithm Design -- Mathematics of software engineering -- Program construction in intuitionistic Type Theory -- Computer-aided computing -- Derivation of parallel algorithms from functional specifications to CSP processes -- Architecture independent massive parallelization of divide-and-conquer algorithms -- Exploring summation and product operators in the refinement calculus -- An action system specification of the caltech asynchronous microprocessor -- Formal derivation of CSP programs from temporal specifications -- A compositional proof system for asynchronously communicating processes -- A graphical calculus -- A simple, efficient, and flexible implementation of flexible arrays -- Induction and recursion on datatypes -- Program construction by parts -- An initial-algebra approach to directed acyclic graphs -- Algebraic proof assistants in HOL -- Angelic termination in Dijkstra's calculus -- Extracting programs with exceptions in an impredicative type system -- Synthesizing proofs from programs in the Calculus of Inductive Constructions -- A general scheme for breadth-first graph traversal -- Specware: Formal support for composing software -- A refinement relation supporting the transition from unbounded to bounded communication buffers -- ImpUNITY: UNITY with procedures and local variables.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.Lecture Notes in Computer Science,0302-9743 ;947Software engineeringComputersComputer programmingAlgorithmsComputer logicSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XSoftware engineering.Computers.Computer programming.Algorithms.Computer logic.Software Engineering/Programming and Operating Systems.Theory of Computation.Programming Techniques.Software Engineering.Algorithm Analysis and Problem Complexity.Logics and Meanings of Programs.004.2/0151Burkart Olaf982891Möller Bernhardedthttp://id.loc.gov/vocabulary/relators/edtMPC '95BOOK996466042703316Mathematics of Program Construction2860788UNISA