Shape analysis is a static analysis of the source code of a program to determine shapes and manipulations of the dynamically allocated data structures at each point which that program can reach in an execution. In this report, we give a detailed presentation and soundness proof of a shape analysis method which uses separation logic to represent program memory.nrpages: 35status: publishe
International audienceTo understand and detect possible errors in programs manipulating memory, stat...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
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...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
Abstract. Existing shape analysis algorithms infer descriptions of data structures at program points...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static ...
Shape analysis is a program analysis technique used to prove thatimperative programs using manual me...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
International audienceTo understand and detect possible errors in programs manipulating memory, stat...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
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...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap...
Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
Abstract. Existing shape analysis algorithms infer descriptions of data structures at program points...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static ...
Shape analysis is a program analysis technique used to prove thatimperative programs using manual me...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
International audienceTo understand and detect possible errors in programs manipulating memory, stat...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
International audienceShape analyses aim at inferring semantic invariants related to the data-struct...
Add to ORKG