000 04635nam a22005775i 4500
001 978-3-642-54833-8
003 DE-He213
005 20240730202409.0
007 cr nn 008mamaa
008 140321s2014 gw | s |||| 0|eng d
020 _a9783642548338
_9978-3-642-54833-8
024 7 _a10.1007/978-3-642-54833-8
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aProgramming Languages and Systems
_h[electronic resource] :
_b23rd 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 /
_cedited by Zhong Shao.
250 _a1st ed. 2014.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aXIV, 576 p. 161 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8410
505 0 _aComposable 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.
520 _aThis 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.
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aComputer programming.
_94169
650 1 4 _aCompilers and Interpreters.
_931853
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aTheory of Computation.
_9171247
650 2 4 _aProgramming Techniques.
_9171248
700 1 _aShao, Zhong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9171249
710 2 _aSpringerLink (Online service)
_9171250
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642548321
776 0 8 _iPrinted edition:
_z9783642548345
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8410
_9171251
856 4 0 _uhttps://doi.org/10.1007/978-3-642-54833-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c96996
_d96996