Numerical abstract domains are an important ingredient of modern static analyzers used for
verifying critical program properties (eg, absence of buffer overflow or memory safety) …

Abstract interpretation is a theory of abstraction and constructive approximation of the
mathematical structures used in the formal description of complex or infinite systems and the …

Numerical abstract domains are a fundamental component in modern static program
analysis and are used in a wide range of scenarios (eg computing array bounds …

Static analysis tools for JavaScript must strike a delicate balance, achieving the level of
precision required by the most complex features of target programs without incurring …

The aim of static analysis is to infer invariants about programs that are precise enough to
establish semantic properties, such as the absence of run-time errors. Broadly speaking …

Abstract interpretation promises sound but computable static summarization of program
behavior. However, modern software engineering practices pose significant challenges to …

The formal verification of programs is nowadays a crucial challenge for computer science, as
software bugs in critical systems may lead to catastrophic outcomes. Abstract interpretation …

To understand and detect possible errors in programs manipulating memory, static analyses
of various levels of precision have been introduced, yet it remains hard to capture both …

Conventional array partitioning analyses split arrays into contiguous partitions to infer
properties of sets of cells. Such analyses cannot group together non-contiguous cells, even …

Shape analysis aims to infer precise structural properties of imperative memory states and
has been applied heavily to verify safety properties on imperative code over pointer-based …