Programming Languages and Systems: Lecture Notes in Computer Science
Editat de Jan Viteken Limba Engleză Paperback – 9 apr 2015
The 33 papers presented in this volume were carefully reviewed and selected from 113 submissions.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 650.13 lei
Preț vechi: 812.65 lei
-20% Nou
Puncte Express: 975
Preț estimativ în valută:
115.06€ • 134.94$ • 100.88£
115.06€ • 134.94$ • 100.88£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662466681
ISBN-10: 3662466686
Pagini: 852
Ilustrații: XIV, 838 p. 274 illus.
Dimensiuni: 155 x 235 x 46 mm
Greutate: 1.26 kg
Ediția:2015
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662466686
Pagini: 852
Ilustrații: XIV, 838 p. 274 illus.
Dimensiuni: 155 x 235 x 46 mm
Greutate: 1.26 kg
Ediția:2015
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.