Mathematics of Program Construction

4th International Conference, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings

AvJohan Jeuring

Häftad, Engelska, 1998

Del i serien Lecture Notes in Computer Science

552 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1998-05-27
Mått:155 x 233 x 22 mm
Vikt:610 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:388
Upplaga:1998
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540645917

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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.