Optimality in Abstractions of Model Checking (1995)
| Venue: | IN SAS'95: PROC. 2D. STATIC ANALYSIS SYMPOSIUM, LECTURE NOTES IN COMPUTER SCIENCE 983 |
| Citations: | 38 - 0 self |
BibTeX
@INPROCEEDINGS{Cleaveland95optimalityin,
author = {Rance Cleaveland and Purush Iyer and Daniel Yankelevich},
title = {Optimality in Abstractions of Model Checking},
booktitle = {IN SAS'95: PROC. 2D. STATIC ANALYSIS SYMPOSIUM, LECTURE NOTES IN COMPUTER SCIENCE 983},
year = {1995},
pages = {51--63},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper investigates the use of abstract-interpretation-inspired techniques for improving the performance of procedures for determining when systems satisfy formulas in branching-time temporal logic. A framework for abstracting system descriptions is developed, and a particular method for generating abstract systems from given abstractions on system states is defined and shown to be both safe and optimal, in the sense that concrete systems satisfy all the temporal formulas enjoyed by their abstracted counterparts. One may then use a model checker on an abstracted (and hence smaller) system in order to infer properties of a concrete system.
