By Topic

Forward dynamic object-oriented program slicing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yeong-Tae Song ; Comput. Sci. Program, Texas Univ., Richardson, TX, USA ; D. T. Huynh

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. We propose an algorithm to decompose OOPs with respect to some variables or objects of interest using the forward dynamic slicing technique. The algorithm recursively decomposes constructors and member functions with respect to the specified variables in a slicing criterion. It is an extension of the interprocedural program slicing algorithm by Song and Huynh (1998) which is based on the forward slicing technique by Korel and Yalamanchili (1994). The algorithm analyzes message passings and parameter passings and constructs dynamic object relationship diagrams (DORD). As results, the algorithm produces not only the statement level slice (called traditional slice), but also the DORD that shows the relationships among the objects with respect to the specified variables in a slicing criterion

Published in:

Application-Specific Systems and Software Engineering and Technology, 1999. ASSET '99. Proceedings. 1999 IEEE Symposium on

Date of Conference: