一句话:提出 SAT-LLM,将 SMT 求解器与 LLM 协同,用于检测软件需求冲突,实验优于纯 LLM 方法。
在软件开发早期检测相互冲突的需求对降低系统失效风险、提升可靠性至关重要。尽管大语言模型(LLM)在自然语言理解任务上表现优异,但在识别复杂需求冲突所需的细致推理上仍显不足。本文提出 SAT-LLM 框架,将可满足性模理论(SMT)求解器与 LLM 相结合:由 LLM 发挥自然语言理解优势,SMT 求解器提供严格的形式推理能力,二者协同以突破单独使用 LLM 处理复杂需求交互时的局限。初步实验提供了经验证据,表明 SAT-LLM 在识别与化解冲突需求方面优于 ChatGPT 等纯 LLM 方法。这些发现为进一步探索与改进融合自然语言处理技术与形式推理方法的混合方案、应对软件开发中的复杂挑战奠定了基础。
Detecting conflicting requirements early in the software development lifecycle is crucial to mitigating risks of system failures and enhancing overall reliability. While Large Language Models (LLMs) have demonstrated proficiency in natural language understanding tasks, they often struggle with the nuanced reasoning required for identifying complex requirement conflicts. This paper introduces a novel framework, SAT-LLM, which integrates Satisfiability Modulo Theories (SMT) solvers with LLMs to enhance the detection of conflicting software requirements. SMT solvers provide rigorous formal reasoning capabilities, complementing LLMs' proficiency in natural language understanding. By synergizing these strengths, SAT-LLM aims to overcome the limitations of standalone LLMs in handling intricate requirement interactions. The early experiments provide empirical evidence supporting the effectiveness of our SAT-LLM over pure LLM-based methods like ChatGPT in identifying and resolving conflicting requirements. These findings lay a foundation for further exploration and refinement of hybrid approaches that integrate NLP techniques with formal reasoning methodologies to address complex challenges in software development.
DOI 原文 ·
@inproceedings{paperbot8287,
title = {Translation Titans, Reasoning Challenges: Satisfiability-Aided Language Models for Detecting Conflicting Requirements},
author = {Mohamad Fazelnia and Mehdi Mirakhorli and Hamid Bagheri},
booktitle = {ASE},
year = {2024},
doi = {10.1145/3691620.3695302}
}