文獻閱讀——Single Clause Assumption without Activation Literals to Speed-up IC3

海阔凭鱼跃越發表於2024-06-03

Single Clause Assumption without Activation Literals to Speed-up IC3

@inproceedings{DBLP:conf/fmcad/FroleyksB21,
  author       = {Nils Froleyks and
                  Armin Biere},
  title        = {Single Clause Assumption without Activation Literals to Speed-up {IC3}},
  booktitle    = {Formal Methods in Computer Aided Design, {FMCAD} 2021, New Haven,
                  CT, USA, October 19-22, 2021},
  pages        = {72--76},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.34727/2021/isbn.978-3-85448-046-4\_15},
  doi          = {10.34727/2021/ISBN.978-3-85448-046-4\_15},
  timestamp    = {Tue, 07 Dec 2021 17:02:16 +0100},
  biburl       = {https://dblp.org/rec/conf/fmcad/FroleyksB21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Abstract

We extend the well-established assumption-based interface of incremental SAT solvers to clauses, allowing the addition of a temporary clause that has the same lifespan as literal assumptions. Our approach is efficient and easy to im plement in modern CDCL-based solvers. Compared to previous approaches, it does not come with any memory overhead and does not slow down the solver due to disabled activation literals, thus eliminating the need for algorithms like IC3 to restart the SAT solver. All clauses learned under literal and clause assumptions are safe to keep and not implicitly invalidated for containing an activation literal. These changes increase the quality of learned clauses, resulting in better generalization for IC3. We implement the extension in the SAT solver CaDiCaL and evaluate it with the IC3 implementation in the model checker ABC. Our experiments on the benchmarks from a recent hardware model checking competition show a speedup for the average SAT call and a reduction in number of calls per verification instance, resulting in a substantial improvement in model checking time.

摘要——我們將成熟的基於假設的增量SAT求解器介面擴充套件到了子句，允許新增一個與命題假設具有相同壽命的臨時子句。我們的方法高效且易於在現代CDCL-based求解器中實現。與之前的方法相比，它不會帶來任何記憶體開銷，也不會因為禁用啟用子句而減慢求解器的速度，從而消除了需要像IC3這樣的SAT求解器重新啟動的必要。在命題和子句假設下學習的所有子句都是安全的，不會因為包含啟用子句而隱式失效。這些變化提高了學習子句的質量，從而為IC3提供了更好的泛化。我們在SAT求解器CaDiCaL中實現了該擴充套件，並與模型檢查器ABC中的IC3實現進行了評估。在最近的硬體模型檢查競賽的基準測試上進行的實驗顯示，SAT呼叫平均速度加快，每個驗證例項的呼叫次數減少，從而顯著提高了模型檢查時間。

相關文章