International Symposium on Programming: 5th Colloquium, Turin, April 6-8, 1982. Proceedings (Lecture Notes in Computer Science 137)
By admin • Aug 14th, 2009 • Category: Uncategorized
International Symposium on Programming: 5th Colloquium, Turin, April 6-8, 1982. Proceedings (Lecture Notes in Computer Science 137)
by: M. Dezani-Ciancaglini, U. Montanari
en | Springer
3540114947 9783540114949 0387114947 9780387114941
International Symposium on Programming: 5th Colloquium, Turin, April 6-8, 1982. Proceedings (Lecture Notes in Computer Science)
By M. Dezani-Ciancaglini, U. Montanari
Publisher: Springer
Number Of Pages: 416
Publication Date: 1982-05-04
ISBN-10 / ASIN: 3540114947
ISBN-13 / EAN: 9783540114949
Contents:
Applicative communicating processes in first order logic …………………… 1
A machine level semantics for nondeterministic, parallel programs …. . ………. 15
A formalized proof system for total correctness of while programs …………… 26
Automatic program transformation viewed as theorem proving …………………. 37
An enlarged definition and complete axiomatization of observational congruence of
finite processes ………………………………………………………. 47
Perluette: A compilers producing system using abstract data types …………… 63
A weakest precondition semantics for communicating processes ……………… 78
From abstract model to efficient compilation of patterns …………………… 91
Computer-based synthesis of logic programs ……………………………….. 105
On some syntactic equivalence of program schemas and related transformations …. 116
Procedures and concurrency: A study in proof ………………………………. 132
Another characterization of weakest preconditions …………….. ………….. 164
Powerdomains and nondeterministic recursive definitions ……………………. 178
Optimizing for a multiprocessor: Balancing synchronization costs against parallelism
in straight-line code ………………………………………………….. 194
The simple semantics for Coppo-Dezani – Salle types ……………………….. 212
Proving the correctness of implementations of shared data abstractions ………… 227
Specification of communicating processes and process implementation correctness. 242
A system for reasoning within and about algebraic specifications ……………. 257
Tuning algebraic specifications by type merging …………………………… 283
Communicating agents for applicative concurrent programming ………………… 305
On effective computations of nondeterministic schemes ……………………… 323
Specification and verification of concurrent systems in CESAR ………………. 337
Proof of separability. A verification technique for a class of a security kernels 352
A method for program synthesis…………………………………………… 368
The use of transformations to implement an algorithm ………………………. 381
Please Login or Register to read the rest of this content.
Related Posts
Leave a Reply
You must be logged in to post a comment.
