Development of an Efficient Graph-based Method for Requirements Traceability Management

Software development projects often struggle with maintaining requirements traceability, as manual traceability matrices are error-prone, time-consuming, and difficult to update as work products change. Existing commercial tools such as IBM DOORS or Helix RM are costly, complex, and require steep learning curves, hindering widespread adoption. In this paper, we propose an effective graph-based requirements traceability management method, which automatically extracts identifiers from work products over the software development life cycle (SDLC) and illustrates their relationships in the form of a requirements traceability graph. The proposed approach enables detection of missing or-mis-specified work products, supports efficient updates of work products, and offers visualization that facilitates verification and validation. By using structured identifiers and configurable keyword types, the system generates traceability links across SDLC phases, eliminating the need for manual rework. Case studies empirically demonstrate that the proposed method reduces effort through automation, improves accuracy, and enhances visibility compared to traditional manual traceability matrices. Performance analysis shows that RTG effectively manages traceability across complex projects, offering scalability and adaptability while mitigating inconsistency risks. This facilitates a more reliable assessment of project success and quality in the domains of software engineering and R&D.

Authors

Publication Details

Journal
Journal of Korea Multimedia Society
Published
2026-02-28
DOI
https://doi.org/10.9717/kmms.2026.29.2.299
Primary Topic
Software Engineering Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Development of an Efficient Graph-based Method for Requirements Traceability Management

Jong-Min Lee
Journal of Korea Multimedia Society
Software Engineering Research
article

Development of an Efficient Graph-based Method for Requirements Traceability Management

Jong-Min Lee
article en

Abstract

Software development projects often struggle with maintaining requirements traceability, as manual traceability matrices are error-prone, time-consuming, and difficult to update as work products change. Existing commercial tools such as IBM DOORS or Helix RM are costly, complex, and require steep learning curves, hindering widespread adoption. In this paper, we propose an effective graph-based requirements traceability management method, which automatically extracts identifiers from work products over the software development life cycle (SDLC) and illustrates their relationships in the form of a requirements traceability graph. The proposed approach enables detection of missing or-mis-specified work products, supports efficient updates of work products, and offers visualization that facilitates verification and validation. By using structured identifiers and configurable keyword types, the system generates traceability links across SDLC phases, eliminating the need for manual rework. Case studies empirically demonstrate that the proposed method reduces effort through automation, improves accuracy, and enhances visibility compared to traditional manual traceability matrices. Performance analysis shows that RTG effectively manages traceability across complex projects, offering scalability and adaptability while mitigating inconsistency risks. This facilitates a more reliable assessment of project success and quality in the domains of software engineering and R&D.

Journal of Korea Multimedia SocietyVol. 29(2)
Climate action
Openalex Percentile: Top 12%
Software Engineering Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.