Completeness in static analysis by abstract interpretation, a personal point of view

11/17/2022
by   David Monniaux, et al.
0

Static analysis by abstract interpretation is generally designed to be ”sound”, that is, it should not claim to establish properties that do not hold-in other words, not provide ”false negatives” about possible bugs. A rarer requirement is that it should be ”complete”, meaning that it should be able to infer certain properties if they hold. This paper describes a number of practical issues and questions related to completeness that I have come across over the years.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2018

Sound up-to techniques and Complete abstract domains

Abstract interpretation is a method to automatically find invariants of ...
research
03/17/2022

Abstract Interpretation on E-Graphs

Recent e-graph applications have typically considered concrete semantics...
research
01/18/2023

Sound Symbolic Execution via Abstract Interpretation and its Application to Security

Symbolic execution is a program analysis technique commonly utilized to ...
research
11/29/2022

Abstract Interpretation-Based Data Leakage Static Analysis

Data leakage is a well-known problem in machine learning. Data leakage o...
research
10/18/2021

On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm

Lifted inference allows to perform inference in polynomial time w.r.t. d...
research
09/21/2022

Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap

To put static program analysis at the fingertips of the software develop...
research
04/05/2023

Verifiable identification condition for nonignorable nonresponse data with categorical instrumental variables

We consider a model identification problem in which an outcome variable ...

Please sign up or login with your details

Forgot password? Click here to reset