Static Analysis
Description
The 14 regular papers presented in this book together with 2 invited talks and 1 extended abstract, were carefully reviewed and selected from 34 submissions.
The papers cover topics such as abstract domains; abstract interpretation; automated deduction; data flow analysis; debugging; deductive methods; emerging applications; model-checking; program transformations; predicate abstraction; security analysis; tool environments and architectures; and type checking.
Due to the Corona pandemic this event was held virtually.
More details
Other editions
Additional editions
Content
Polynomial Invariants for Affine Programs.- Cost Analysis of Smart Contracts via Parametric Resource Analysis.- Memory-Efficient Fixpoint Computation.- Abstract Neural Networks.- Termination of Polynomial Loops.- Stratified Guarded First-order Transition Systems.- Predicate Abstraction and CEGAR for nuHFL(Z) Validity Checking.- Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis.- Harming Dynamic Analysis.- Simple and Efficient Computation of Minimal Weak Control Closure.- A Library Modeling Language for the Static Analysis of C Programs.- Interprocedural Shape Analysis Using Separation Logic-Based Transformer Summaries.- Probabilistic Lipschitz Analysis of Neural Networks.- On Multi-Language Abstraction: Towards a Static Analysis of Multi-Language Programs.- Exact and Linear-Time Gas-Cost Analysis.- Farkas-Based Tree Interpolation.