Record Details

A Static Slicing Tool for Sequential Java Programs

Electronic Theses of Indian Institute of Science

View Archive Info
 
 
Field Value
 
Title A Static Slicing Tool for Sequential Java Programs
 
Creator Devaraj, Arvind
 
Subject Java
Computer Program Slicing
Java Programs
Points-To-Analysis
Program Dependence Graph (PDG)
System Dependence Graph (SDG)
Andersen's Algorithm
Soot - Java
Computer Science
 
Description A program slice consists of a subset of the statements of a program that can potentially affect values computed at some point of interest. Such a point of interest along with a set of variables is called a slicing criterion. Slicing tools are useful for several applications, such as program understanding, testing, program integration, and so forth. Slicing object oriented programs has some special problems that need to be addressed due to features like inheritance, polymorphism and dynamic binding. Alias analysis is important for precision of slices. In this thesis we implement a slicing tool for sequential Java programs in the Soot framework. Soot is a front-end for Java developed at McGill University and it provides several forms of intermediate code. We have integrated the slicer into the framework. We also propose an improved technique for intraprocedural points-to analysis. We have implemented this technique and compare the results of the analysis with those for a flow-insensitive scheme in Soot. Performance results of the slicer are reported for several benchmarks.
 
Contributor Shankar, Priti
 
Date 2018-07-28T09:16:15Z
2018-07-28T09:16:15Z
2018-07-28
2007
 
Type Thesis
 
Identifier http://etd.iisc.ernet.in/2005/3891
http://etd.iisc.ernet.in/abstracts/4765/G21067-Abs.pdf
 
Language en_US
 
Relation G21067