Record Details

Pointer analysis of multithreaded Java programs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Pointer analysis of multithreaded Java programs
 
Creator NANDA, MANGALA GOWRI
RAMESH, S
 
Subject algorithms
java programming language
problem solving
context free languages
 
Description This paper presents a context-sensitive and path-sensitive, intra-thread and inter-thread solution to combined pointer analysis, escape analysis and data dependence analysis of multithreaded Java programs which uses a sparse representation. We build and maintain a complete Static Single Assignment (SSA) form even for fields variables. We show how to compute inter-thread dependencies for multithreaded programs with structured fork-join constructs, open-ended threads, recursively generated threads, monitors, and wait-notify synchronization. We have implemented our algorithm in a slicer for Java programs. Our experimental results show that a sparse representation improves the analysis time and strong updates on field variables improves the precision.
 
Publisher Association for Computing Machinery
 
Date 2009-07-03T06:19:16Z
2011-11-28T08:42:46Z
2011-12-15T09:57:43Z
2009-07-03T06:19:16Z
2011-11-28T08:42:46Z
2011-12-15T09:57:43Z
2003
 
Identifier Proceedings of the ACM Symposium on Applied Computing, Melbourne, Florida, USA, 9-12 March 2003, 1068-1075
1-58113-624-2
10.1145/952532.952741
http://hdl.handle.net/10054/1588
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1588
 
Language en