¹Professor, Department of Mathematics in SBM College of Engineering and Technology, Dindigul, Tamil Nadu (INDIA)
²Department of Mathematics in SBM College of Engineering and Technology, Dindigul, Tamil Nadu (INDIA)
³R&D, Advisor in Rajalakshmi Engineering College, Affiliated to Anna University Chennai, Tamil Nadu (INDIA)

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

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.