Une approche CSP pour l'aide à la localisation d'errreurs
Une approche CSP pour l'aide à la localisation d'erreurs
摘要:
本文介绍了一种新的基于CP的方法,以支持错误的位置在一个程序中的反例是可用的,即违反后置条件的输入变量的实例化。为了提供错误定位的有用信息,我们生成一个约束系统的CFG(控制流图)的路径,其中最多k个条件语句可能是错误的。然后,我们计算这些路径中的每一个的有界大小的最小校正集(MCS)。移除这些约束集合中的一个会产生一个最大可满足子集,换句话说,一个满足后置条件的约束的最大子集。我们扩展了Liffiton和Sakallah提出的算法\cite{LiS08},以更有效地处理数值语句的程序。我们目前的初步实验结果是相当令人鼓舞的。
英文摘要:
We introduce in this paper a new CP-based approach to support errors location in a program for which a counter-example is available, i.e. an instantiation of the input variables that violates the post-condition. To provide helpful information for error location, we generate a constraint system for the paths of the CFG (Control Flow Graph) for which at most k conditional statements may be erroneous. Then, we calculate Minimal Correction Sets (MCS) of bounded size for each of these paths. The removal of one of these sets of constraints yields a maximal satisfiable subset, in other words, a maximal subset of constraints satisfying the post condition. We extend the algorithm proposed by Liffiton and Sakallah \cite{LiS08} to handle programs with numerical statements more efficiently. We present preliminary experimental results that are quite encouraging.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。