Efficient LTL Compilation for SAT -based Model Checking (2005)
| Venue: | IN PROC. INT’L CONF. ON COMPUTER-AIDED DESIGN |
BibTeX
@INPROCEEDINGS{Armoni05efficientltl,
author = {Roy Armoni and Sergey Egorov and Ranan Fraer and Dmitry Korchemny and Moshe Y. Vardi},
title = {Efficient LTL Compilation for SAT -based Model Checking},
booktitle = {IN PROC. INT’L CONF. ON COMPUTER-AIDED DESIGN},
year = {2005},
pages = {877--884},
publisher = {IEEE}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This work describes an algorithm of automata construction for LTL safety properties, suitable for bounded model check ing. Existing automata construction methods are tailored to BDD-based symbolic model checking. The novelty of our approach is that we construct deterministic automata, unlike the standard approach, which constructs nondeterministic automata. We show that the proposed method has significant advantages for bounded model checking over traditional methods.
