Demand-driven pointer analysis
Published • May 1, 2001
NobleIDNI1P38W02R58S57
Authors:,
Nevin Heintze
Olivier Tardieu
Abstract
Known algorithms for pointer analysis are “global” in the sense that they perform an exhaustive analysis of a program or program component. In this paper we introduce a demand-driven approach for pointer analysis. Specifically, we describe a demand-driven flow-insensitive, subset-based, con text-ins...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!