Computing Static Slice For Java Programs

Software development is becoming more and more sophisticated due to increasedcomplexity of software composition. This pauses increased possibilities of software bugsand crashes therefore the continuous development of tools to handle the risks.This dissertation presents an efficient way of accurately computing a static slice of Javaprograms using Java system dependence graph which extends previous dependence basedrepresentations to represent various types of program dependences in Java software.Slicing is an analysis technique that reduces programs to those statements that arerelevant for a particular computation.Java is an Object oriented language designed with many features such as inheritance,polymorphism, and dynamic binding which must be represented in order to accuratelydetermine a precise slice for any Java program.A modified algorithm here will be discussed which improves the preciseness of the slicesobtained especially those from a Java program. A Java slicing Analysis toolkit isproposed to illustrate the modified algorithm.