Programming Languages and Systems de Zhong Shao

Programming Languages and Systems

Zhong Shao

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

	Preț	Express
Paperback (2)	328^.72 lei 6-8 săpt.
Springer – 7 noi 2007	328^.72 lei 6-8 săpt.
Springer Berlin, Heidelberg – 17 mar 2014	333^.68 lei 6-8 săpt.

Preț

Express

Paperback (2)

328^.72 lei 6-8 săpt.

Springer – 7 noi 2007

328^.72 lei 6-8 săpt.

Springer Berlin, Heidelberg – 17 mar 2014

333^.68 lei 6-8 săpt.

Cuprins

Invited Talk 1.- X10: Concurrent Programming for Modern Architectures.- The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification.- Local Reasoning for Storable Locks and Threads.- Monadic, Prompt Lazy Assertions in Haskell.- Translation Correctness for First-Order Object-Oriented Pattern Matching.- Persistent Oberon: A Programming Language with Integrated Persistence.- More Typed Assembly Languages for Confidentiality.- A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics.- On a Tighter Integration of Functional and Logic Programming.- Invited Talk 2.- Scalable Simulation of Cellular Signaling Networks.- Timed, Distributed, Probabilistic, Typed Processes.- A Probabilistic Applied Pi–Calculus.- Type-Based Verification of Correspondence Assertions for Communication Protocols.- Deriving Compilers and Virtual Machines for a Multi-level Language.- Finally Tagless, Partially Evaluated.- Polymorphic Delimited Continuations.- Adjunct Elimination in Context Logic for Trees.- Positive Arithmetic Without Exchange Is a Subclassical Logic.- Mixed Inductive/Coinductive Types and Strong Normalization.- Invited Talk 3.- Static and Dynamic Analysis: Better Together.- The Semantics of “Semantic Patches” in Coccinelle: Program Transformation for the Working Programmer.- An Efficient SSA-Based Algorithm for Complete Global Value Numbering.- A Systematic Approach to Probabilistic Pointer Analysis.- Complete Lattices and Up-To Techniques.- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract.- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence.- Call-by-Name and Call-by-Value in Normal Modal Logic.- Call-by-Value Is Dual to Call-by-Name, Extended.