|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-662-46669-8 |
003 |
DE-He213 |
005 |
20230222051528.0 |
007 |
cr nn 008mamaa |
008 |
150331s2015 gw | s |||| 0|eng d |
020 |
|
|
|a 9783662466698
|9 978-3-662-46669-8
|
024 |
7 |
|
|a 10.1007/978-3-662-46669-8
|2 doi
|
050 |
|
4 |
|a Q334-342
|
050 |
|
4 |
|a TA347.A78
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
245 |
1 |
0 |
|a Programming Languages and Systems
|h [electronic resource] :
|b 24th European Symposium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /
|c edited by Jan Vitek.
|
250 |
|
|
|a 1st ed. 2015.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2015.
|
300 |
|
|
|a XIV, 838 p. 274 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 9032
|
505 |
0 |
|
|a Probabilistic Programs as Spreadsheet Queries -- Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection -- Running Probabilistic Programs Backwards -- A Verified Compiler for Probability Density Functions -- Segment Abstraction for Worst-Case Execution Time Analysis -- Automatic Static Cost Analysis for Parallel Programs -- Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs -- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. A Theory of Name Resolution -- A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches -- IsoLate: A Type System for Self-recursion -- The Problem of PL Concurrency Semantics -- The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO -- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity -- Witnessing (Co)datatypes -- Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System -- Refinement Types for Incremental Computational Complexity -- Monotonic References for Efficient Gradual Typing -- Inter-procedural Two-Variable Herbrand Equalities -- Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages -- Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions -- Analysis of Asynchronous Programs with Event-Based Synchronization -- A Semantics for Propositions as Sessions -- Composite Replicated Data Types -- Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement -- Spatial Interpolants -- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs -- Full Reduction in the Face of Absurdity -- CoLoSL: Concurrent Local Subjective Logic -- A Separation Logic for Fictional Sequential Consistency -- Binding Structures as an Abstract Data Type -- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages -- Type Targeted Testing.
|
520 |
|
|
|a This book constitutes the proceedings of the 24th European Symposium on Programming, ESOP 2015, which took place in London, UK, in April 2015, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 33 papers presented in this volume were carefully reviewed and selected from 113 submissions.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Information storage and retrieval systems.
|
650 |
|
0 |
|a Data mining.
|
650 |
|
0 |
|a Application software.
|
650 |
|
0 |
|a Database management.
|
650 |
|
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Artificial Intelligence.
|
650 |
2 |
4 |
|a Information Storage and Retrieval.
|
650 |
2 |
4 |
|a Data Mining and Knowledge Discovery.
|
650 |
2 |
4 |
|a Computer and Information Systems Applications.
|
650 |
2 |
4 |
|a Database Management.
|
650 |
2 |
4 |
|a Algorithms.
|
700 |
1 |
|
|a Vitek, Jan.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662466704
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662466681
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 9032
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-662-46669-8
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|