International audienceProgram analysis by abstract interpretation using relational abstract domains—like polyhedra or octagons—easily extends from state analysis (construction of reachable states) to relational analysis (construction of input-output relations). In this paper, we exploit this extension to enable interprocedural program analysis, by constructing relational summaries of procedures. In order to improve the accuracy of procedure summaries, we propose a method to refine them into disjunctions of relations, these disjunctions being directed by preconditions on input parameters
Within the context of a quantitative generalisation of the well established framework of Abstract In...
Interprocedural analysis concerns the static examination of a program that consists of multiple proc...
Formal concept analysis is a mathematical framework based on lattice theory that aims at representin...
International audienceStatic analyses aim at inferring semantic properties of programs. We distingui...
International audienceStatic analyses aim at inferring semantic properties of programs. While many a...
AbstractWe present a framework for program analysis of languages with procedures which is general en...
We present a framework for program analysis of languages with procedures which is general enough to ...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
International audienceWe present RAND, an input-output relational abstract domain that expresses rel...
International audienceAssociation criteria used for measuring the relationship between categorical v...
An analysis method for specialization of imperative programs is described in this paper. This anal-y...
Relational abstract domains are a cornerstone of static analysis for first-order programs. We explor...
We present RAND, a relational abstract domain that expresses relations between values of non-recursi...
AbstractWithin the context of a quantitative generalisation of the well established framework of Abs...
We extend the relational approach to interprocedural analysis of sequential programs to concurrent p...
Within the context of a quantitative generalisation of the well established framework of Abstract In...
Interprocedural analysis concerns the static examination of a program that consists of multiple proc...
Formal concept analysis is a mathematical framework based on lattice theory that aims at representin...
International audienceStatic analyses aim at inferring semantic properties of programs. We distingui...
International audienceStatic analyses aim at inferring semantic properties of programs. While many a...
AbstractWe present a framework for program analysis of languages with procedures which is general en...
We present a framework for program analysis of languages with procedures which is general enough to ...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
International audienceWe present RAND, an input-output relational abstract domain that expresses rel...
International audienceAssociation criteria used for measuring the relationship between categorical v...
An analysis method for specialization of imperative programs is described in this paper. This anal-y...
Relational abstract domains are a cornerstone of static analysis for first-order programs. We explor...
We present RAND, a relational abstract domain that expresses relations between values of non-recursi...
AbstractWithin the context of a quantitative generalisation of the well established framework of Abs...
We extend the relational approach to interprocedural analysis of sequential programs to concurrent p...
Within the context of a quantitative generalisation of the well established framework of Abstract In...
Interprocedural analysis concerns the static examination of a program that consists of multiple proc...
Formal concept analysis is a mathematical framework based on lattice theory that aims at representin...