High-level real-time programming in Java
David F. Bacon, Perry Cheng, et al.
EMSOFT 2005
This paper describes an empirical comparison of the effectiveness of six context-insensitive pointer analysis algorithms that use varying degrees of flow-sensitivity. Four of the algorithms are flow-insensitive, one is flow-sensitive, and another is flow-insensitive, but uses precomputed flow-sensitive information. The effectiveness of each analysis is quantified in terms of compile-time efficiency and precision. Efficiency is reported by measuring CPU time and memory consumption of each analysis. Precision is reported by measuring the computed solutions at the program points where a pointer is dereferenced. The results of this paper will help implementors determine which pointer analysis is appropriate for their application.
David F. Bacon, Perry Cheng, et al.
EMSOFT 2005
Bor-Ming Hsieh, Michael Hind, et al.
ACM/IEEE SC 1992
Matthew Arnold, Michael Hind, et al.
ACM SIGPLAN Notices
Bowen Alpern, Steven Augart, et al.
IBM Systems Journal