Program Slicing for Composite Data using Finite State Machine

AUTHOR AND
AFFILIATION

K. THIAGARAJAN1, J.KAVITHA2 and PONNAMMAL NATARAJAN3
1Professor, Department of Mathematics in SBM College of Engineering and Technology, Dindigul, Tamil Nadu (INDIA)
2Department of Mathematics in SBM College of Engineering and Technology, Dindigul, Tamil Nadu (INDIA)
3R&D, Advisor in Rajalakshmi Engineering College, Affiliated to Anna University Chennai, Tamil Nadu (INDIA)

email : vidhyamannan@yahoo.comEmail: manokavi.j@gmail.com

KEYWORDS:

Slicing, Slice, Program Dependence Graph, Finite automata, Finite State Machine

Issue Date:

August 2014

Pages:

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.26 – No.2

PDF

Click Here Download PDF

DOI:

jusps-A

ABSTRACT:

In the software development life cycle, the identification of errors/bugs plays an important role, as the end product should be bug free. This can be achieved through the concept of program slicing. Generally, program slice has a wider spectrum of applications that includedebugging, testing, maintenance, code understanding, complexity measurement, security etc., There are two different categories of program slicing namely, static slicing and dynamic slicing which can be identified using connected graph and its structural arrangements. Existing slicing techniques were implemented over intra procedural non composite data [only which doesn’t include arrays, structure, union etc,]. In the proposed work static program slicing concepts is applied over array of elements using finite state machine (FSM) method. Here, backward slicing techniques are applied to get quality output.

Copy the following to cite this Article:

K. THIAGARAJAN1, J.KAVITHA2 and PONNAMMAL NATARAJAN3, “Program Slicing for Composite Data using Finite State Machine”, Journal of Ultra Scientist of Physical Sciences, Volume 26, Issue 2, Page Number , 2016


Copy the following to cite this URL:

K. THIAGARAJAN1, J.KAVITHA2 and PONNAMMAL NATARAJAN3, “Program Slicing for Composite Data using Finite State Machine”, Journal of Ultra Scientist of Physical Sciences, Volume 26, Issue 2, Page Number , 2016

Available from: http://www.ultrascientist.org/paper/390/


In the software development life cycle, the identification of errors/bugs plays an important role, as the end product should be bug free. This can be achieved through the concept of program slicing. Generally, program slice has a wider spectrum of applications that includedebugging, testing, maintenance, code understanding, complexity measurement, security etc., There are two different categories of program slicing namely, static slicing and dynamic slicing which can be identified using connected graph and its structural arrangements. Existing slicing techniques were implemented over intra procedural non composite data [only which doesn’t include arrays, structure, union etc,]. In the proposed work static program slicing concepts is applied over array of elements using finite state machine (FSM) method. Here, backward slicing techniques are applied to get quality output.