arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.12903cs.SEcs.FL
收藏

利用目标的语义信息识别边界条件

Identifying Boundary Conditions with the Syntax and Semantic Information of Goals

Yechuan Xia, Jianwen Li, Shengping Xiao, Weikai Miao, Geguang Pu

摘要:

在面向目标的需求工程中,边界条件(BC)用于捕获目标的分歧,即,在某些情况下,目标不能作为一个整体得到满足。由于目标是用时态逻辑形式化描述的,求解BC自动帮助工程师判断目标需求中是否存在疏忽。已经做出了一些努力来计算BC以及减少冗余BC的数量。然而,最先进的算法不利用规范背后的逻辑信息,并且在现实中使用时不够有效。此外,即使在先前的工作中探索了减少冗余BC,计算出的BC可能仍然对工程调试没有价值。在本文中,我们从头开始建立BC问题的基本框架。在此基础上,我们首先提出了一种新的方法SyntacBC识别与目标的语法信息的BC。实验结果表明,该方法能够实现比以前的国家的最先进的方法> 1000倍的加速。受结果的启发,我们发现了我们的方法和以前的方法解决的BC的缺陷,即,大多数计算出的BC都很难调试。因此,我们利用目标的语义信息,并提出了一种基于自动机的方法来解决BC,即SemanticBC,它不仅可以找到最小的分歧范围,而且还可以产生易于理解的BC,而不会损失性能。

英文摘要:

In goal-oriented requirement engineering, boundary conditions(BC) are used to capture the divergence of goals, i.e., goals cannot be satisfied as a whole in some circumstances. As the goals are formally described by temporal logic, solving BCs automatically helps engineers judge whether there is negligence in the goal requirements. Several efforts have been devoted to computing the BCs as well as to reducing the number of redundant BCs as well. However, the state-of-the-art algorithms do not leverage the logic information behind the specification and are not efficient enough for use in reality. In addition, even though reducing redundant BCs are explored in previous work, the computed BCs may be still not valuable to engineering for debugging. In this paper, we start from scratch to establish the fundamental framework for the BC problem. Based on that, we first present a new approach SyntacBC to identify BCs with the syntax information of goals. The experimental results show that this method is able to achieve a >1000X speed-up than the previous state-of-the-art methodology. Inspired by the results, we found the defects of BCs solved by our method and also by the previous ones, i.e., most of BCs computed are difficult for debugging. As a result, we leverage the semantics information of goals and propose an automata-based method for solving BCs, namely SemanticBC, which can not only find the minimal scope of divergence, but also produce easy-to-understand BCs without losing performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑