International Symposium on Programming: 5th Colloquium Turin, April 6–8, 1982 Proceedings [1 ed.] 3540114947, 9783540114949, 0387114947, 9780387114941
210 22 4MB
English Pages 416 [413] Year 1982
Table of contents :
Applicative communicating processes in first order logic....Pages 1-14
A machine-level semantics for nondeterministic, parallel programs....Pages 15-25
A formalized proof system for total correctness of while programs....Pages 26-36
Automatic program transformation viewed as theorem proving....Pages 37-46
An enlarged definition and complete axiomatization of observational congruence of finite processes....Pages 47-62
Perluette : A compilers producing system using abstract data types....Pages 63-77
A weakest precondition semantics for communicating processes....Pages 78-90
From abstract model to efficient compilation of patterns....Pages 91-104
Computer-based synthesis of logic programs....Pages 105-115
On some syntactic equivalences of program schemas and related transformations....Pages 116-131
Procedures and concurrency: A study in proof....Pages 132-163
Another characterization of weakest preconditions....Pages 164-177
Powerdomains and nondeterministic recursive definitions....Pages 178-193
Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code....Pages 194-211
The simple semantics for Coppo-Dezani-Sallé types....Pages 212-226
Proving the correctness of implementations of shared data abstractions....Pages 227-241
Specification of communicating processes and process implementation correctness....Pages 242-256
A system for reasoning within and about algebraic specifications....Pages 257-282
Tuning algebraic specifications by type merging....Pages 283-304
Communicating agents for applicative concurrent programming....Pages 305-322
On effective computations of non-deterministic schemes....Pages 323-336
Specification and verification of concurrent systems in CESAR....Pages 337-351
Proof of separability A verification technique for a class of security kernels....Pages 352-367
A method for program synthesis....Pages 368-380
The use of transformations to implement an algorithm....Pages 381-406
Applicative communicating processes in first order logic....Pages 1-14
A machine-level semantics for nondeterministic, parallel programs....Pages 15-25
A formalized proof system for total correctness of while programs....Pages 26-36
Automatic program transformation viewed as theorem proving....Pages 37-46
An enlarged definition and complete axiomatization of observational congruence of finite processes....Pages 47-62
Perluette : A compilers producing system using abstract data types....Pages 63-77
A weakest precondition semantics for communicating processes....Pages 78-90
From abstract model to efficient compilation of patterns....Pages 91-104
Computer-based synthesis of logic programs....Pages 105-115
On some syntactic equivalences of program schemas and related transformations....Pages 116-131
Procedures and concurrency: A study in proof....Pages 132-163
Another characterization of weakest preconditions....Pages 164-177
Powerdomains and nondeterministic recursive definitions....Pages 178-193
Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code....Pages 194-211
The simple semantics for Coppo-Dezani-Sallé types....Pages 212-226
Proving the correctness of implementations of shared data abstractions....Pages 227-241
Specification of communicating processes and process implementation correctness....Pages 242-256
A system for reasoning within and about algebraic specifications....Pages 257-282
Tuning algebraic specifications by type merging....Pages 283-304
Communicating agents for applicative concurrent programming....Pages 305-322
On effective computations of non-deterministic schemes....Pages 323-336
Specification and verification of concurrent systems in CESAR....Pages 337-351
Proof of separability A verification technique for a class of security kernels....Pages 352-367
A method for program synthesis....Pages 368-380
The use of transformations to implement an algorithm....Pages 381-406
![International Symposium on Programming: 5th Colloquium Turin, April 6–8, 1982 Proceedings [1 ed.]
3540114947, 9783540114949, 0387114947, 9780387114941](https://ebin.pub/img/200x200/international-symposium-on-programming-5th-colloquium-turin-april-68-1982-proceedings-1nbsped-3540114947-9783540114949-0387114947-9780387114941.jpg)
- Author / Uploaded
- Marco Bellia
- Pierpaolo Degano
- Giorgio Levi (auth.)
- Mariangiola Dezani-Ciancaglini
- Ugo Montanari (eds.)
- Similar Topics
- Education
- International Conferences and Symposiums
![5th International Colloquium on Transformer Research and Asset Management [1st ed.]
9789811555992, 9789811556005](https://ebin.pub/img/200x200/5th-international-colloquium-on-transformer-research-and-asset-management-1st-ed-9789811555992-9789811556005.jpg)
![Symposium on Lexicography IX: Proceedings of the Ninth International Symposium on Lexicography April 23-25, 1998 at the University of Copenhagen [Reprint 2010 ed.]
9783110915044, 9783484391031](https://ebin.pub/img/200x200/symposium-on-lexicography-ix-proceedings-of-the-ninth-international-symposium-on-lexicography-april-23-25-1998-at-the-university-of-copenhagen-reprint-2010nbsped-9783110915044-9783484391031.jpg)
![Proceedings of the 5th International Symposium on Uncertainty Quantification and Stochastic Modelling: Uncertainties 2020 [1st ed.]
9783030536688, 9783030536695](https://ebin.pub/img/200x200/proceedings-of-the-5th-international-symposium-on-uncertainty-quantification-and-stochastic-modelling-uncertainties-2020-1st-ed-9783030536688-9783030536695.jpg)
![Mathematical Morphology: 40 Years On: Proceedings of the 7th International Symposium on Mathematical Morphology, April 18–20, 2005 [1 ed.]
9781402034428, 9781402034435, 1402034423, 1402034431](https://ebin.pub/img/200x200/mathematical-morphology-40-years-on-proceedings-of-the-7th-international-symposium-on-mathematical-morphology-april-1820-2005-1nbsped-9781402034428-9781402034435-1402034423-1402034431.jpg)
