Thomas Eisenbarth, Rainer Koschke, and Daniel Simon. Derivation of Feature-Component Maps by Means of Concept Analysis. In Pedro Susa and Jurgen Ebert, editors, Proceedings of the Fifth European Conference on Software Maintenance and Reengineering, pages 176--179, Lisbon, Portugal, March 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Concern Graphs: Finding and Describing Concerns - Robillard, Murphy (2002) (2 citations) (Correct)
....through a non concern element. These last two approaches for finding concerns use static program information. Other approaches use information about a program s execution. Wilde et al. 27] used carefully designed test cases to locate user functionality in legacy FORTRAN code. Eisenbarth et al. [11] propose to use dynamic information to derive mappings between features and components using concept analysis. Currently, neither Concern Graphs nor the program model from which a Concern Graph is extracted contain information from the program s execution. Dynamic program information could help ....
T. Eisenbarth, R. Koschke, and D. Simon. Derivation of feature component maps by means of concept analysis. In Proceedings of the Fifth European Conference on Software Maintenance and Reengineering, pages 176--179. IEEE Computer Society, March 2001.
Guiding Feature Asset Mining for Software Product Line.. - Eisenbarth, Simon Self-citation (Eisenbarth Simon) (Correct)
No context found.
Thomas Eisenbarth, Rainer Koschke, and Daniel Simon. Derivation of Feature-Component Maps by Means of Concept Analysis. In Pedro Susa and Jurgen Ebert, editors, Proceedings of the Fifth European Conference on Software Maintenance and Reengineering, pages 176--179, Lisbon, Portugal, March 2001.
Locating Features in Source Code - Eisenbarth, Koschke, Simon (2003) (2 citations) Self-citation (Eisenbarth Koschke Simon) (Correct)
....units (summarized in Fig. 1) and explains what kind of dynamic information is used as input to our technique. The section also introduces a simple example that we will use throughout the description of the method in the following sections. The example is inspired by a previous case study [3] in which we analyzed the drawing tool XFIG [4] Computational unit . A computational unit is an executable part of a system. Examples for computational units are instructions (like accesses to global variables) basic blocks, routines, classes, compilation units, components, modules, or ....
Thomas Eisenbarth, Rainer Koschke, and Daniel Simon, \Derivation of Feature-Component Maps by Means of Concept Analysis," in Proceedings of the 5th European Conference on Software Maintenance and Reengineering, Lisbon, Portugal, Mar. 2001, pp. 176-179, IEEE Computer Society Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC