Early field experience with the Software Reconnaissance technique for program comprehension

Wilde, Norman; Casey, C. Jasson

doi:10.1109/wcre.1996.558934

Cited by 23 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the comparison, a simple heuristic is used. The heuristic assigns those parts of the code to a feature which are only used in runs that use the feature [14]. There exist also more advanced heuristics, which consider cases where code is shared among several features or is not always used when the feature under analysis is used, resulting in more fine grained categorizations [15].…”

Section: Related Workmentioning

confidence: 99%

A Simulation-Based Approach for Automated Feature Localization

Malburg

Finder²,

Fey

2014

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

The complexity of modern chips is rapidly increasing. To fulfill tight time-to-market constraints, more and more blocks from previous designs are reused or third party IP blocks are licensed. However, such blocks are often only poorly documented making adjustments to the blocks a difficult task. This paper presents a technique for automatic feature localization for hardware designs. Our approach helps a developer in understanding a design by localizing parts of the code which implement a certain feature of interest. We evaluate the approach on three open source designs. For those designs, our approach yields a more precise localization of the code implementing the different features than the documentation of the design.

show abstract

Section: Related Workmentioning

confidence: 99%

A Simulation-Based Approach for Automated Feature Localization

Malburg

Finder²,

Fey

2014

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

show abstract

“…There have been several published case studies that apply such dynamic analysis techniques to different programs (Wilde and Casey, 1996;Agrawal et al, 1998;Wong et al, 1999b;Wilde et al, 2001) and several tools are available (Wilde, 2003;Telecordia Technologies, Inc., 2003). The general consensus seems to be that such techniques are effective in focusing on a relatively small fraction of the code that needs to be examined to understand the feature.…”

Section: The Feature Location Problem In Sequential Systemsmentioning

confidence: 99%

An approach to feature location in distributed systems

Edwards

Simmons

Wilde

2006

Journal of Systems and Software

View full text Add to dashboard Cite

“…Several studies (such as (Wilde and Casey, 1996;Wilde and Scully, 1995;Wong et al, 1999)) discuss techniques for finding code that is uniquely related to a given feature. The code so identified provides an excellent starting point for program understanding, but it is not sufficient for computing the distance between two features.…”

Section: Representation Of a Program Feature Using A Set Of Basic Blocksmentioning

confidence: 99%

“…Some focus on qualitative descriptions, while others provide quantitative measurements. Several execution slice-based heuristics have been proposed (Wilde and Casey, 1996;Wilde et al, 1992;Wilde and Scully, 1995;Wong et al, 1999) to identify code that is uniquely related to a given feature or shared by different features. Other heuristics, based on the static and dynamic slices, were also used to help programmers locate the implementation of each feature in a software system (Ball, 1996;Korel and Laski, 1998;Korel and Rilling, 1997;Malony et al, 1991;Weiser, 1984).…”

Section: Introductionmentioning

confidence: 99%