International Symposium on Programming - nuovo libro

EAN (ISBN-13): 9783540391845
Editore: Springer Science+Business Media

Libro nella banca dati dal 2016-12-20T11:25:38+01:00 (Rome)
Pagina di dettaglio ultima modifica in 2021-09-16T14:42:13+02:00 (Rome)
ISBN/EAN: 9783540391845

ISBN - Stili di scrittura alternativi:
978-3-540-39184-5
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : montanari
Titolo del libro: international

---

Dati dell'editore

Autore: M. Dezani-Ciancaglini; U. Montanari
Titolo: Lecture Notes in Computer Science; International Symposium on Programming - 5th Colloquium, Turin, April 6-8, 1982. Proceedings
Editore: Springer; Springer Berlin
416 Pagine
Anno di pubblicazione: 2005-06-29
Berlin; Heidelberg; DE
Lingua: Inglese
37,44 € (DE)
38,50 € (AT)
47,00 CHF (CH)
Available
VIII, 416 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; concurrency; logic; parallelism; program synthesis; program transformation; programming; semantics; theorem proving; verification; C; Computer Science Logic and Foundations of Programming; Programming Techniques; Computer Science; Computerprogrammierung und Softwareentwicklung; BC

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.