Model Exploration with Temporal Logic Query Checking (2002)
Cached
Download Links
- [www.cs.toronto.edu]
- [www.cs.toronto.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF SIGSOFT CONFERENCE ON FOUNDATIONS OF SOFTWARE ENGINEERING (FSE'02 |
| Citations: | 16 - 9 self |
BibTeX
@INPROCEEDINGS{Gurfinkel02modelexploration,
author = {Arie Gurfinkel and Benet Devereux and Marsha Chechik},
title = {Model Exploration with Temporal Logic Query Checking},
booktitle = {IN PROCEEDINGS OF SIGSOFT CONFERENCE ON FOUNDATIONS OF SOFTWARE ENGINEERING (FSE'02},
year = {2002},
pages = {139--148},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A temporal logic query is a temporal logic formula with placeholders. Given a model, a solution to a query is a set of assignments of propositional formulas to placeholders, such that replacing the placeholders with any of these assignments results in a temporal logic formula that holds in the model. Query checking, first introduced by William Chan [2], is an automated technique for finding solutions to temporal logic queries. It allows discovery of the temporal properties of the system and as such may be a useful tool for model exploration and reverse engineering. This paper
