2024/11/04 by Yi Su, Su, Yuheng, Qiusong Yang +3 · 1 citation
Computer Science · Mathematics · #Commutative Algebra and Its Applications #FOS: Computer and information sciences #Polynomial and algebraic computation #Rings, Modules, and Algebras #Software Engineering (cs.SE)
paper · pdf · doi:10.48550/arxiv.2411.12749
openalex publication_date 2024/11/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
The IC3 algorithm, also known as PDR, has made a significant impact in the field of safety model checking in recent years due to its high efficiency, scalability, and completeness. The most crucial component of IC3 is inductive generalization, which involves dropping variables one by one and is often the most time-consuming step. In this paper, we propose a novel approach to predict a possible minimal lemma before dropping variables by utilizing the counterexample to propagation (CTP). By leveraging this approach, we can avoid dropping variables if predict successfully. The comprehensive evaluation demonstrates a commendable success rate in lemma prediction and a significant performance improvement achieved by our proposed method.