5. Symposium on Programming 1982: Torino, Italy

Mariangiola Dezani-Ciancaglini, Ugo Montanari (Eds.): International Symposium on Programming, 5th Colloquium, Torino, Italy, April 6-8, 1982, Proceedings. Lecture Notes in Computer Science 137 Springer 1982, ISBN 3-540-11494-7 BibTeX

@proceedings{DBLP:conf/programm/1982,
  editor    = {Mariangiola Dezani-Ciancaglini and
               Ugo Montanari},
  title     = {International Symposium on Programming, 5th Colloquium, Torino,
               Italy, April 6-8, 1982, Proceedings},
  booktitle = {Symposium on Programming},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {137},
  year      = {1982},
  isbn      = {3-540-11494-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Marco Bellia, Enrico Dameri, Pierpaolo Degano, Giorgio Levi, Maurizio Martelli: Applicative communicating processes in first order logic. 1-14 BibTeX
David B. Benson: A machine level semantics for nondeterministic, parallel programs. 15-25 BibTeX
Jan A. Bergstra, Jan Willem Klop: A formalized proof system for total correctness of while programs. 26-36 BibTeX
Ernesto Costa: Automatic program transformation viewed as theorem proving. 37-46 BibTeX
Philippe Darondeau: An enlarged definition and complete axiomatization of observational congruence of finite processes. 47-62 BibTeX
Ph. Deschamp: Perluette: A compilers producing system using abstract data types. 63-77 BibTeX
P. Emanuelson: From abstract model to efficient compilation of patterns. 91-104 BibTeX
Agneta Eriksson: Computer-based synthesis of logic programs. 105-115 BibTeX
Marie-Paule Flé, Gérard Roucairol: On some syntactic equivalence of program schemas and related transformations. 116-131 BibTeX
Rob Gerth, Willem P. de Roever, Marly Roncken: Procedures and concurrency: A study in proof. 132-163 BibTeX
Pedro Guerreiro: Another characterization of weakest preconditions. 164-177 BibTeX
Matthew Hennessy: Powerdomains and nondeterministic recursive definitions. 178-193 BibTeX
Peter G. Hibbard, Thomas L. Rodeheffer: Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code. 194-211 BibTeX
J. Roger Hindley: The simple semantics for Coppe-Dezani-Sallé types. 212-226 BibTeX
László Kozma: Proving the correctness of implementations of shared data abstractions. 227-241 BibTeX
Jacek Leszczylowski, Martin Wirsing: A system for reasoning within and about algebraic specifications. 257-282 BibTeX
Alfred Laut, Helmuth Partsch: Tuning algebraic specifications by type merging. 283-304 BibTeX
Alberto Pettorossi, Andrzej Skowron: Communicating agents for applicative concurrent programming. 305-322 BibTeX
Axel Poigné: On effective computations of nondeterministic schemes. 323-336 BibTeX
Jean-Pierre Queille, Joseph Sifakis: Specification and verification of concurrent systems in CESAR. 337-351 BibTeX
John M. Rushby: Proof of separability: A verification technique for a class of a security kernels. 352-367 BibTeX
Miklós Szöts, Sándor Csizmazia: A method for program synthesis. 368-380 BibTeX
Judy A. Townley: The use of transformations to implement an algorithm. 381-408 BibTeX