Un algorithme incrémental dirigé par les flots et basé sur les constraintes pour l'aide à la localisation d'errreurs
Un algorithme incrémental dirigé par les flots et basé sur les contraintes pour l'aide à la localisation d'erreurs
摘要:
在这篇文章中,我们提出了我们的改进算法的错误定位从反例,LocFaults,流驱动和约束为基础。该算法通过分析错误程序的控制流图路径,计算出可疑指令子集,从而对程序进行修正。事实上,我们生成一个系统的控制流图的路径的限制,最多k条件语句可以是错误的。然后我们计算这些路径上有界大小的MCS(最小校正集)。移除这些约束之一给出最大可满足子集,换句话说,满足后置条件的最大可满足子集。为了计算MCS,我们扩展了Liffiton和Sakallah提出的遗传算法,以便更有效地处理具有数值指令的程序。我们有兴趣提出的增量方面,这个新的算法,尚未提出。
英文摘要:
In this article, we present our improved algorithm for error localization from counterexamples, LocFaults, flow-driven and constraint-based. This algorithm analyzes the paths of CFG (Control Flow Graph) of the erroneous program to calculate the subsets of suspicious instructions to correct the program. Indeed, we generate a system of constraints for paths of control flow graph for which at most k conditional statements can be wrong. Then we compute the MCSs (Minimal Correction Set) of bounded size on each of these paths. Removal of one of these sets of constraints gives maximal satisfiable subset, in other words, a maximal satisfiable subset satisfying the postcondition. To calculate the MCSs, we extend the generic algorithm proposed by Liffiton and Sakallah in order to deal programs with numerical instructions more effectively. We are interested to present the incremental aspect of this new algorithm that is not yet presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。