Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
复制标题
优先遍历：用于验证和证伪的高效可达性分析
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
L. Fix
中科院分区：
文献类型：
--
作者：
Ranan Fraer;Gila Kamhi;Barukh Ziv;Moshe Y. Vardi;L. Fix
我们进行半决赛验证的经验表明，对角虫的虫子的可用性有严重的降解，其中调音工作变得更高，而从末端恢复越来越困难。此外，如果根本没有错误，将半超排量的遍历转移到详尽的遍历是非常昂贵的，即使不是不可能的也是非常昂贵的。这使得非常模棱两可的非笨拙设计的半超排量验证的输出非常模棱两可。此外，由于设计确定了每个伪造任务需要收敛到全面验证，因此非常需要一种可以有效处理验证和伪造的算法。我们通过增强的可及性算法来解决这些缺点，该算法在检测角虫错误方面更强大，并且可能会融合到详尽的可及性。我们的方法类似于Cabodi等人的方法。在遍历遍历期间对边界进行分区，但在两个方面有所不同。首先，我们的分区算法会在时间上进行质量交易，从而导致遍历的速度明显更快。其次，根据某些优先级函数处理了副局势，导致混合BFS/DFS遍历。正是最后一个功能使我们的算法适合伪造和验证。
Our experience with semi-exhaustive verification shows a severe degradation in usability for the corner-case bugs, where the tuning effort becomes much higher and recovery from dead-ends is more and more difficult. Moreover, when there are no bugs at all, shifting semi-exhaustive traversal to exhaustive traversal is very expensive, if not impossible. This makes the output of semi-exhaustive verification on non-buggy designs very ambiguous. Furthermore, since after the design fixes each falsification task needs to converge to full verification, there is a strong need for an algorithm that can handle efficiently both verification and falsification. We address these shortcomings with an enhanced reachability algorithm that is more robust in detecting corner-case bugs and that can potentially converge to exhaustive reachability. Our approach is similar to that of Cabodi et al. in partitioning the frontiers during the traversal, but differs in two respects. First, our partitioning algorithm trades quality for time resulting in a significantly faster traversal. Second, the subfrontiers are processed according to some priority function resulting in a mixed BFS/DFS traversal. It is this last feature that makes our algorithm suitable for both falsification and verification.