Static Analysis -

Static Analysis

26th International Symposium, SAS 2019, Porto, Portugal, October 8–11, 2019, Proceedings

Bor-Yuh Evan Chang (Herausgeber)

Buch | Softcover
XIV, 481 Seiten
2019 | 1st ed. 2019
Springer International Publishing (Verlag)
978-3-030-32303-5 (ISBN)
53,49 inkl. MwSt
This book constitutes the refereed proceedings of the 26th International Symposium on Static Analysis, SAS 2019, held in Porto, Portugal, in October 2019.
The 20 regular papers presented in this book were carefully reviewed and selected from 50 submissions. 
The papers are grouped in topical sections on pointers and dataflow; languages and decidability; numerical; trends: assuring machine learning; synthesis and security; and temporal properties and termination.

Rethinking Static Analysis by Combining Discrete and Continuous Reasoning.- Static Analysis of Data Science Software.- Fast and Precise Handling of Positive Weight Cycles for Field-sensitive Pointer Analysis.- Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis.- Syntactic and Semantic Soundness of Structural Dataflow Analysis.- Abstract Interpretation of Indexed Grammars.- Language Inclusion Algorithms as Complete Abstract Interpretations.- On the Monniaux Problem in Abstract Interpretation.- Revisiting Polyhedral Analysis for Hybrid Systems.- An efficient parametric linear programming solver and application to polyhedral projection.- Analysis of Software Patches using Numerical Abstract Interpretation.- Verifying Numerical Programs via Iterative Abstract Testing.- Robustness Verification of Support Vector Machines.- Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification.- Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants.- Direct Manipulation for Imperative Programs.- Responsibility Analysis by Abstract Interpretation.- Temporal Verification of Programs via First-Order Fixpoint Logic.- A Temporal Logic for Higher-Order Functional Programs.- Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets.

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Programming and Software Engineering
Zusatzinfo XIV, 481 p. 2137 illus., 374 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 753 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Compilerbau
Schlagworte abstract domains • Abstract Interpretation • Applications • automated deduction • Computer Science • conference proceedings • Data Flow Analysis • Debugging • deductive methods • Informatics • Logics and meanings of programs • Model Checking • program optimizations and transformations • Program Synthesis • Program verification • Research • security analysis • Static Analysis • tool environments and architectures • Type Checking
ISBN-10 3-030-32303-X / 303032303X
ISBN-13 978-3-030-32303-5 / 9783030323035
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen und Anwendungen

von Hanspeter Mössenböck

Buch | Softcover (2024)
dpunkt (Verlag)
29,90
a beginner's guide to learning llvm compiler tools and core …

von Kai Nacke

Buch | Softcover (2024)
Packt Publishing Limited (Verlag)
49,85