Static Analysis [recurso electrónico] : 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings / edited by Xavier Rival.

Colaborador(es): Rival, Xavier [editor.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 9837Editor: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016Descripción: X, 511 p. 175 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783662534137Tema(s): 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 LanguagesFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1 Clasificación LoC:QA76.9.A43Recursos en línea: Libro electrónicoTexto
Contenidos:
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.
En: Springer eBooksResumen: 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.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos 1 No para préstamo

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.

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.

Con tecnología Koha