International audienceArray partitioning analyses split arrays into contiguous parti-tions to infer properties of cell sets. Such analyses cannot group together non contiguous cells, even when they have similar properties. In this paper, we propose an abstract domain which utilizes semantic properties to split array cells into groups. Cells with similar properties will be packed into groups and abstracted together. Additionally, groups are not necessarily contiguous. This abstract domain allows to infer complex array invariants in a fully automatic way. Experiments on examples from the Minix 1.1 memory management demonstrate its effectiveness
Theories for data types have many important consequences for their effective use. Attempts to find a...
We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the ob...
International audienceIn this paper, we propose a static analysis technique for assembly code, based...
International audienceConventional array partitioning analyses split arrays into contiguous partitio...
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
International audienceArray bound checking and array dependency analysis (for parallelization) have ...
. Structured, dependence-free decomposition of aggregate data objects can be regarded as a generaliz...
Static analysis is key area in compilation, optimization and software validation. The complex data s...
International audienceThe breadth and depth of heap properties that can be inferred by theunion of t...
Abstract. The breadth and depth of heap properties that can be inferred by the union of today’s shap...
Clustering seeks to group or to lump together objects or variables that share some observed qualitie...
AbstractWe present a generic abstract domain for analysis of dictionary and array content. Our techn...
Arrays are among the most commonly used data structures in programs. In order for a program analysis...
Abstract. Horizontal fragmentation plays an important role in the design phase of Distributed Databa...
A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. Th...
Theories for data types have many important consequences for their effective use. Attempts to find a...
We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the ob...
International audienceIn this paper, we propose a static analysis technique for assembly code, based...
International audienceConventional array partitioning analyses split arrays into contiguous partitio...
Array bound checking and array dependency analysis (for par-allelization) have been widely studied. ...
International audienceArray bound checking and array dependency analysis (for parallelization) have ...
. Structured, dependence-free decomposition of aggregate data objects can be regarded as a generaliz...
Static analysis is key area in compilation, optimization and software validation. The complex data s...
International audienceThe breadth and depth of heap properties that can be inferred by theunion of t...
Abstract. The breadth and depth of heap properties that can be inferred by the union of today’s shap...
Clustering seeks to group or to lump together objects or variables that share some observed qualitie...
AbstractWe present a generic abstract domain for analysis of dictionary and array content. Our techn...
Arrays are among the most commonly used data structures in programs. In order for a program analysis...
Abstract. Horizontal fragmentation plays an important role in the design phase of Distributed Databa...
A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. Th...
Theories for data types have many important consequences for their effective use. Attempts to find a...
We have a variety of different ways of dividing up, classifying, mapping, sorting and listing the ob...
International audienceIn this paper, we propose a static analysis technique for assembly code, based...