03466nam a22005295i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002800118050001700146072001500163072001600178072002300194072002300217082001700240245018100257264006100438300003200499336002600531337002600557338003600583347002400619490005800643505108800701520055701789650002202346650002602368650002602394650001502420650001602435650002002451650002202471650002702493650006002520650002802580650002602608650004702634650003702681700002902718710003402747773002002781776003602801830005802837856004102895978-3-540-69345-1DE-He21320170515111459.0cr nn 008mamaa121227s1998 gw | s |||| 0|eng d a97835406934517 a10.1007/BFb00542792doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aMathematics of Program Constructionh[electronic resource] :b4th International Conference, MPC'98 Marstrand, Sweden, June 15–17, 1998 Proceedings /cedited by Johan Jeuring. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1998. aX, 388 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v14220 aOn the aesthetics of diagrams -- Generalising monads -- A proof rule for control loops -- Relation-algebraic derivation of spanning tree algorithms -- An application of program derivation techniques to 18th-century mathematics -- Nested datatypes -- An approach to object-orientation in action systems -- Layered graph traversals and Hamiltonian path problems — An algebraic approach -- A unifying framework for correct program construction -- Computation calculus bridging a formalization gap -- An elementary derivation of the alternating bit protocol -- A set-theoretic model for real-time specification and reasoning -- Polytypic downwards accumulations -- Formal derivation of a loadable asynchronous counter -- A semantic approach to secure information flow -- Slack elasticity in concurrent computing -- Beyond fun: Order and membership in polytypic imperative programming -- Convergence of program transformers in the metric space of trees -- Realizability of monotone coinductive definitions and its application to program synthesis -- Calculating a round-robin scheduler. aThis book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near Goteborg, Sweden, in June 1998. The 17 revised full papers presented were selected from 57 submissions; also included are three invited contributions. The volume is devoted to the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; varoius approaches to formal methods for systems design and analysis are covered. 0aComputer science. 0aSoftware engineering. 0aComputer programming. 0aComputers. 0aAlgorithms. 0aComputer logic.14aComputer Science.24aTheory of Computation.24aSoftware Engineering/Programming and Operating Systems.24aProgramming Techniques.24aSoftware Engineering.24aAlgorithm Analysis and Problem Complexity.24aLogics and Meanings of Programs.1 aJeuring, Johan.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540645917 0aLecture Notes in Computer Science,x0302-9743 ;v142240uhttp://dx.doi.org/10.1007/BFb0054279