Defines heap graphs and presents a stricter heap separating points-to logic for verifying dynamic memory behavior in programs.
An Empirical Stud y of the Reliability of UNIX Utilities,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Stricter Heap Separating Points-To Logic
Defines heap graphs and presents a stricter heap separating points-to logic for verifying dynamic memory behavior in programs.