Counterexample-based refinement for a boundedness test for CFSM languages (2005)
Cached
Download Links
- [www.inf.uni-konstanz.de]
- [www.inf.uni-konstanz.de]
- [www.inf.uni-konstanz.de]
- [www.inf.uni-konstanz.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In Model Checking Software, 12th International SPIN Workshop, Proceedings, volume 3639 of Lecture Notes in Computer Science |
| Citations: | 5 - 4 self |
BibTeX
@INPROCEEDINGS{Leue05counterexample-basedrefinement,
author = {Stefan Leue and Wei Wei},
title = {Counterexample-based refinement for a boundedness test for CFSM languages},
booktitle = {In Model Checking Software, 12th International SPIN Workshop, Proceedings, volume 3639 of Lecture Notes in Computer Science},
year = {2005},
pages = {58--74},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In precursory work we suggested an abstraction-based highly scalable semi-test for the boundedness of Communicating Finite State Machine (CFSM) based modelling and programming languages. We illustrated its application to Promela and UML-RT models. The test is sound with respect to determining boundedness, but may return inconclusive ”counterexamples ” when boundedness cannot be established. In this paper we turn to the question how to effectively determine the spuriousness of these counterexamples, and how to refine the abstraction based on the analysis. We employ methods from program analysis and illustrate the application of our refinement method to a number of Promela examples. 1
