Mathematics of Program Construction
Springer Berlin (Verlag)
978-3-540-64591-7 (ISBN)
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.
Erscheint lt. Verlag | 27.5.1998 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | X, 388 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 233 mm |
Gewicht | 522 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Schlagworte | Algebraic Specification • algorithm • Algorithm analysis and problem complexity • algorithms • Design • Formal Method • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • Hardware • HC/Informatik, EDV/Informatik • HC/Informatik, EDV/Programmiersprachen • Mathematisches Programmieren • Program Construction • Program Semantics • Program Transformation |
ISBN-10 | 3-540-64591-8 / 3540645918 |
ISBN-13 | 978-3-540-64591-7 / 9783540645917 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich