Abstract
AbstractWe present LT-PDR, a lattice-theoretic generalization of Bradley’s property directed reachability analysis (PDR) algorithm. LT-PDR identifies the essence of PDR to be an ingenious combination of verification and refutation attempts based on the Knaster–Tarski and Kleene theorems. We introduce four concrete instances of LT-PDR, derive their implementation from a generic Haskell implementation of LT-PDR, and experimentally evaluate them. We also present a categorical structural theory that derives these instances.
Publisher
Springer International Publishing
Reference30 articles.
1. The 8th competitive event for hardware model checkers (HWMCC 2015) (2015). http://fmv.jku.at/hwmcc15/
2. Aguirre, A., Katsumata, S.: Weakest preconditions in fibrations. Electronic Notes in Theoretical Comput. Sci. 352, 5–27 (2020). http://www.sciencedirect.com/science/article/pii/S1571066120300487, the 36th Mathematical Foundations of Programming Semantics Conference (2020)
3. Awodey, S.: Category Theory. Oxford Logic Guides. Oxford Univ. Press, Oxford (2006)
4. Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)
5. Baranga, A.: The contraction principle as a particular case of Kleene’s fixed point theorem. Discret. Math. 98(1), 75–79 (1991)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献