We present a framework for interprocedural shape analysis, which is context-and flow-sensitive with the ability to perform destructive pointer updates. We limit our attention to cutpoint-free programs—programs in which reasoning on a proce-dure call only requires consideration of context reachable from the actual param-eters. For such programs, we show that our framework is able to perform an effi-cient modular analysis. Technically, our analysis computes procedure summaries as transformers from inputs to outputs while ignoring parts of the heap not rele-vant to the procedure. This makes the analysis modular in the heap and thus allows reusing the effect of a procedure at different call-sites and even between different contexts occurring at...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration ...
In this paper we propose an efficient and effective algorithm to perform flow-insensitive interproce...
This paper addresses the verification of properties of imperative programs with recursive procedure...
Abstract. The performance of heap analysis techniques has a significant impact on their utility in o...
Abstract. This paper addresses the verification of properties of imperative programs with recursive ...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
Abstract. The performance of heap analysis techniques has a significant impact on their utility in a...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap...
Interprocedural program analysis is often performed by computing procedure summaries. While possible...
Aliasing information in the presence of pointers is needed in order to expose unexploited parallelis...
This dissertation addresses the scalability problem of context-sensitive pointer analysis based on A...
International audienceInterprocedural program analysis is often performed by computing procedure sum...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration ...
In this paper we propose an efficient and effective algorithm to perform flow-insensitive interproce...
This paper addresses the verification of properties of imperative programs with recursive procedure...
Abstract. The performance of heap analysis techniques has a significant impact on their utility in o...
Abstract. This paper addresses the verification of properties of imperative programs with recursive ...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
Abstract. The performance of heap analysis techniques has a significant impact on their utility in a...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap...
Interprocedural program analysis is often performed by computing procedure summaries. While possible...
Aliasing information in the presence of pointers is needed in order to expose unexploited parallelis...
This dissertation addresses the scalability problem of context-sensitive pointer analysis based on A...
International audienceInterprocedural program analysis is often performed by computing procedure sum...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration ...
In this paper we propose an efficient and effective algorithm to perform flow-insensitive interproce...