Mathematics of Program Construction
4th International Conference, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings
Published on 27. May 1998
Book
Paperback/Softback
X, 388 pages
978-3-540-64591-7 (ISBN)
Description
This 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.
More details
Series
Edition
1998 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 388 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
610 gr
ISBN-13
978-3-540-64591-7 (9783540645917)
DOI
10.1007/BFb0054279
Schweitzer Classification
Content
On 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.