Cantitate/Preț
Produs
Total produse
Vezi coșul
Static Analysis: 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings de Xavier Rival

Static Analysis: 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9837

Editat de Xavier Rival
en Limba Engleză Paperback – 31 aug 2016
This book constitutes the refereed proceedings of the 23rd International Static Analysis Symposium, SAS 2016, held in Edinburgh, UK, in September 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33054 lei

Preț vechi: 41316 lei
-20%

Puncte Express: 496
Preț estimativ în valută:
5844€ • 6982$ • 5062£

Carte tipărită la comandă

Livrare economică 14-28 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

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

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