Static Analysis
28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings
Published on 13. October 2021
XVI, 479 pages
978-3-030-88806-0 (ISBN)
Description
This book constitutes the refereed proceedings of the 28th International Symposium on Static Analysis, SAS 2021, held in Chicago, IL, USA, in October 2021.
The 18 regular and 4 short papers, carefully reviewed and selected from 48 submissions, are presented in this book together with 1-page summaries of the three invited talks. The papers cover topics such as static program analysis, abstract domain, abstract interpretation, automated deduction, debugging techniques, deductive methods, model checking, data science, program optimizations and transformations, program synthesis, program verification, and security analysis.
More details
Series
Edition
1st ed. 2021
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Product notice
Reflowable
Illustrations
XVI, 479 p. 166 illus., 97 illus. in color.
ISBN-13
978-3-030-88806-0 (9783030888060)
DOI
10.1007/978-3-030-88806-0
Schweitzer Classification
Other editions
Additional editions
Cezara Dragoi | Suvam Mukherjee | Kedar Namjoshi
Static Analysis
28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings
Book
10/2021
Springer
€85.59
Shipment within 7-9 days
Content
Fast and Efficient Bit-Level Precision Tuning.- Backward Symbolic Execution with Loop Folding.- Accelerating Program Analyses in Datalog by Merging Library Facts.- Abstract Interpretation.- Verified Functional Programming of an Abstract Interpreter.- Disjunctive Interval Analysis.- Static analysis of ReLU neural networks with tropical polyhedral.- Exploiting Verified Neural Networks via Floating Point Numerical Error.-Verifying Low-dimensional Input Neural Networks via Input Quantization.- Data Abstraction: A General Framework to Handle Program.- Verification of Data Structures.- Toward Neural-Network-Guided Program Synthesis and Verification.- Selective Context-Sensitivity for k-CFA with CFL-Reachability.- Selectively-Amortized Resource Bounding.- Reduced Products of Abstract Domains for Fairness Certification of Neural Networks.- A Multi-Language Static Analysis of Python Programs with Native C Extensions.- Automated Verification of the Parallel Bellman-Ford Algorithm.- Improving Thread-Modular Abstract Interpretation.- Thread-modular Analysis of Release-Acquire Concurrency.- Symbolic Automatic Relations and Their Applications to SMT and CHC Solving.- Compositional Verification of Smart Contracts Through Communication Abstraction.- Automatic Synthesis of Data-Flow Analyzer.
