Soot-based implementation of a demand-driven reaching definitions analysis

Longwen Lu, Cheng Zhang, Jianjun Zhao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

As a classical data-flow analysis, reaching definitions analysis is the corner stone of various techniques, such as code optimization and program slicing. The built-in data-flow analysis framework in Soot has been implemented in the traditional iterative style. While being able to meet general requirements for implementation of data flow analyses, the framework may be less efficient for a certain type of analyses in which the complete data-flow solution is unnecessary. In this paper, we introduce our Soot-based implementation of an inter-procedural demand-driven reaching definitions analysis. For a demand for reaching definitions facts, the analysis only explores relevant program points and variables, saving a considerable amount of computation. Preliminary results show that the implementation can be much more efficient than its traditional counterpart in several scenarios. The Soot framework has greatly facilitated the implementation by providing abundant basic analysis results via well designed APIs.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGPLAN International Workshop on State of the Art in Java Program Analysis, SOAP 2012
Pages21-26
Number of pages6
DOIs
Publication statusPublished - Jul 9 2012
Externally publishedYes
EventACM SIGPLAN International Workshop on State of the Art in Java Program Analysis, SOAP 2012 - Beijing, China
Duration: Jun 14 2012Jun 14 2012

Other

OtherACM SIGPLAN International Workshop on State of the Art in Java Program Analysis, SOAP 2012
Country/TerritoryChina
CityBeijing
Period6/14/126/14/12

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Soot-based implementation of a demand-driven reaching definitions analysis'. Together they form a unique fingerprint.

Cite this