Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs (Extended Abstract) (0)
Cached
Download Links
- [www.montefiore.ulg.ac.be]
- [www.montefiore.ulg.ac.be]
- DBLP
Other Repositories/Bibliography
| Venue: | In CAV'96. LNCS 1102 |
| Citations: | 73 - 6 self |
BibTeX
@INPROCEEDINGS{Boigelot_symbolicverification,
author = {Bernard Boigelot and Patrice Godefroid},
title = {Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs (Extended Abstract)},
booktitle = {In CAV'96. LNCS 1102},
year = {},
pages = {1--12},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) Bernard Boigelot Universit'e de Li`ege Institut Montefiore, B28 4000 Li`ege Sart-Tilman, Belgium Email: boigelot@montefiore.ulg.ac.be Patrice Godefroid Lucent Technologies -- Bell Laboratories 1000 E. Warrenville Road Naperville, IL 60566, U.S.A. Email: god@bell-labs.com Abstract We study the verification of properties of communication protocols modeled by a finite set of finite-state machines that communicate by exchanging messages via unbounded FIFO queues. It is well-known that most interesting verification problems, such as deadlock detection, are undecidable for this class of systems. However, in practice, these verification problems may very well turn out to be decidable for a subclass containing most "real" protocols. Motivated by this optimistic (and, we claim, realistic) observation, we present an algorithm that may construct a finite and exact representation of the state space of a communication protocol, even if this state space is infinite. Our algorithm performs a loo...
