33 citations · 47 across the 2 of their papers we have counts for
2 papers
cs.LO2007★ 33 cited
A Logic of Reachable Patterns in Linked Data-Structures
Greta Yorsh, Alexander Rabinovich, Mooly Sagiv +2
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The m…
cs.LO2003★ 14 cited
Logical Characterizations of Heap Abstractions
G. Yorsh, T. Reps, M. Sagiv +1
Shape analysis concerns the problem of determining "shape invariants" for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown…