000 05749nam a22006255i 4500
001 978-3-662-54434-1
003 DE-He213
005 20210120143309.0
007 cr nn 008mamaa
008 170318s2017 gw | s |||| 0|eng d
020 _a9783662544341
_9978-3-662-54434-1
024 7 _a10.1007/978-3-662-54434-1
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aUMX
_2thema
072 7 _aUMC
_2thema
082 0 4 _a005.13
_223
245 1 0 _aProgramming Languages and Systems
_h[electronic resource] :
_b26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings /
_cedited by Hongseok Yang.
250 _a1st ed. 2017.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2017.
300 _aXV, 992 p. 236 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 ;
_v10201
_aLecture Notes in Computer Science
_v10201
505 0 _aDisjoint Polymorphism -- Generalizing inference systems by coaxioms -- Observed Communication Semantics for Classical Processes -- Is your software on dope? – Formal analysis of surreptitiously "enhanced" programs -- Friends with Benefits: Implementing Corecursion in Foundational Proof Assistants -- Confluence of Graph Rewriting with Interfaces -- Verifying Robustness of Event-Driven Asynchronous Programs against Concurrency -- Incremental update for graph rewriting -- Linearity, Control Effects, and Behavioral Types -- Temporary Read-Only Permissions for Separation Logic -- Faster Algorithms for Weighted Recursive State Machines -- ML and Extended BVASS. – Metric Reasoning about Lambda Terms: the General Case -- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring -- Probabilistic Termination by Monadic Affine Sized Typing -- Caper: Automatic Verification for Fine-grained Concurrency -- Tackling Real-Life Relaxed Concurrency with FSL++. - Extensible Datasort Refinements -- Programs Using Syntax with First-Class Binders. - Lincx: A Linear Logical Framework with First-class Context -- APLicative Programming with Naperian Functors -- Verified Characteristic Formulae for CakeML -- Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic -- Proving Linearizability Using Partial Orders -- The Power of Non-Determinism in Higher-Order Implicit Complexity -- The Essence of Higher-Order Concurrent Separation Logic -- Comprehending Isabelle/HOL’s Consistency.-The essence of functional programming on semantic data -- A Classical Sequent Calculus with Dependent Types -- Context-Free Session Type Inference -- Modular Verification of Higher-order Functional Programs -- Commutative semantics for probabilistic programming -- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization -- A Higher-Order Logic for Concurrent Termination-Preserving Refinement -- Modular Verification of Procedure Equivalence in the Presence of Memory Allocation -- Abstract Specifications for Concurrent Maps.
520 _aThis book constitutes the proceedings of the 26th European Symposium on Programming, ESOP 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 36 papers presented in this volume were carefully reviewed and selected from 112 submissions. They cover traditional as well as emerging topics in programming languages. In detail they deal with semantic foundation and type system for probabilistic programming; techniqu3es for verifying concurrent or higher-order programs; programming languages for arrays or web data; program analysis and verification of non-standard program properties; foundation and application of interactive theorem proving; graph rewriting; separation logic; session type; type theory; and implicit computational complexity. .
650 0 _aProgramming languages (Electronic computers).
650 0 _aComputer logic.
650 0 _aSoftware engineering.
650 0 _aComputers.
650 0 _aComputer programming.
650 1 4 _aProgramming Languages, Compilers, Interpreters.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14037
650 2 4 _aLogics and Meanings of Programs.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
650 2 4 _aSoftware Engineering.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14029
650 2 4 _aComputation by Abstract Devices.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16013
650 2 4 _aProgramming Techniques.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14010
700 1 _aYang, Hongseok.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662544334
776 0 8 _iPrinted edition:
_z9783662544358
830 0 _aTheoretical Computer Science and General Issues ;
_v10201
830 0 _aLecture Notes in Computer Science ;
_v10201
856 4 0 _uhttps://doi.org/10.1007/978-3-662-54434-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57180
_d57180