Lilia Georgieva

Learn More
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(More)
The guarded fragment and its extensions and subfragments are often considered as a framework for investigating the properties of description logics. There are also other, some less well-known, decidable fragments of first-order logic which all have in common that they generalise the standard translation of ALC to first-order logic. We provide a short survey(More)
This paper describes a number of hyperresolution-based decision procedures for a subfragment of the guarded fragment. We first present a polynomial space decision procedure of optimal worst-case space and time complexity for the fragment under consideration. We then consider minimal model generation procedures which construct all and only minimal Herbrand(More)
The guarded fragment [1] and its extensions and subfragments have often been considered as a framework for investigating the properties of description logics [8, 18]. But there are other decidable fragments which all have in common that they generalise the standard translation of ALC to first-order logic. We provide a short survey of some of these fragments(More)
We investigate description logics as a framework for symbolic shape analysis. We propose a predicate abstraction based shape analysis, parameterized by a DL to represent the abstraction predicates. Depending on the chosen logic, sharing, reachability and separation in pointer data structures are expressible. Our work follows the trend in symbolic shape(More)