Programming a symbolic model checker in a fully expansive theorem prover (2003)
by
Hasan Amjad
| Venue: | Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics, volume 2758 of Lecture Notes in Computer Science |
| Citations: | 16 - 5 self |
BibTeX
@INPROCEEDINGS{Amjad03programminga,
author = {Hasan Amjad},
title = {Programming a symbolic model checker in a fully expansive theorem prover},
booktitle = {Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics, volume 2758 of Lecture Notes in Computer Science},
year = {2003},
pages = {171--187},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model checking algorithms may be embedded in a theorem prover to take advantage of the comparatively secure environment without incurring an unacceptable performance penalty. 1
