Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (0)
Cached
Download Links
- [www.liafa.jussieu.fr]
- [www.informatik.uni-kiel.de]
- DBLP
Other Repositories/Bibliography
| Citations: | 16 - 2 self |
BibTeX
@MISC{Abdulla_verificationof,
author = {Parosh Aziz Abdulla and Aurore Annichini and Saddek Bensalem and Ahmed Bouajjani and Peter Habermehl and Yassine Lakhnech},
title = {Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ion and Reachability Analysis ? Parosh Aziz Abdulla 1 Aurore Annichini 2 Saddek Bensalem 2 Ahmed Bouajjani 2 Peter Habermehl 3 Yassine Lakhnech 4 1 Dept. of Computer Systems, P.O. Box 325, 75105 Uppsala, Sweden. 2 Verimag, Centre Equation, 2 av. de Vignate, 38610 Gi`eres, France. 3 Liafa - Case 7014, 2 place Jussieu, 75251 Paris Cedex 05, France. 4 Institut fur Informatik und Praktishe Mathematik, Christian-Albrechts-Universitat zu Kiel, Preußerstr. 1-9, 24105 Kiel, Germany. Abstract. We address the problem of verifying systems operating on different types of variables ranging over infinite domains. We consider in particular systems modeled by means of extended automata communicating through unbounded fifo channels. We develop a general methodology for analyzing such systems based on combining automatic generation of abstract models (not necessarily finite-state) with symbolic reachability analysis. Reachability analysis procedures allow to verify automatically prope...
