282 search results - page 1 / 57 » Description Logics for Shape Analysis |
SEFM
2005
IEEE
13 years 10 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
POPL
1999
ACM
13 years 8 months ago
1999
ACM
hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
SAS
2007
Springer
13 years 10 months ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of ...
CAIP
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. A simple scheme is presented for modifying geometric moments to use geodesic distances. This provides a set of global shape descriptors that are invariant to bending as w...