International symposium on programming : 5th Colloquium, Turin, April 6-8, 1982 : proceedings
Sparad:
| Institutionell upphovsman: | |
|---|---|
| Övriga upphovsmän: | , |
| Materialtyp: | Livre numérique |
| Språk: | Anglais |
| Publicerad: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
137 |
| Ämnen: | |
| Länkar: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmärkning: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • International symposium on programming, proceedings, 5th colloquium, Turin, April 6-8, 1982 ; ed, by M. Denazi-Ciancaglini and U. Montanari, Berlin, Springer, 1982, 1 vol. (VI-406 p.), Lecture notes in computer science, 3-540-11494-7 • International Symposium on Programming, Texte imprimé, 9783662207109 |
Innehållsförteckning:
- 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.