Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Hao Liu 0091

dblp:09/3214-91 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-1005-0996ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
requirements validation
0.912025
ReCompGPT: An NL2NL Framework for Automated Requirements Completeness · IEEE Trans. Software Eng. 2025

Methods — techniques the papers use, named apart from their topics

large language model · 0.9chain-of-thought prompting · 0.9action diffusion · 0.9
YearPublicationVenuePosition
2025 ReCompGPT: An NL2NL Framework for Automated Requirements Completeness
abstract
Detecting completeness in natural language (NL) requirements traditionally involves domain modeling to establish reference models, which requires substantial manual effort and proves to be time- and labor-intensive. Large Language Models (LLMs), with an extensive knowledge base and advanced capabilities for contextual understanding and reasoning, present an opportunity for automated completeness detection in NL requirements. To better complete this task, we first propose the CMD model for implied completeness, which formally characterizes the essential nature of external completeness in NL requirements. We further establish formal definitions for requirements compositions and incompleteness dimensions, providing a qualitative analytical foundation for completeness detection. We then present ReCompGPT (Requirements Completing GPT), an LLM-powered method for detecting and repairing requirements completeness. Grounded in the proposed definitions, we construct a fine-grained chain-of-thought augmented by an action diffusion approach that provides the model with multi-perspective insights into requirements. It eliminates the need for a reference model, verifying the completeness of requirements specifications from natural language to natural language (NL2NL). Simultaneously, we develop a new dataset dedicated to detecting the external completeness in NL requirements, on which our method achieves an overall detection success rate of 93.8%, significantly enhancing performance relative to the vanilla prompts and the vanilla chain-of-thought, respectively. Overall, ReCompGPT demonstrates superior capabilities in both simple scenarios and complex cases characterized by implied requirements incompleteness. Our method proves to be effective and flexible.
Tianye Sheng, Lisong Wang, Hao Liu 0091
IEEE Trans. Software Eng.3