Pointer analysis of multithreaded Java programs - CORE CORE Search Search Services Access to raw data API Dataset FastSync Content discovery Recommender Discovery Managing content Repository dashboard Support FAQs About About CORE Blog Contact us Pointer analysis of multithreaded Java programs By MANGALA GOWRI NANDA and S RAMESH Cite BibTex Full citation No static citation data No static citation data Abstract 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.© AC Topics: Algorithms, Java Programming Language, Problem Solving, Context Free Languages Publisher: 'Association for Computing Machinery (ACM)' Year: 2003 DOI identifier: 10.1145/952532.952741 OAI identifier: oai:dsapce.library.iitb.ac.in:10054/1588 Provided by: Dspace at IIT Bombay Download PDF: Sorry, we are unable to provide the full text but you may find it at the following location(s): http://hdl.handle.net/10054/15... (external link) http://dspace.library.iitb.ac.... (external link) Suggested articles To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request. Useful links Blog Services About CORE Contact us Cookies Privacy notice Writing about CORE? Discover our research outputs and cite our work. CORE is a not-for-profit service delivered by the Open University and Jisc.
