Computing static slices using reduced graph

Sahoo, R (2014) Computing static slices using reduced graph. BTech thesis.



Presently there is a colossal interest of programming items for which numerous software are produced. Before launching software testing must be done. Anyhow after tasteful completing the testing procedure we can't ensure that a product item is mistake free and it is clear that not all the lines in the source code are answerable for the error at a specific point. We accordingly require not to take the entire source code in the testing procedure and just concentrate on those areas that are the cause of failure by then. So as to discover those high-chance territories we need to develop a intermediate representation that specifies conditions of a program exactly. From the graph we process the slices. slice is an independent piece of the system. Our program calculate the slices by not using the original graph but by using the reduced graph.

Item Type:Thesis (BTech)
Uncontrolled Keywords:Slice;graph;program;construct;reduce
Subjects:Engineering and Technology > Computer and Information Science
Divisions: Engineering and Technology > Department of Computer Science
ID Code:5771
Deposited By:Hemanta Biswal
Deposited On:01 Aug 2014 16:09
Last Modified:01 Aug 2014 16:09
Supervisor(s):Mohapatra, D P

Repository Staff Only: item control page