TY - GEN
T1 - BFGen
T2 - 25th International Conference on Software Quality, Reliability and Security, QRS 2025
AU - Wang, Guangyu
AU - Li, Bangqi
AU - Wu, Ji
AU - Shao, Zhijun
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Identifying interaction scenarios between a system and its actors from the high-level requirements and forming use case basic flows is crucial in requirement refinement. Traditional manual methods often yield incomplete or inaccurate flows due to engineers' limited domain expertise, while rulebased methods-relying on predefined parsing rules-suffer from linguistic ambiguities and domain-dependent limitations. Although large language model (LLM) approaches leverage rich domain knowledge and robust natural language processing, they are constrained by input length, generation instability, and the risk of out-of-system outputs, frequently resulting in context-unaware or irrelevant flows. To overcome these challenges, this paper proposes BFGen to generate contextcompliant basic flows strictly adhering to domain constraints and requirement boundaries. BFGen employs LLMs to accurately extract domain-specific terms and interactions, and integrates a Relational Graph Attention Network with attention preservation factors to model logical dependencies and domain constraints effectively. Empirical evaluations on 13 public and 7 industrial datasets show that BFGen outperforms leading baselines by 14% in Precision, 7-25% in Recall, 11- 30% in F1 Score, and 10-19% in AUC. Furthermore, our evaluations confirm the effectiveness of both the LLM module and the attention preservation factors, and assess the impact of requirement completeness on the performance of BFGen.
AB - Identifying interaction scenarios between a system and its actors from the high-level requirements and forming use case basic flows is crucial in requirement refinement. Traditional manual methods often yield incomplete or inaccurate flows due to engineers' limited domain expertise, while rulebased methods-relying on predefined parsing rules-suffer from linguistic ambiguities and domain-dependent limitations. Although large language model (LLM) approaches leverage rich domain knowledge and robust natural language processing, they are constrained by input length, generation instability, and the risk of out-of-system outputs, frequently resulting in context-unaware or irrelevant flows. To overcome these challenges, this paper proposes BFGen to generate contextcompliant basic flows strictly adhering to domain constraints and requirement boundaries. BFGen employs LLMs to accurately extract domain-specific terms and interactions, and integrates a Relational Graph Attention Network with attention preservation factors to model logical dependencies and domain constraints effectively. Empirical evaluations on 13 public and 7 industrial datasets show that BFGen outperforms leading baselines by 14% in Precision, 7-25% in Recall, 11- 30% in F1 Score, and 10-19% in AUC. Furthermore, our evaluations confirm the effectiveness of both the LLM module and the attention preservation factors, and assess the impact of requirement completeness on the performance of BFGen.
KW - Basic Flow Generation
KW - Graph Attention Networks
KW - Large Language Models
KW - Requirements Refinement
UR - https://www.scopus.com/pages/publications/105018798073
U2 - 10.1109/QRS65678.2025.00023
DO - 10.1109/QRS65678.2025.00023
M3 - 会议稿件
AN - SCOPUS:105018798073
T3 - IEEE International Conference on Software Quality, Reliability and Security, QRS
SP - 120
EP - 131
BT - Proceedings - 2025 25th International Conference on Software Quality, Reliability and Security, QRS 2025
PB - Institute of Electrical and Electronics Engineers
Y2 - 16 July 2025 through 20 July 2025
ER -