|
Summary: Symbolic Heap Abstraction with Demand-
Driven Axiomatization of Memory Invariants
Isil Dillig
Department of Computer Science
Stanford University
isil@cs.stanford.edu
Thomas Dillig
Department of Computer Science
Stanford University
tdillig@cs.stanford.edu
Alex Aiken
Department of Computer Science
Stanford University
aiken@cs.stanford.edu
Abstract
Many relational static analysis techniques for precise rea-
soning about heap contents perform an explicit case analy-
sis of all possible heaps that can arise. We argue that such
precise relational reasoning can be obtained in a more scal-
able and economical way by enforcing the memory invari-
|
