Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternative paths through a basic inductive skeleton (e.g., back pointers, head pointers). From the static analysis point of view, we must obtain several interlocking shape invariants. At the same time, it is well understood in abstract interpretation design that supporting a separation of concerns is critically important to de-signing powerful static analyses. Such a separation of concerns is often obtained via a reduced product on a case-by-case basis. In this paper, we lift this idea to abstract domains for shape analyses, introducing a domain combination operator for memory abstractions. As an example, we present simultaneous separating shape gra...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
We present a shape analysis for programs that manipulate overlaid data structures which share sets o...
We present a shape analysis for programs that manipulate overlaid data structures which share sets o...
International audienceReal-world data structures are often enhanced with additional pointers capturi...
International audienceThe breadth and depth of heap properties that can be inferred by theunion of t...
Abstract. The breadth and depth of heap properties that can be inferred by the union of today’s shap...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
International audienceStatic analyses aim at inferring semantic properties of programs. While many a...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate...
International audienceStatic analyses aim at inferring semantic properties of programs. We distingui...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
We present a shape analysis for programs that manipulate overlaid data structures which share sets o...
We present a shape analysis for programs that manipulate overlaid data structures which share sets o...
International audienceReal-world data structures are often enhanced with additional pointers capturi...
International audienceThe breadth and depth of heap properties that can be inferred by theunion of t...
Abstract. The breadth and depth of heap properties that can be inferred by the union of today’s shap...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
International audienceStatic analyses aim at inferring semantic properties of programs. While many a...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate...
International audienceStatic analyses aim at inferring semantic properties of programs. We distingui...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
We present a shape analysis for programs that manipulate overlaid data structures which share sets o...
We present a shape analysis for programs that manipulate overlaid data structures which share sets o...