Programming Languages and Systems de Zhong Shao

Programming Languages and Systems

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

	Preț	Express
Paperback (2)	329^.74 lei 6-8 săpt.
Springer – 7 noi 2007	329^.74 lei 6-8 săpt.
Springer – 17 mar 2014	337^.13 lei 6-8 săpt.

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.