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