Abstract is missing.
- Applicative communicating processes in first order logicMarco Bellia, Enrico Dameri, Pierpaolo Degano, Giorgio Levi, Maurizio Martelli. 1-14
- A machine level semantics for nondeterministic, parallel programsDavid B. Benson. 15-25
- A formalized proof system for total correctness of while programsJan A. Bergstra, Jan Willem Klop. 26-36
- Automatic program transformation viewed as theorem provingErnesto Costa. 37-46
- An enlarged definition and complete axiomatization of observational congruence of finite processesPhilippe Darondeau. 47-62
- Perluette: A compilers producing system using abstract data typesPh. Deschamp. 63-77
- From abstract model to efficient compilation of patternsP. Emanuelson. 91-104
- Computer-based synthesis of logic programsAgneta Eriksson. 105-115
- On some syntactic equivalence of program schemas and related transformationsMarie-Paule Flé, Gérard Roucairol. 116-131
- Procedures and concurrency: A study in proofRob Gerth, Willem P. de Roever, Marly Roncken. 132-163
- Another characterization of weakest preconditionsPedro Guerreiro. 164-177
- Powerdomains and nondeterministic recursive definitionsMatthew Hennessy. 178-193
- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line codePeter G. Hibbard, Thomas L. Rodeheffer. 194-211
- The simple semantics for Coppe-Dezani-Sallé typesJ. Roger Hindley. 212-226
- Proving the correctness of implementations of shared data abstractionsLászló Kozma. 227-241
- A system for reasoning within and about algebraic specificationsJacek Leszczylowski, Martin Wirsing. 257-282
- Tuning algebraic specifications by type mergingAlfred Laut, Helmuth Partsch. 283-304
- Communicating agents for applicative concurrent programmingAlberto Pettorossi, Andrzej Skowron. 305-322
- On effective computations of nondeterministic schemesAxel Poigné. 323-336
- Specification and verification of concurrent systems in CESARJean-Pierre Queille, Joseph Sifakis. 337-351
- Proof of separability: A verification technique for a class of a security kernelsJohn M. Rushby. 352-367
- A method for program synthesisMiklós Szöts, Sándor Csizmazia. 368-380
- The use of transformations to implement an algorithmJudy A. Townley. 381-408