000 03987nam a22005415i 4500
001 978-3-642-11957-6
003 DE-He213
005 20160624102140.0
007 cr nn 008mamaa
008 100308s2010 gw | s |||| 0|eng d
020 _a9783642119576
_9978-3-642-11957-6
024 7 _a10.1007/978-3-642-11957-6
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aProgramming Languages and Systems
_h[electronic resource] :
_b19th European Symposium on Programming, ESOP 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings /
_cedited by Andrew D. Gordon.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXV, 632 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6012
505 0 _aThe Audacity of Hope: Thoughts on Reclaiming the Database Dream -- Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions -- Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis -- Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays -- A Semantic Framework for Declassification and Endorsement -- Amortised Resource Analysis with Separation Logic -- A PolyTime Functional Language from Light Linear Logic -- Testing Polymorphic Properties -- Formal Verification of Coalescing Graph-Coloring Register Allocation -- A Theory of Speculative Computation -- Propositional Interpolation and Abstract Interpretation -- Functional Programming in Sublinear Space -- Logical Concurrency Control from Sequential Proofs -- Fluid Updates: Beyond Strong vs. Weak Updates -- Parameterized Memory Models and Concurrent Separation Logic -- Amortized Resource Analysis with Polynomial Potential -- Generative Operational Semantics for Relaxed Memory Models -- Automating Security Mediation Placement -- TRX: A Formally Verified Parser Interpreter -- On the Expressive Power of Primitives for Compensation Handling -- Separating Shape Graphs -- Deadlock-Free Channels and Locks -- Verifying a Compiler for Java Threads -- A Grammar-Based Approach to Invertible Programs -- Faulty Logic: Reasoning about Fault Tolerant Programs -- A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While -- A Universal Calculus for Stream Processing Languages -- Enforcing Stateful Authorization and Information Flow Policies in Fine -- Stateful Contracts for Affine Types -- CFA2: A Context-Free Approach to Control-Flow Analysis -- Weighted Dynamic Pushdown Networks -- Explicit Stabilisation for Modular Rely-Guarantee Reasoning.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Communication Networks.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Techniques.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aGordon, Andrew D.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642119569
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6012
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-11957-6
942 _2EBK8956
_cEBK
999 _c38250
_d38250