International audienceStatic analyses aim at inferring semantic properties of programs. While many analyses compute an over-approximation of reachable states, some analyses compute a description of the input-output relations of programs. In the case of numeric programs, several analyses have been proposed that utilize relational numerical abstract domains to describe relations. On the other hand, designing abstractions for relations over memory states and taking shapes into account is challenging. In this paper, we propose a set of novel logical connectives to describe such relations, which are inspired by separation logic. This logic can express that certain memory areas are unchanged, freshly allocated, or freed, or that only part of the ...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
International audienceStatic analyses aim at inferring semantic properties of programs. While many a...
International audienceStatic analyses aim at inferring semantic properties of programs. We distingui...
Static analyses aim at inferring semantic properties of programs. We distinguish two important class...
Les analyses statiques ont pour but d’inférer des propriétés sémantiques de programmes. Nous disting...
We present RAND, a relational abstract domain that expresses relations between values of non-recursi...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
International audienceReal-world data structures are often enhanced with additional pointers capturi...
International audienceProgram analysis by abstract interpretation using relational abstract domains—...
In contrast to the classical cache analysis of Ferdinand, the relational cache analysis does not rel...
Relational abstract domains are a cornerstone of static analysis for first-order programs. We explor...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
International audienceIn this document, we use the Abstract Interpretation framework to analyze conc...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
International audienceStatic analyses aim at inferring semantic properties of programs. While many a...
International audienceStatic analyses aim at inferring semantic properties of programs. We distingui...
Static analyses aim at inferring semantic properties of programs. We distinguish two important class...
Les analyses statiques ont pour but d’inférer des propriétés sémantiques de programmes. Nous disting...
We present RAND, a relational abstract domain that expresses relations between values of non-recursi...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
International audienceReal-world data structures are often enhanced with additional pointers capturi...
International audienceProgram analysis by abstract interpretation using relational abstract domains—...
In contrast to the classical cache analysis of Ferdinand, the relational cache analysis does not rel...
Relational abstract domains are a cornerstone of static analysis for first-order programs. We explor...
International audienceThe aim of static analysis is to infer invariants about programs that are tigh...
International audienceIn this document, we use the Abstract Interpretation framework to analyze conc...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...