Abstract. We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard operational semantics which places certain restrictions on aliasing and sharing across modules. More specifically, we assume that live references (i.e., used before set) between subheaps manipulated by different modules interpretation of our non-standard semantics. Our modular algorithm also ensures that the program obeys the above mentioned restrictions.
Modeling the evolution of the state of program memory during program execution is critical to many p...
The program heap is fundamentally a simple mathematical concept --- a set of objects and a connectiv...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
The aim of static analysis is to infer invariants about programs that are precise enough to establis...
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration ...
Abstract. We propose a hierarchical shape abstract domain, so as to infer structural invariants of d...
Abstract. This paper introduces a new hybrid memory analysis, Structural Anal-ysis, which combines a...
International audienceWe propose a hierarchical shape abstract domain, so as to infer structural inv...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
Abstract. Modeling the evolution of the state of program memory during program execution is critical...
Modular analyses of software systems rely on the specifications of the analyzed mod-ules. In many an...
International audienceTo understand and detect possible errors in programs manipulating memory, stat...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
This paper demonstrates shape analyses that can achieve a state space reduction exponential in the n...
Modeling the evolution of the state of program memory during program execution is critical to many p...
The program heap is fundamentally a simple mathematical concept --- a set of objects and a connectiv...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
The aim of static analysis is to infer invariants about programs that are precise enough to establis...
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration ...
Abstract. We propose a hierarchical shape abstract domain, so as to infer structural invariants of d...
Abstract. This paper introduces a new hybrid memory analysis, Structural Anal-ysis, which combines a...
International audienceWe propose a hierarchical shape abstract domain, so as to infer structural inv...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
Abstract. Modeling the evolution of the state of program memory during program execution is critical...
Modular analyses of software systems rely on the specifications of the analyzed mod-ules. In many an...
International audienceTo understand and detect possible errors in programs manipulating memory, stat...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
This paper demonstrates shape analyses that can achieve a state space reduction exponential in the n...
Modeling the evolution of the state of program memory during program execution is critical to many p...
The program heap is fundamentally a simple mathematical concept --- a set of objects and a connectiv...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...