33 citations · 36 across the 2 of their papers we have counts for
2 papers
cs.LO2007★ 3 cited
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
Ahmed Bouajjani, Antoine Meyer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr…
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…