Scalable flow-sensitive pointer analysis for fava with strong updates

De, Arnab and D’Souza, Deepak (2012) Scalable flow-sensitive pointer analysis for fava with strong updates. In: Proceedings of 26th European Conference, June 11-16, 2012, Beijing, China.

PDF Euro_Conf_7313_665_2012.pdf - Published Version Restricted to Registered users only Download (553kB) | Request a copy

Abstract

The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-based pointers effectively. Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. We have implemented our analysis and run it on several large Java benchmarks. The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time.

Item Type:	Conference Paper
Publisher:	Springer Berlin Heidelberg
Additional Information:	Copyright of this article belongs to Springer Berlin Heidelberg.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	05 Nov 2013 07:38
Last Modified:	05 Nov 2013 07:38
URI:	http://eprints.iisc.ac.in/id/eprint/47707

Actions (login required)

View Item