1 option
Mathematics of Program Construction : 4th International Conference, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings / edited by Johan Jeuring.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1422.
- Lecture Notes in Computer Science, 0302-9743 ; 1422
- Language:
- English
- Subjects (All):
- Computers.
- Software engineering.
- Computer programming.
- Algorithms.
- Computer logic.
- Theory of Computation.
- Software Engineering/Programming and Operating Systems.
- Programming Techniques.
- Software Engineering.
- Algorithm Analysis and Problem Complexity.
- Logics and Meanings of Programs.
- Local Subjects:
- Theory of Computation.
- Software Engineering/Programming and Operating Systems.
- Programming Techniques.
- Software Engineering.
- Algorithm Analysis and Problem Complexity.
- Logics and Meanings of Programs.
- Physical Description:
- 1 online resource (X, 388 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69345-1
- 9783540693451
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.