loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)
A Framework for Component Mining of Java Applications via Dynamic Slicing
Central Michigan University, Mount Pleasant, Michigan
August 11-August 13
ISBN: 0-7695-2297-1
Adam J. Conover, Towson University
Yeong-Tae Song, Towson University

Abstract: This paper explores the use of program slicing as a tool for "component mining" of Java" source code. We define component mining to be the extraction of an executable slice from source code, which satisfies a specific use case (or set of use cases) and provides a standard component interface for its use. However, before a component can be generated, the desired features themselves must be isolated from the source code. Traditionally, software slicing has concerned itself with the value of a variable of interest (or set of variables) at a specific point of execution. This severely limits the usefulness of the traditional definition of a slicing criterion as a tool for feature isolation. We propose the repurposing of software "unit-tests" to aid in the isolation of features of interest within source code. By executing a target application in our JPDA (Java Platform Debugging Architecture) based slicer, a selected unit-test may then serve as the slicing criterion.

Citation:
Adam J. Conover, Yeong-Tae Song, "A Framework for Component Mining of Java Applications via Dynamic Slicing," sera, pp.40-47, Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.