Static Analysis: 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9837
Editat de Xavier Rivalen Limba Engleză Paperback – 31 aug 2016
The 21 papers presented in this volume were carefully reviewed and selected from 55 submissions. The contributions cover a variety of multi-disciplinary topics in abstract domains; abstract interpretation; abstract testing; bug detection; data flow analysis; model checking; new applications; program transformation; program verification; security analysis; theoretical frameworks; and type checking.
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ț: 330.54 lei
Preț vechi: 413.16 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
58.50€ • 68.60$ • 51.29£
58.50€ • 68.60$ • 51.29£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662534120
ISBN-10: 3662534126
Pagini: 508
Ilustrații: X, 511 p. 175 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662534126
Pagini: 508
Ilustrații: X, 511 p. 175 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
Cuprins
Quantitative Monitor Automata.- The Julia Static Analyzer for Java.- Automated Verification of Linearization Policies.- Structure-Sensitive Points-To Analysis for C and C.- Bounded Abstract Interpretation.- Completeness in Approximate Transduction.- Relational Verification through Horn clause transformation.- Securing A Compiler Transformation.- Exploiting sparsity in difference-bound matrices.- Flow- and Context-Sensitive Points-to Analysis using Generalized Points-to Graphs.- Learning a Variable-Clustering Strategy for Octagon From Labeled Data Generated by a Static Analysis.- Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Program.- Generalized Homogeneous Polynomials for Efficient Template-Based Nonlinear Invariant.- On the linear ranking problem for simple floating-point loops.- Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM.- A Parametric Abstract Domain for Lattice-Valued Regular Expressions.- Cell morphing: from array programs to array-free Horn clauses.- Loopy: Programmable and Formally Verified Loop Transformations.- Abstract Interpretation of Supermodular Games.- Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants.- Enforcing Termination of Interprocedural Analysis.- From Array Domains to Abstract Interpretation under Store-Buffer-Based Memory Models.- Making k-Object-Sensitive Pointer Analysis More Precise with Still k-Limiting.
Caracteristici
Includes supplementary material: sn.pub/extras