Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Mathematics of Program Construction

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

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Johan Jeuring
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1422)

Included in the following conference series:

Conference proceedings info: MPC 1998.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (20 papers)

  1. Front Matter

    Download chapter PDF

  2. On the aesthetics of diagrams

    • David Harel
    Pages 1-5

  3. Generalising monads

    • John Hughes
    Pages 6-6

  4. A proof rule for control loops

    • Burghard von Karger
    Pages 7-22

  5. Relation-algebraic derivation of spanning tree algorithms

    • Rudolf Berghammer, Burghard von Karger, Andreas Wolf
    Pages 23-43

  6. An application of program derivation techniques to 18th-century mathematics

    • A. Bijlsma
    Pages 44-51

  7. Nested datatypes

    • Richard Bird, Lambert Meertens
    Pages 52-67

  8. An approach to object-orientation in action systems

    • Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere
    Pages 68-95

  9. Layered graph traversals and Hamiltonian path problems — An algebraic approach

    • Thomas Brunn, Bernhard Möller, Martin Russling
    Pages 96-121

  10. A unifying framework for correct program construction

    • Henning Dierks, Michael Schenke
    Pages 122-150

  11. Computation calculus bridging a formalization gap

    • Rutger M. Dijkstra
    Pages 151-174

  12. An elementary derivation of the alternating bit protocol

    • W. H. J. Feijen, A. J. M. van Gasteren, Birgit Schieder
    Pages 175-187

  13. A set-theoretic model for real-time specification and reasoning

    • C. J. Fidge, I. J. Hayes, A. P. Martin, A. K. Wabenhorst
    Pages 188-206

  14. Polytypic downwards accumulations

    • Jeremy Gibbons
    Pages 207-233

  15. Formal derivation of a loadable asynchronous counter

    • Mark B. Josephs
    Pages 234-253

  16. A semantic approach to secure information flow

    • K. Rustan, M. Leino, Rajeev Joshi
    Pages 254-271

  17. Slack elasticity in concurrent computing

    • Rajit Manohar, Alain J. Martin
    Pages 272-285

  18. Beyond fun: Order and membership in polytypic imperative programming

    • David A. Naumann
    Pages 286-314

  19. Convergence of program transformers in the metric space of trees

    • Morten Heine B. Sørensen
    Pages 315-337

  20. Realizability of monotone coinductive definitions and its application to program synthesis

    • Makoto Tatsuta
    Pages 338-364
Back to top

Other volumes

  1. Mathematics of Program Construction

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation