AbstractWe present a generic abstract domain for analysis of dictionary and array content. Our technique is parametrised by the abstractions of scalars, dictionary keys and dictionary values. It can be instantiated with various existing domains, including non-numerical ones (such as domains for analysis of properties of string variables). It is powerful enough to express relations between container content and scalars.The analysis is fully automatic. The container is partitioned according to properties of the keys, captured by the underlying key abstraction. The precision and cost of the analysis are customisable and depend on the choice of the abstractions of keys, dictionary elements and scalar variables.We show examples in which the tech...
There are many applications where precise mode analysis is required. However, within the framework o...
Slicing analyses have been proposed for different programming languages. Rather than defining a new ...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
AbstractWe present a generic abstract domain for analysis of dictionary and array content. Our techn...
To Rebecca, the light of my eyes The goal of this thesis is to contribute to the field of formal met...
Abstract interpretation is a well established theory that supports reasoning about the run-time beha...
Interpretation is a well established theory that supports reasoning about the run-time behaviour of ...
International audienceWe propose a technique to describe properties of numerical stores with optiona...
The application field of static analysis techniques for objectoriented programming is getting broade...
AbstractIn 1997, Cousot introduced a hierarchy where semantics are related with each other by abstra...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
We propose an algorithm to over-approximate data dependencies with respect to abstract properties of...
Abstract interpretation is a systematic methodology to design static program analysis which has been...
International audienceArray bound checking and array dependency analysis (for parallelization) have ...
We introduce the operation of domain compression for complete refinements of finite abstract domains...
There are many applications where precise mode analysis is required. However, within the framework o...
Slicing analyses have been proposed for different programming languages. Rather than defining a new ...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...
AbstractWe present a generic abstract domain for analysis of dictionary and array content. Our techn...
To Rebecca, the light of my eyes The goal of this thesis is to contribute to the field of formal met...
Abstract interpretation is a well established theory that supports reasoning about the run-time beha...
Interpretation is a well established theory that supports reasoning about the run-time behaviour of ...
International audienceWe propose a technique to describe properties of numerical stores with optiona...
The application field of static analysis techniques for objectoriented programming is getting broade...
AbstractIn 1997, Cousot introduced a hierarchy where semantics are related with each other by abstra...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
We propose an algorithm to over-approximate data dependencies with respect to abstract properties of...
Abstract interpretation is a systematic methodology to design static program analysis which has been...
International audienceArray bound checking and array dependency analysis (for parallelization) have ...
We introduce the operation of domain compression for complete refinements of finite abstract domains...
There are many applications where precise mode analysis is required. However, within the framework o...
Slicing analyses have been proposed for different programming languages. Rather than defining a new ...
In previous work we presented a model checking procedure for linear programs, i.e. programs in which...