LEADER 00000cam  2200637Ii 4500 
001    on1031400010 
003    OCoLC 
005    20200419060444.8 
006    m     o  d         
007    cr cnu|||unuuu 
008    180417s2018    sz a    o     101 0 eng d 
015    GBB948665|2bnb 
016 7  019286657|2Uk 
020    9783319898841|q(electronic book) 
020    3319898841|q(electronic book) 
020    |z9783319898834|q(print) 
024 7  10.1007/978-3-319-89884-1|2doi 
035    (OCoLC)1031400010 
037    com.springer.onix.9783319898841|bSpringer Nature 
040    GW5XE|beng|erda|epn|cGW5XE|dOCLCF|dOCLCO|dCOO|dUAB|dMERER
       |dOCLCQ|dU3W|dESU|dLVT|dOAPEN|dOCLCO|dCAUOI|dBRX|dOCLCQ
       |dOCLCO|dUKMGB|dC6I|dOCLCQ|dOCLCO 
049    STJJ 
050  4 QA76.6 
082 04 005.1|223 
111 2  European Symposium on Programming|n(27th :|d2018 :
       |cThessalonikē, Greece) 
245 10 Programming languages and systems :|b27th European 
       Symposium on Programming, ESOP 2018, held as part of the 
       European Joint Conferences on Theory and Practice of 
       Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 
       2018, Proceedings /|cAmal Ahmed (eds.). 
246 3  ESOP 2018 
264  1 Cham, Switzerland :|bSpringer Open,|c2018. 
300    1 online resource (xvi, 1058 pages) :|billustrations. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
490 1  Lecture notes in computer science,|x0302-9743 ;|v10801 
490 1  Advanced research in computing and software science 
490 1  LNCS sublibrary. SL 1, Theoretical computer science and 
       general issues 
500    International conference proceedings. 
500    Includes author index. 
505 0  Language Design -- Consistent Subtyping for All -- HOBiT: 
       Programming Lenses without using Lens Combinators -- 
       Dualizing Generalized Algebraic Data Types by Matrix 
       Transposition -- Deterministic Concurrency: A Clock-
       Synchronised Shared Memory Approach -- Probabilistic 
       Programming -- An Assertion-Based Program Logic for 
       Probabilistic Programs -- Fine-grained Semantics for 
       Probabilistic Programs -- How long, O Bayesian network, 
       will I sample thee? -- Relational Reasoning for Markov 
       Chains in a Probabilistic Guarded Lambda Calculus -- Types
       and Effects -- Failure is Not an Option: An Exceptional 
       Type Theory -- Let Arguments Go First -- Behavioural 
       equivalence via modalities for algebraic effects -- 
       Explicit Effect Subtyping -- Concurrency -- A separation 
       logic for a promising semantics -- Logical Reasoning for 
       Disjoint Permissions -- Deadlock-Free Monitors -- Fragment
       Abstraction for Concurrent Shape Analysis -- Security -- 
       Reasoning About a Machine with Local Capabilities -- 
       Provably Safe Stack and Return Pointer Management -- 
       Modular Product Programs -- Program Verification -- A 
       Fistful of Dollars: Formalizing Asymptotic Complexity 
       Claims via Deductive Program Verification -- Verified 
       Learning Without Regret -- Program Verification by 
       Coinduction -- Velisarios: Byzantine Fault Tolerant 
       Protocols Powered by Coq -- Program Analysis and Automated
       Verification -- Evaluating Design Tradeoffs in Numeric 
       Static Analysis for Java -- An Abstract Interpretation 
       Framework for Input Data Usage -- Higher-Order Program 
       Verification via HFL Model Checking -- Quantitative 
       Analysis of Smart Contracts -- Session Types and 
       Concurrency -- Session-Typed Concurrent Contracts -- A 
       Typing Discipline for Statically Verified Crash Failure 
       Handling in Distributed Systems -- On Polymorphic Sessions
       and Functions: A Tale of Two (Fully Abstract) Encodings --
       Concurrent Kleene Algebra: Free Model and Completeness -- 
       Concurrency and Distribution -- Correctness of a 
       Concurrent Object Collector for Actor Languages -- Paxos 
       Consensus, Deconstructed and Abstracted -- On Parallel 
       Snapshot Isolation and Release/Acquire Consistency -- 
       Eventual Consistency for CRDTs -- Compiler Verification --
       A Verified Compiler from Isabelle/HOL to CakeML -- 
       Compositional Verification of Compiler Optimisations on 
       Relaxed Memory. 
506 0  Open access.|5GW5XE 
520    This book is Open Access under a CC BY licence. 
588 0  Online resource; title from PDF title page (SpringerLink, 
       viewed April 17, 2018). 
590    SpringerLink|bSpringer Nature Open Access eBooks 
650  0 Computer programming|vCongresses. 
650  0 Programming languages (Electronic computers)|vCongresses. 
650  7 Computer science.|2bicssc 
650  7 Computer programming.|2fast|0(OCoLC)fst00872390 
650  7 Programming languages (Electronic computers)|2fast
       |0(OCoLC)fst01078704 
655  7 Conference papers and proceedings.|2fast
       |0(OCoLC)fst01423772 
700 1  Ahmed, Amal,|eeditor. 
711 2  ETAPS (Conference)|n(21st :|d2018 :|cThessalonikē , 
       Greece),|jjointly held conference. 
830  0 Lecture notes in computer science ;|v10801.|x0302-9743 
830  0 Lecture notes in computer science.|pAdvanced research in 
       computing and software science. 
830  0 LNCS sublibrary.|nSL 1,|pTheoretical computer science and 
       general issues. 
914    on1031400010 
994    92|bSTJ