LEADER 05062nam 22006975 450 001 9910483044503321 005 20251226203146.0 010 $a3-642-37036-5 024 7 $a10.1007/978-3-642-37036-6 035 $a(CKB)3520000000003560 035 $a(SSID)ssj0000880057 035 $a(PQKBManifestationID)11454618 035 $a(PQKBTitleCode)TC0000880057 035 $a(PQKBWorkID)10872234 035 $a(PQKB)10146359 035 $a(DE-He213)978-3-642-37036-6 035 $a(MiAaPQ)EBC3093131 035 $a(PPN)168330520 035 $a(EXLCZ)993520000000003560 100 $a20130220d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aProgramming Languages and Systems $e22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings /$fedited by Matthias Felleisen, Philippa Gardner 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XX, 620 p. 162 illus.) 225 1 $aProgramming and Software Engineering,$x2945-9168 ;$v7792 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-37035-7 327 $aDistributed Electronic Rights in JavaScript -- The Compiler Forest -- Pretty-Big-Step Semantics -- Language Constructs for Non-Well-Founded Computation -- Laziness by Need -- FliPpr: A Prettier Invertible Printing System -- Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJULIENNE -- Why3 ? Where Programs Meet Provers -- Compositional Invariant Checking for Overlaid and Nested Linked Lists -- A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness -- Modular Reasoning about Separation of Concurrent Data Structures -- Ribbon Proofs for Separation Logic -- Abstract Refinement Types -- Constraining Delimited Control with Contracts -- Verifying Concurrent Memory Reclamation Algorithms with Grace -- Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels -- Verifying Concurrent Programs against Sequential Specifications -- On Distributability in Process Calculi -- Behavioral Polymorphism and Parametricity in Session-Based Communication -- Higher-Order Processes, Functions, and Sessions: A Monadic Integration -- Concurrent Flexible Reversibility -- Structural Lock Correlation with Ownership Types -- Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems -- Model-Checking Higher-Order Programs with Recursive Types -- Counterexample-Guided Precondition Inference -- Information Reuse for Multi-goal Reachability Analyses -- Quarantining Weakness: Compositional Reasoning under Relaxed Memory Models (Extended Abstract) -- Software Verification for Weak Memory via Program Transformation -- Checking and Enforcing Robustness against TSO -- GADTs Meet Subtyping -- A Data Driven Approach for Algebraic Loop Invariants -- Automatic Type Inference for Amortised Heap-Space Analysis. 330 $aThis book constitutes the refereed proceedings of the 22nd European Symposium on Programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013. The 31 papers, presented together with a full-length invited talk, were carefully reviewed and selected from 120 full submissions. The contributions have been organized according to ten topical sections on programming techniques; programming tools; separation logic; gradual typing; shared-memory concurrency and verification; process calculi; taming concurrency; model checking and verification; weak-memory concurrency and verification; and types, inference, and analysis. 410 0$aProgramming and Software Engineering,$x2945-9168 ;$v7792 606 $aSoftware engineering 606 $aCompilers (Computer programs) 606 $aComputer programming 606 $aComputer science 606 $aSoftware Engineering 606 $aCompilers and Interpreters 606 $aProgramming Techniques 606 $aComputer Science Logic and Foundations of Programming 615 0$aSoftware engineering. 615 0$aCompilers (Computer programs). 615 0$aComputer programming. 615 0$aComputer science. 615 14$aSoftware Engineering. 615 24$aCompilers and Interpreters. 615 24$aProgramming Techniques. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a005.1 702 $aFelleisen$b Matthias$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGardner$b Philippa$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483044503321 996 $aProgramming Languages and Systems$93644366 997 $aUNINA LEADER 05394nam 22006855 450 001 9910483836903321 005 20251225210851.0 010 $a3-662-54434-2 024 7 $a10.1007/978-3-662-54434-1 035 $a(CKB)3710000001157261 035 $a(DE-He213)978-3-662-54434-1 035 $a(MiAaPQ)EBC6294934 035 $a(MiAaPQ)EBC5576968 035 $a(Au-PeEL)EBL5576968 035 $a(OCoLC)982372902 035 $a(PPN)200512315 035 $a(EXLCZ)993710000001157261 100 $a20170318d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aProgramming Languages and Systems $e26th 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 /$fedited by Hongseok Yang 205 $a1st ed. 2017. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2017. 215 $a1 online resource (XV, 992 p. 236 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10201 300 $aIncludes index. 311 08$a3-662-54433-4 327 $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 DatasortRefinements -- 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. 330 $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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10201 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aSoftware engineering 606 $aComputer programming 606 $aCompilers and Interpreters 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aTheory of Computation 606 $aProgramming Techniques 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aComputer programming. 615 14$aCompilers and Interpreters. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aTheory of Computation. 615 24$aProgramming Techniques. 676 $a005.1 702 $aYang$b Hongseok$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483836903321 996 $aProgramming Languages and Systems$93644366 997 $aUNINA