Conditioned Slicing of Interprocedural Programs

Program slicing is a technique to decompose programs depending on control flow and data flow amongst several lines of code in a program. Conditioned slicing is a generalization of static slicing and dynamic slicing. A variable, the desired program point, and a condition of interest form a slicing criterion for conditioned slicing. This paper proposes an approach to calculate conditioned slices for programs containing multiple procedures. The approach is termed Node-Marking Conditioned Slicing (NMCS) algorithm. In this approach, first and foremost step is to build an intermediate symbolization of a given program code and the next step is to develop an algorithm for finding out conditioned slices. The dependence graph, termed System Dependence Graph (SDG), is used to symbolize intermediate presentation. After constructing SDG, the NMCS algorithm chooses nodes that satisfy a given condition by the process of marking and unmarking. The algorithm also finds out conditioned slices for every variable at every statement during the process. NMCS algorithm employs a stack to save call context of a method. Few edges in SDG are labeled to identify the statement that calls a method. The proposed algorithm is implemented, and its performance is tested with several case study projects.

Slicing Object-Oriented Programs with Exception Handling Structures

Exception propagation affects the dependences of an Object-Oriented program, which must be taken into account when calculating program slicing; otherwise the result may be not precise. This paper proposes an approach to construct the extended interclass dependence graph and the Object-Oriented system dependence graph, which are able to represent the influence of exception propagation on the dependences of Object-Oriented programs precisely. In addition, the program slicing algorithm proposed by S. B. Horwitz has been extended, which is able to traverse both the extended interclass dependence graph and the Object-Oriented system dependence graph when calculating program slicing. Finally, we evaluate our approach with an experiment and compare it with other approaches. The result shows that our approach more precise.

GammaPolarSlicer

In software development, it is often desirable to reuse existing software components. This has been recognized since 1968, when Douglas Mcllroy of Bell Laboratories proposed basing the software industry on reuse. Despite the failures in practice, many efforts have been made to make this idea successful. In this context, we address the problem of reusing annotated components as a rigorous way of assuring the quality of the application under construction. We introduce the concept of caller-based slicing as a way to certify that the integration of an annotated component with a contract into a legacy system will preserve the behavior of the former. To complement the efforts done and the benefits of the slicing techniques, there is also a need to find an efficient way to visualize the annotated components and their slices. To take full profit of visualization, it is crucial to combine the visualization of the control/data flow with the textual representation of source code. To attain this objective, we extend the notion of System Dependence Graph and slicing criterion.

The Analyzing Technique of Program Based on Program Slicing

Program analysis plays an important role in software development and maintenance. With this method, characteristics of every variable in program can be analyzed. During the period of program analyzing, computing the program slicing by the method of constructing system dependence graph is an efficient way but the work of constructing the system dependence graph is very complicated which often leads to many wrong results. So the algorithm of hierarchy slice is used in this paper. Using the precise results, the whole program can be analyzed and the dependence relation in the program can be discovered quickly.