The Analyzing Technique of Program Based on Program Slicing

2010 ◽  
Vol 108-111 ◽  
pp. 856-859
Author(s):  
Shu Kun Liu ◽  
Xiao Hua Yang
Keyword(s):  
Software Development ◽  
Program Analysis ◽  
Program Slicing ◽  
Dependence Graph ◽  
Dependence Relation ◽  
System Dependence Graph

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.

Slicing Object-Oriented Programs with Exception Handling Structures

2012 ◽  
Vol 462 ◽  
pp. 383-391
Author(s):  
Xue Feng Zhao ◽  
Shu Juan Jiang ◽  
Qi Zhou
Keyword(s):  
Object Oriented ◽  
Program Slicing ◽  
Exception Handling ◽  
Dependence Graph ◽  
System Dependence Graph ◽  
Oriented System

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.

scholarly journals Conditioned Slicing of Interprocedural Programs

2019 ◽  
Vol 6 (1) ◽  
pp. 43-60
Author(s):  
Madhusmita Sahu
Keyword(s):  
Data Flow ◽  
Program Slicing ◽  
Control Flow ◽  
Dependence Graph ◽  
Program Code ◽  
Dynamic Slicing ◽  
System Dependence Graph ◽  
Program Point

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.

The Multi-Slice Method of Program Slicing for Fault Location

2014 ◽  
Vol 971-973 ◽  
pp. 1808-1811
Author(s):  
Kun Liang Zhang ◽  
Xiu Ying Peng ◽  
Hao Hua Li
Keyword(s):  
Program Analysis ◽  
Fault Location ◽  
Fault Localization ◽  
Program Slicing ◽  
Localization Method ◽  
Advantages And Disadvantages ◽  
Dynamic Slicing ◽  
Full Analysis ◽  
Software Fault ◽  
Slice Method

Program slicing is a program analysis and understanding of technology. Sequence fault localization refers to the use of specific methods for faults in the program. Currently, the research program fault positioning is more and more people's attention and gets some results which is the more mainstream software fault localization method. Program slicing technique currently used to locate the fault procedures, which primarily to take advantage of dynamic slicing technique. Based on the full analysis of the advantages and disadvantages on the basis of previous work, we propose a flexible slicing rule and give a new method based on the slicing rule.

Program Slicing Technique in Programming Assessment

2012 ◽  
Vol 263-266 ◽  
pp. 1884-1887
Author(s):  
Hong Jun Tang
Keyword(s):  
Programming Language ◽  
Large Scale ◽  
Computer Programming ◽  
Program Slicing ◽  
Great Difficulty ◽  
Assessment Method ◽  
Dependence Graph ◽  
Program Dependence Graph ◽  
Student Program ◽  
Program Dependence

For the teachers of teaching basic computer programming language, a very large number of student programs should be graded and human graders have great difficulty in judging the correctness and efficiency of programs. A programming assessment method is proposed based on program slicing technique and the method has reduced the complexity in the assessment of large-scale program by decomposing program. The method divides the program into several slices by generating program dependence graph and on those slices we can get the score of the student program by comparing the student program with the template program. The method has successfully improved the grading process and it is also employed for the undergraduate courses.

Sign in / Sign up

Export Citation Format

Share Document