Efficient Model Checking Using Tabled Resolution

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.

DOI: 10.1007/3-540-63166-6_16

Extracted Key Phrases

3 Figures and Tables

Statistics

01020'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

222 Citations

Semantic Scholar estimates that this publication has 222 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Ramakrishna1997EfficientMC, title={Efficient Model Checking Using Tabled Resolution}, author={Y. S. Ramakrishna and C. R. Ramakrishnan and I. V. Ramakrishnan and Scott A. Smolka and Theresa Swift and David Scott Warren}, booktitle={CAV}, year={1997} }