Born in the late 70s, Abstract Interpretation has proven an effective method to construct static
analyzers. It has led to successful program analysis tools routinely used in avionic …

A key challenge in example-based program synthesis is the gigantic search space of
programs. To address this challenge, various work proposed to use abstract interpretation to …

Owing to the continued use of C (and C++), spatial safety violations (eg, buffer overflows)
still constitute one of today's most dangerous and prevalent security vulnerabilities. To …

This works studies abstract backward semantics to infer sufficient program preconditions,
based on an idea first proposed in previous work. This analysis exploits under-approximated …

The fundamental idea of Abstract2 Interpretation (A2I), also called meta-abstract
interpretation, is to apply abstract interpretation to abstract interpretation-based static …

This paper concerns the scalability challenges of symbolic abstraction: given a formula ϕ in
a logic L and an abstract domain A, find a most precise element in the abstract domain that …

The template-based approach to invariant generation is a parametric and relatively
complete methodology for inferring loop invariants. The relative completeness ensures the …

Zones and Octagons are popular abstract domains for static program analysis. They enable
the automated discovery of simple numerical relations that hold between pairs of program …

The modular polynomial abstract domain, MPAD, is proposed, whose invariants are systems
of polynomial equations that hold modulo a power of 2. Its domain operations are founded …

Many recent analyses for conventional imperative programs begin by transforming programs
into logic programs, capitalising on existing LP analyses and simple LP semantics. We …