Abstract. The verification community has studied dynamic data struc-tures primarily in a bottom-up way by analyzing pointers and the shapes induced by them. Recent work in fields such as separation logic has made significant progress in extracting shapes from program source code. Many real world programs however manipulate complex data whose structure and content is most naturally described by formalisms from object ori-ented programming and databases. In this paper, we attempt to bridge the conceptual gap between these two communities. Our approach is based on Description Logics (DLs), a widely used knowledge represen-tation paradigm which gives a logical underpinning for diverse modeling frameworks such as UML and ER. We show how DLs can ...
AbstractDespite their popularity and importance, pointer-based programs remain a major challenge for...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algori...
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...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract — Despite their popularity and importance, pointerbased programs remain a major challenge f...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
Abstract. We introduce an extension ALCQIOb,Re of the description logic ALCQIO, a sub-logic of the t...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...
© Springer Nature Switzerland AG 2018. Knowing the shapes of dynamic data structures is key when for...
One of the main challenges in the verification of software systems is the analysis of unbounded data...
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algori...
AbstractDespite their popularity and importance, pointer-based programs remain a major challenge for...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algori...
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...
Verification of programs requires reasoning about sets of program states. In case of programs manip...
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate...
Shape analysis is a static analysis of the source code of a program to determine shapes and manipula...
Abstract — Despite their popularity and importance, pointerbased programs remain a major challenge f...
International audienceTraditional separation logic-based shape analyses utilize in-ductive summarizi...
Abstract. We introduce an extension ALCQIOb,Re of the description logic ALCQIO, a sub-logic of the t...
Abstract. Real-world data structures are often enhanced with addi-tional pointers capturing alternat...
© Springer Nature Switzerland AG 2018. Knowing the shapes of dynamic data structures is key when for...
One of the main challenges in the verification of software systems is the analysis of unbounded data...
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algori...
AbstractDespite their popularity and importance, pointer-based programs remain a major challenge for...
O’Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using sepa...
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algori...