Cantitate/Preț
Produs

Programming Languages and Systems: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8410

Editat de Zhong Shao
en Limba Engleză Paperback – 17 mar 2014
This book constitutes the proceedings of the 23rd European Symposium on Programming, ESOP 2014, which took place in Grenoble, France, in April 2014, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014. The 27 papers presented in this volume were carefully reviewed and selected from 109 submissions. In addition, the book contains two invited talks. The contributions are organized in topical sections named: type systems; verified compilation; program verification; semantics; concurrency; linear types; network and process calculi; and program analysis.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32832 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 7 noi 2007 32832 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 17 mar 2014 33385 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 33385 lei

Preț vechi: 41731 lei
-20% Nou

Puncte Express: 501

Preț estimativ în valută:
6389 6741$ 5325£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642548321
ISBN-10: 3642548326
Pagini: 592
Ilustrații: XIV, 576 p. 161 illus.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.82 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Composable Transactional Objects: A Position Paper.- Application-Scale Secure Multiparty Computation.- An Array-Oriented Language with Static Rank Polymorphism.- Gradual Typing for Annotated Type Systems.- Staged Composition Synthesis.- Overlapping and Order-Independent Patterns: Definitional Equality for All.- Verified Compilation for Shared-Memory C.- Verifying an Open Compiler Using Multi-language Semantics.- Impredicative Concurrent Abstract Predicates.- Local Reasoning for the POSIX File System.- A Coq Formalization of the Relational Data Model.- On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi.- Grounding Synchronous Deterministic Concurrency in Sequential Programming.- The Duality of Construction.- Deriving Pretty-Big-Step Semantics from Small-Step Semantics.- Communicating State Transition Systems for Fine-Grained Concurrent Resources.- Checking Linearizability of Encapsulated Extended Operations.- Bounded Linear Types in a Resource Semiring.- A Core Quantitative Coeffect Calculus.- Measurements in Proof Nets as Higher-Order Quantum Circuits.- Automatic Termination Verification for Higher-Order Functional Programs.- An Abstract Domain to Infer Ordinal-Valued Ranking Functions.- Model and Proof Generation for Heap-Manipulating Programs.- REAP: Reporting Errors Using Alternative Paths.- The Network as a Language Construct.- Resolving Non-determinism in Choreographies.- A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join.- Targeted Update – Aggressive Memory Abstraction Beyond Common Sense and Its Application on Static Numeric Analysis.- Affine Parallelization of Loops with Run-Time Dependent Bounds from Binaries.