对数时间内的增量死状态检测
Incremental Dead State Detection in Logarithmic Time
AI总结:
本文提出引导式增量有向图(GIDs)以形式化状态探索中边逐步添加的场景,并设计算法将死状态检测改进到每条边 O(log m) 摊还时间,实验显示相比 BFGT 基线实现 110-530 倍加速。
摘要:
在抽象迁移系统中识别活状态和死状态是形式验证中反复出现的问题;例如,它出现在我们最近关于在 SMT 中高效判定正则表达式约束的工作中。然而,用于增量维护可达性信息(即随着状态被访问、在整个状态空间被探索之前)的最先进图算法假设可以在任何时刻从任何状态添加新边,而在许多应用中,出边是在每个状态被探索时从该状态添加的。为了形式化后一种情况,我们提出了引导式增量有向图(GIDs),这是一种增量图,支持标记封闭状态(即不会再接收更多出边的状态)。我们的主要结果是,对于 m 条边,GIDs 中的死状态检测可以以每条边 O(log m) 的摊还时间解决,相比 Bender、Fineman、Gilbert 和 Tarjan(BFGT)针对一般增量有向图的每条边 O(√m) 有所改进。我们为 GIDs 引入了两种算法:一种建立了对数时间界,第二种算法探索了一种基于惰性启发式的方法。为了实现公平的逐项实验比较,我们在 Rust 中使用一个公共有向图接口实现了这两种算法、两个更简单的基线以及最先进的 BFGT 基线。我们的评估显示,在一系列图类、随机图以及来自正则表达式基准的图上,对于最大的输入图,相比 BFGT 实现了 110-530 倍的加速。
英文摘要:
Identifying live and dead states in an abstract transition system is a recurring problem in formal verification; for example, it arises in our recent work on efficiently deciding regex constraints in SMT. However, state-of-the-art graph algorithms for maintaining reachability information incrementally (that is, as states are visited and before the entire state space is explored) assume that new edges can be added from any state at any time, whereas in many applications, outgoing edges are added from each state as it is explored. To formalize the latter situation, we propose guided incremental digraphs (GIDs), incremental graphs which support labeling closed states (states which will not receive further outgoing edges). Our main result is that dead state detection in GIDs is solvable in $O(\log m)$ amortized time per edge for $m$ edges, improving upon $O(\sqrt{m})$ per edge due to Bender, Fineman, Gilbert, and Tarjan (BFGT) for general incremental directed graphs. We introduce two algorithms for GIDs: one establishing the logarithmic time bound, and a second algorithm to explore a lazy heuristics-based approach. To enable an apples-to-apples experimental comparison, we implemented both algorithms, two simpler baselines, and the state-of-the-art BFGT baseline using a common directed graph interface in Rust. Our evaluation shows $110$-$530$x speedups over BFGT for the largest input graphs over a range of graph classes, random graphs, and graphs arising from regex benchmarks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。