Numerical and Symbolic Abstract Domains

NSAD 2019


Theoretical Computer Science



Objective :
Abstract domains are a key notion in Abstract Interpretation theory
and practice. The Abstract Interpretation framework provides
constructive and systematic formal methods to design, compose,
compare, study, prove, and apply abstract domains, notably for
software verification purposes. Many abstract domains have been
designed so far: numerical domains (intervals, congruences, polyhedra,
polynomials, etc.), symbolic domains (shape domains, trees, etc.), but
also domain operators (products, powersets, completions, etc.), and
have been applied to several kinds of static analyses (safety,
termination, probability, etc.). Abstract domains may also be used in
other communities closed to Abstract Interpretation, like Constraint
Solving, SMT Solving, Program Transformation, this workshop is the
place to share our various experiences.
Scope :
The technical program of NSAD 2019 will consist of invited lectures
together with presentations, based on submitted extended abstracts.
Submissions can cover any aspect of numerical and symbolic abstract domains, such that:
-cases studies or problem statements coming from close communities
-numeric abstract domains
-symbolic abstract domains
-extrapolations and accelerations
-compositions and operations on abstract domains
-data structures and algorithms for abstract domains
-novel applications of abstract domains implementations
-practical experiments and comparisons
-implementations
Like TAPAS, this workshop welcomes work in progress, overviews of more
extensive work, programmatic or position papers and tool
presentations. We particularly encourage submissions coming from
other commmunities like constraint solving, logics, compilation ...