Abstract. We present a numerical abstract domain to infer invariants on (a possibly unbounded number of) consecutive array elements using array predicates. It is able to represent and compute affine equality rela-tions over the predicate parameters and the program variables, without using disjunctions or heuristics. It is the cornerstone of a sound static analysis of one- and two-dimensional array manipulation algorithms. The implementation shows very good performance on representative bench-marks. Our approach is sufficiently robust to handle programs traversing arrays and matrices in various ways.
The ability to describe array expressions in terms of the shapes of their arguments and the symbolic...
Abstract. We propose a logic-based framework for automated reasoning about sequential programs manip...
Automatic discovery of relationships among values of array elements is a challenging problem due to ...
In this paper we present a novel approach to automatically generate invariants for loops manipulatin...
Abstract. This paper presents a new numerical abstract domain for static analysis by abstract interp...
International audienceThis paper presents a new numerical abstract domain for static analysis by abs...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
International audienceWe propose a technique to describe properties of numerical stores with optiona...
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of...
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of ...
International audienceThe theory of arrays, introduced by McCarthy in his seminal paper "Towards a m...
International audienceArray bound checking and array dependency analysis (for parallelization) have ...
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
AbstractWe propose a new numerical abstract domain for static analysis by abstract interpretation, t...
This article describes and evaluates DIG, a dynamic invariant generator that infers invariants from ...
The ability to describe array expressions in terms of the shapes of their arguments and the symbolic...
Abstract. We propose a logic-based framework for automated reasoning about sequential programs manip...
Automatic discovery of relationships among values of array elements is a challenging problem due to ...
In this paper we present a novel approach to automatically generate invariants for loops manipulatin...
Abstract. This paper presents a new numerical abstract domain for static analysis by abstract interp...
International audienceThis paper presents a new numerical abstract domain for static analysis by abs...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
International audienceWe propose a technique to describe properties of numerical stores with optiona...
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of...
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of ...
International audienceThe theory of arrays, introduced by McCarthy in his seminal paper "Towards a m...
International audienceArray bound checking and array dependency analysis (for parallelization) have ...
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
AbstractWe propose a new numerical abstract domain for static analysis by abstract interpretation, t...
This article describes and evaluates DIG, a dynamic invariant generator that infers invariants from ...
The ability to describe array expressions in terms of the shapes of their arguments and the symbolic...
Abstract. We propose a logic-based framework for automated reasoning about sequential programs manip...
Automatic discovery of relationships among values of array elements is a challenging problem due to ...