The search functionality is under construction.
IEICE TRANSACTIONS on Information
Open Access
Locating Concepts on Use Case Steps in Source Code
-
Full Text Views
107
- Cite this
- Free PDF (1.4MB)
Summary :
Use case descriptions describe features consisting of multiple concepts with following a procedural flow. Because existing feature location techniques lack a relation between concepts in such features, it is difficult to identify the concepts in the source code with high accuracy. This paper presents a technique to locate concepts in a feature described in a use case description consisting of multiple use case steps using dependency between them. We regard each use case step as a description of a concept and apply an existing concept location technique to the descriptions of concepts and obtain lists of modules. Also, three types of dependencies: time, call, and data dependencies among use case steps are extracted based on their textual description. Modules in the obtained lists failing to match the dependency between concepts are filtered out. Thus, we can obtain more precise lists of modules. We have applied our technique to use case descriptions in a benchmark. Results show that our technique outperformed baseline setting without applying the filtering.
- Publication
- IEICE TRANSACTIONS on Information Vol.E107-D No.5 pp.602-612
- Publication Date
- 2024/05/01
- Publicized
- 2023/12/20
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2023KBP0004
- Type of Manuscript
- Special Section PAPER (Special Section on Knowledge-Based Software Engineering)
- Category
Authors
Shinpei HAYASHI
Tokyo Institute of Technology
Teppei KATO
Tokyo Institute of Technology
Motoshi SAEKI
Nanzan University
Keyword
Latest Issue
Contents
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shinpei HAYASHI, Teppei KATO, Motoshi SAEKI, "Locating Concepts on Use Case Steps in Source Code" in IEICE TRANSACTIONS on Information,
vol. E107-D, no. 5, pp. 602-612, May 2024, doi: 10.1587/transinf.2023KBP0004.
Abstract: Use case descriptions describe features consisting of multiple concepts with following a procedural flow. Because existing feature location techniques lack a relation between concepts in such features, it is difficult to identify the concepts in the source code with high accuracy. This paper presents a technique to locate concepts in a feature described in a use case description consisting of multiple use case steps using dependency between them. We regard each use case step as a description of a concept and apply an existing concept location technique to the descriptions of concepts and obtain lists of modules. Also, three types of dependencies: time, call, and data dependencies among use case steps are extracted based on their textual description. Modules in the obtained lists failing to match the dependency between concepts are filtered out. Thus, we can obtain more precise lists of modules. We have applied our technique to use case descriptions in a benchmark. Results show that our technique outperformed baseline setting without applying the filtering.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2023KBP0004/_f
Copy
@ARTICLE{e107-d_5_602,
author={Shinpei HAYASHI, Teppei KATO, Motoshi SAEKI, },
journal={IEICE TRANSACTIONS on Information},
title={Locating Concepts on Use Case Steps in Source Code},
year={2024},
volume={E107-D},
number={5},
pages={602-612},
abstract={Use case descriptions describe features consisting of multiple concepts with following a procedural flow. Because existing feature location techniques lack a relation between concepts in such features, it is difficult to identify the concepts in the source code with high accuracy. This paper presents a technique to locate concepts in a feature described in a use case description consisting of multiple use case steps using dependency between them. We regard each use case step as a description of a concept and apply an existing concept location technique to the descriptions of concepts and obtain lists of modules. Also, three types of dependencies: time, call, and data dependencies among use case steps are extracted based on their textual description. Modules in the obtained lists failing to match the dependency between concepts are filtered out. Thus, we can obtain more precise lists of modules. We have applied our technique to use case descriptions in a benchmark. Results show that our technique outperformed baseline setting without applying the filtering.},
keywords={},
doi={10.1587/transinf.2023KBP0004},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - Locating Concepts on Use Case Steps in Source Code
T2 - IEICE TRANSACTIONS on Information
SP - 602
EP - 612
AU - Shinpei HAYASHI
AU - Teppei KATO
AU - Motoshi SAEKI
PY - 2024
DO - 10.1587/transinf.2023KBP0004
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E107-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2024
AB - Use case descriptions describe features consisting of multiple concepts with following a procedural flow. Because existing feature location techniques lack a relation between concepts in such features, it is difficult to identify the concepts in the source code with high accuracy. This paper presents a technique to locate concepts in a feature described in a use case description consisting of multiple use case steps using dependency between them. We regard each use case step as a description of a concept and apply an existing concept location technique to the descriptions of concepts and obtain lists of modules. Also, three types of dependencies: time, call, and data dependencies among use case steps are extracted based on their textual description. Modules in the obtained lists failing to match the dependency between concepts are filtered out. Thus, we can obtain more precise lists of modules. We have applied our technique to use case descriptions in a benchmark. Results show that our technique outperformed baseline setting without applying the filtering.
ER -
English
Sign In[Non-Member]
