default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st MPC 1989: Groningen, The Netherlands
- Jan L. A. van de Snepscheut:
Mathematics of Program Construction, 375th Anniversary of the Groningen University, International Conference, Groningen, The Netherlands, June 26-30, 1989, Proceedings. Lecture Notes in Computer Science 375, Springer 1989, ISBN 3-540-51305-1
Invited Lectures
- Jean-Raymond Abrial:
A Formal Approach To Large Software Construction. 1-20 - K. Mani Chandy:
Mathematics of Program Construction Applied to Analog Neural Networks. 21-35 - Eric C. R. Hehner:
Termination is Timing. 36-47 - David May, David Shepherd
:
Towards Totally Verified Systems. 48-65 - Lambert G. L. T. Meertens:
Constructing a Calculus of Programs. 66-90 - Jayadev Misra:
Specifications of Concurrently Accessed Data. 91-114
Contributed Lectures
- Ralph-Johan Back, Kaisa Sere:
Stepwise Refinement of Action Systems. 115-138 - Ralph-Johan Back, Joakim von Wright:
A Lattice-theoretical Basis for a Specification Language. 139-156 - A. Bijlsma:
Transformational Programming and Forests. 157-173 - Wei Chen, Jan Tijmen Udding, Tom Verhoeff:
Networks of Communicating Processes and Their (De-)Composition. 174-196 - Wei Chen, Jan Tijmen Udding:
Towards a Calculus of Data Refinement. 197-218 - E. Pascal Gribomont:
Stepwise Refinement and Concurrency: A Small Exercise. 219-238 - John Hannan, Dale Miller:
Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language. 239-255 - Martin C. Henson:
Realizability Models for Program Construction. 256-272 - Wim H. Hesselink:
Initialisation with a Final Value, an Exercise in Program Transformation. 273-280 - Anne Kaldewaij, Martin Rem:
A Derivation of a Systolic Rank Order Filter with Constant Response Time. 281-296 - Anne Kaldewaij, Berry Schoenmakers:
Searching by Elimination. 297-306 - Christian Lengauer, Jeff W. Sanders:
The Projection of Systolic Programs. 307-324 - L. D. J. C. Loyens, Rob H. Bisseling:
The Formal Construction of a Parallel Triangular System Solver. 325-334 - Grant Malcolm:
Homomorphisms and Promotability. 335-347 - Bernhard Möller:
Applicative Assertions. 348-362 - Carroll Morgan:
Types and Invariants in the Refinement Calculus. 363-378 - Douglas R. Smith, Michael R. Lowry:
Algorithm Theories and Design Tactics. 379-398 - J. Michael Spivey:
A Categorial Approch to the Theory of Lists. 399-408 - Jaap van der Woude:
Rabbitcount : = Rabbitcount - 1. 409-420
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
