|
Conferences in DBLP
- Jean-Raymond Abrial
A Formal Approach To Large Software Construction. [Citation Graph (2, 0)][DBLP] MPC, 1989, pp:1-20 [Conf]
- K. Mani Chandy
Mathematics of Program Construction Applied to Analog Neural Networks. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:21-35 [Conf]
- Eric C. R. Hehner
Termination is Timing. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:36-47 [Conf]
- David May, David Shepherd
Towards Totally Verified Systems. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:48-65 [Conf]
- Lambert G. L. T. Meertens
Constructing a Calculus of Programs. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:66-90 [Conf]
- Jayadev Misra
Specifications of Concurrently Accessed Data. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:91-114 [Conf]
- Ralph-Johan Back, Kaisa Sere
Stepwise Refinement of Action Systems. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:115-138 [Conf]
- Ralph-Johan Back, Joakim von Wright
A Lattice-theoretical Basis for a Specification Language. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:139-156 [Conf]
- A. Bijlsma
Transformational Programming and Forests. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:157-173 [Conf]
- Wei Chen, Jan Tijmen Udding, Tom Verhoeff
Networks of Communicating Processes and Their (De-)Composition. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:174-196 [Conf]
- Wei Chen, Jan Tijmen Udding
Towards a Calculus of Data Refinement. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:197-218 [Conf]
- E. Pascal Gribomont
Stepwise Refinement and Concurrency: A Small Exercise. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:219-238 [Conf]
- John Hannan, Dale Miller
Deriving Mixed Evaluation from Standard Evaluation for a Simple Functional Language. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:239-255 [Conf]
- Martin C. Henson
Realizability Models for Program Construction. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:256-272 [Conf]
- Wim H. Hesselink
Initialisation with a Final Value, an Exercise in Program Transformation. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:273-280 [Conf]
- Anne Kaldewaij, Martin Rem
A Derivation of a Systolic Rank Order Filter with Constant Response Time. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:281-296 [Conf]
- Anne Kaldewaij, Berry Schoenmakers
Searching by Elimination. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:297-306 [Conf]
- Christian Lengauer, Jeff W. Sanders
The Projection of Systolic Programs. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:307-324 [Conf]
- L. D. J. C. Loyens, Rob H. Bisseling
The Formal Construction of a Parallel Triangular System Solver. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:325-334 [Conf]
- Grant Malcolm
Homomorphisms and Promotability. [Citation Graph (1, 0)][DBLP] MPC, 1989, pp:335-347 [Conf]
- Bernhard Möller
Applicative Assertions. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:348-362 [Conf]
- Carroll Morgan
Types and Invariants in the Refinement Calculus. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:363-378 [Conf]
- Douglas R. Smith, Michael R. Lowry
Algorithm Theories and Design Tactics. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:379-398 [Conf]
- J. Michael Spivey
A Categorial Approch to the Theory of Lists. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:399-408 [Conf]
- Jaap van der Woude
Rabbitcount : = Rabbitcount - 1. [Citation Graph (0, 0)][DBLP] MPC, 1989, pp:409-420 [Conf]
|