An approach to find dynamic slice for C++ Program

Uloženo v:

Podrobná bibliografie
Vydáno v:	arXiv.org (Jun 14, 2010), p. n/a
Hlavní autor:	Pani, Santosh Kumar
Další autoři:	Arundhati, Priya
Vydáno:	Cornell University Library, arXiv.org
Témata:	Object oriented programming Debugging Slicing Overloading Reusable components Dependence Object programs Criteria
On-line přístup:	Citation/Abstract Full text outside of ProQuest
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Abstrakt:	Object-oriented programming has been considered a most promising method in program development and maintenance. An important feature of object-oriented programs (OOPs) is their reusability which can be achieved through the inheritance of classes or reusable components.Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains only those statements that actually affect the variables in the slicing criterion. This paper proposes a method to dynamically slice object-oriented (00) programs based on dependence analysis. It uses the Control Dependency Graph for object program and other static information to reduce the information to be traced during program execution. In this paper we present a method to find the dynamic Slice of object oriented programs where we are finding the slices for object and in case of function overloading.
ISSN:	2331-8422
Zdroj:	Engineering Database