David Harel (auth.), Johan Jeuring (eds.)3540645918, 9783540645917
Table of contents :
On the aesthetics of diagrams….Pages 1-5
Generalising monads….Pages 6-6
A proof rule for control loops….Pages 7-22
Relation-algebraic derivation of spanning tree algorithms….Pages 23-43
An application of program derivation techniques to 18th-century mathematics….Pages 44-51
Nested datatypes….Pages 52-67
An approach to object-orientation in action systems….Pages 68-95
Layered graph traversals and Hamiltonian path problems — An algebraic approach….Pages 96-121
A unifying framework for correct program construction….Pages 122-150
Computation calculus bridging a formalization gap….Pages 151-174
An elementary derivation of the alternating bit protocol….Pages 175-187
A set-theoretic model for real-time specification and reasoning….Pages 188-206
Polytypic downwards accumulations….Pages 207-233
Formal derivation of a loadable asynchronous counter….Pages 234-253
A semantic approach to secure information flow….Pages 254-271
Slack elasticity in concurrent computing….Pages 272-285
Beyond fun: Order and membership in polytypic imperative programming….Pages 286-314
Convergence of program transformers in the metric space of trees….Pages 315-337
Realizability of monotone coinductive definitions and its application to program synthesis….Pages 338-364
Calculating a round-robin scheduler….Pages 365-382
Reviews
There are no reviews yet.