Table of Contents

Applicative communicating processes in first order logic.- A machine-level semantics for nondeterministic, parallel programs.- A formalized proof system for total correctness of while programs.- Automatic program transformation viewed as theorem proving.- An enlarged definition and complete axiomatization of observational congruence of finite processes.- Perluette : A compilers producing system using abstract data types.- A weakest precondition semantics for communicating processes.- From abstract model to efficient compilation of patterns.- Computer-based synthesis of logic programs.- On some syntactic equivalences of program schemas and related transformations.- Procedures and concurrency: A study in proof.- Another characterization of weakest preconditions.- Powerdomains and nondeterministic recursive definitions.- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code.- The simple semantics for Coppo-Dezani-Sallé types.- Proving the correctness of implementations of shared data abstractions.- Specification of communicating processes and process implementation correctness.- A system for reasoning within and about algebraic specifications.- Tuning algebraic specifications by type merging.- Communicating agents for applicative concurrent programming.- On effective computations of non-deterministic schemes.- Specification and verification of concurrent systems in CESAR.- Proof of separability A verification technique for a class of security kernels.- A method for program synthesis.- The use of transformations to implement an algorithm.