arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.0131cs.LO
收藏

有序反抽象

Ordered Counter-Abstraction

Ahmed Rezine

摘要:

我们引入了一个新的符号表示的基础上原来的概括反抽象。与经典的反抽象(用于分析具有无序或非结构化拓扑的参数化系统)不同,新的表示是为证明线性有序参数化系统的性质而定制的,即,系统与任意多个有限进程放置在一个数组中。数组中的相对位置捕获进程的相对优先级。这些系统的子系统是任意长度的有限字。进程使用受其相对优先级约束的全局转换进行通信。直观地说,符号表示的元素有一个基和一组计数器。它表示遵守计数器所施加的约束的配置,并将base作为子字。我们使用新的表示在一个统一的和自动的反例指导的细化计划。我们引入了一个松弛算子,允许一个良好的准序参数的细化循环的每次迭代的终止。我们解释了如何改进松弛以系统地剔除误报。我们实现了一个工具来说明一些参数化系统的方法。

英文摘要:

We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new representation is tailored for proving properties of linearly ordered parameterized systems, i.e., systems with arbitrary many finite processes placed in an array. The relative positions in the array capture the relative priorities of the processes. Configurations of such systems are finite words of arbitrary lengths. The processes communicate using global transitions constrained by their relative priorities. Intuitively, an element of the symbolic representation has a base and a set of counters. It denotes configurations that respect the constraints imposed by the counters and that have the base as a sub word. We use the new representation in a uniform and automatic Counter Example Guided Refinement scheme. We introduce a relaxation operator that allows a well quasi ordering argument for the termination of each iteration of the refinement loop. We explain how to refine the relaxation to systematically prune out false positives. We implemented a tool to illustrate the approach on a number of parameterized systems.

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

↑