Static Analysis 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Rival, Xavier (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
• Σειρά: Lecture Notes in Computer Science, 9837
• Θέματα: Computer science.; Software engineering.; Programming languages (Electronic computers).; Algorithms.; Computer logic.; Mathematical logic.; Computer Science.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.; Software Engineering.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.

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-discipli...

Πίνακας περιεχομένων:

• 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. .