• Home
  • Search
  • Pointer analysis of multithreaded Java programs
  • Cite Icon14
  • https://doi.org/10.1145/952532.952741Copy DOI Icon

Pointer analysis of multithreaded Java programs

  • Mar 9, 2003
  • Mangala Gowri Nanda +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.

Similar Papers
  • Conference Article
  • Citations1

Recovering the Memory Behavior of Executable Programs

  • Jul 15, 2010
  • Alain Ketterlin +1
  • Conference Article
  • Citations153

Array SSA form and its use in parallelization

  • Jan 01, 1998
  • Kathleen Knobe +1
  • Research Article
  • Citations10

More precise construction of static single assignment programs using reaching definitions

  • Apr 06, 2020
  • Journal of Systems and Software
  • Abu Naser Masud +1
  • Research Article
  • Citations28

Optimal register sharing for high-level synthesis of SSA form programs

  • May 01, 2006
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • P Brisk +3
  • Research Article
  • Citations4

Studying Optimal Spilling in the Light of SSA

  • Jan 09, 2015
  • ACM Transactions on Architecture and Code Optimization
  • Quentin Colombet +2
  • Book Chapter
  • Citations20

Verifying Fast and Sparse SSA-Based Optimizations in Coq

  • Jan 01, 2015
  • Delphine Demange +2
  • Research Article
  • Citations1

An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form

  • Jul 01, 2010
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Philip Brisk +2
  • Book Chapter
  • Citations2

Accurate Data and Context Management in Message-Passing Programs

  • Jan 01, 2000
  • Dhruva R Chakrabarti +1
  • Research Article
  • Citations145

Beyond induction variables

  • Jan 01, 1995
  • ACM Transactions on Programming Languages and Systems
  • Michael P Gerlek +2
  • Research Article
  • Citations13

Dead code elimination based pointer analysis for multithreaded programs

  • Feb 01, 2012
  • Journal of the Egyptian Mathematical Society
  • Mohamed A El-Zawawy
  • Conference Article
  • Citations30

EnforceMOP: a runtime property enforcement system for multithreaded programs

  • Jul 15, 2013
  • Qingzhou Luo +1
  • Conference Article
  • Citations5

<u>T</u>i<u>d</u>d<u>l</u>e

  • Jul 20, 2009
  • Caitlin Sadowski +1
  • Research Article
  • Citations68

Types for atomicity

  • Jul 01, 2008
  • ACM Transactions on Programming Languages and Systems
  • Cormac Flanagan +3
  • Research Article
  • Citations20

Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL

  • Nov 25, 2005
  • Electronic Notes in Theoretical Computer Science
  • Jan Olaf Blech +3
  • Research Article
  • Citations23

Summarizing procedures in concurrent programs

  • Jan 01, 2004
  • ACM SIGPLAN Notices
  • Shaz Qadeer +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.