Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such programs involves reasoning about unbounded sets of graphs. Three-valued shape analysis (Sagiv et. al.) is an approach based on explicit manipulation of 3-valued shape graphs, which abstract sets of pointer graphs. Other approaches use symbolic representations, e.g. by describing (sets of) graphs as logical formulas. Unfortunately, many resulting logics are either undecidable or cannot express crucial properties like reachability and separation. In this paper, we investigate an alternative approach. We study well-known description logics as a framework for symbolic...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...
Verification of programs requires reasoning about sets of program states. In case of programs manipu...
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data...
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. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Abstract — Despite their popularity and importance, pointerbased programs remain a major challenge f...
Abstract. Many software model checkers are based on predicate ab-straction. If the verification goal...
Graphs are an intuitive model for states of a (software) system that include pointer structures | fo...
Graphs are an intuitive model for states of a (software) system that involve dynamic resource alloca...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...
Verification of programs requires reasoning about sets of program states. In case of programs manipu...
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data...
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. The verification community has studied dynamic data struc-tures primarily in a bottom-up w...
International audienceThe computation of semantic information about the behavior of pointer-manipula...
Abstract — Despite their popularity and importance, pointerbased programs remain a major challenge f...
Abstract. Many software model checkers are based on predicate ab-straction. If the verification goal...
Graphs are an intuitive model for states of a (software) system that include pointer structures | fo...
Graphs are an intuitive model for states of a (software) system that involve dynamic resource alloca...
Abstract. Shape analysis aims to infer precise structural properties of imperative memory states and...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...