Efficient Model Checking Using Tabled Resolution (1997)
| Venue: | Computer Aided Verification (CAV '97) |
| Citations: | 110 - 30 self |
BibTeX
@INPROCEEDINGS{Ramakrishna97efficientmodel,
author = {Y. S. Ramakrishna and C. R. Ramakrishnan and I. V. Ramakrishnan and Scott A. Smolka and Terrance Swift and David S. Warren},
title = {Efficient Model Checking Using Tabled Resolution },
booktitle = {Computer Aided Verification (CAV '97)},
year = {1997},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular, we present XMC, an XSBbased local model checker for a CCS-like value-passing language and the alternation-free fragment of the modal mu-calculus. XMC is written in under 200 lines of XSB code, which constitute a declarative specification of CCS and the modal mu-calculus at the level of semantic equations. In order to gauge the performance of XMC as an algorithmic model checker, we conducted a series of benchmarking experiments designed to compare the performance of XMC with the local model checkers implemented in C/C++ in the Concurrency Factory and SPIN specification and verification environments. After applying certain newly developed logic-programmingbased optimizations (along with some standard ones), XMC's performance became extremely competitive with that of the Factory and shows promise in its comparison with SPIN.
