DMCA
From Pre-Historic to Post-Modern Symbolic Model Checking (1998)
Cached
Download Links
- [www.cs.huji.ac.il]
- [www.eecs.berkeley.edu]
- [www-cad.eecs.berkeley.edu]
- [research.compaq.com]
- [www-cad.eecs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER-AIDED VERI |
| Citations: | 38 - 5 self |
BibTeX
@INPROCEEDINGS{Henzinger98frompre-historic,
author = {Thomas A. Henzinger and Orna Kupferman and Shaz Qadeer},
title = {From Pre-Historic to Post-Modern Symbolic Model Checking},
booktitle = {IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER-AIDED VERI},
year = {1998},
pages = {195--206},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Symbolic model checking, which enables the automatic verification of large systems, proceeds by calculating with expressions that represent state sets. Traditionally, symbolic model-checking tools are based on backward state traversal; their basic operation is the function pre, which given a set of states, returns the set of all predecessor states. This is because specifiers usually employ formalisms with future-time modalities, which are naturally evaluated by iterating applications of £¨¤§ ¦. It has been recently shown experimentally that symbolic model checking can perform significantly better if it is based, instead, on forward state traversal; in this case, the basic operation is the function £�©��§ � , which given a set of states, returns the set of all successor states. This is because forward state traversal can ensure that only those parts of the state space are explored which are reachable from an initial state and relevant for satisfaction or violation of the specification; that is, errors can be detected as soon as possible. In this paper, we investigate which specifications can be checked by symbolic forward state traversal. We formulate the problems of symbolic backward and forward model checking by means of two �-calculi. The �¥�� �- � calculus is based on the £¨¤� ¦ operation; the �¨���� �-� calculus, on the £�©��§ � operation. These two �-calculi induce query logics, which augment fixpoint expressions with a boolean emptiness query. Using query logics, we are able to relate and compare the symbolic backward and forward approaches. In particular, we prove that all �-regular (linear-time) specifications can be expressed as�¨���� �- � queries, and therefore checked using symbolic forward state traversal. On the other hand, we show that there are simple branching-time specifications that cannot be checked in this way.
Keyphrases
post-modern symbolic model checking query logic forward state traversal basic operation symbolic backward state set model checking backward state traversal simple branching-time specification state traversal fixpoint expression forward approach symbolic model checking boolean emptiness query successor state symbolic forward state traversal state space initial state predecessor state symbolic model-checking tool automatic verification symbolic model future-time modality large system
