Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech  Home/Search
Context Related
| sri.com/reports/po...av99verimag.ps.gz informatik.unikiel.de/~y...cav99.ps.gz liafa.jussieu.fr/~...t+symbcav99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sri.com/fm (more) From: informatik.unikiel.de/%7Eyl/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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.... (Update)
Cited by: More
Checking Asynchronously Communicating Components.. - Maréchal.. (2004) (Correct)
Checking Asynchronously Communicating Components using.. - Olivier Marechal And (2004) (Correct)
Counterexample-Guided Abstraction Refinement - For Symbolic Model (Correct)
Active bibliography (related documents): More All
0.4: Symbolic Verification of Lossy Channel Systems.. - Abdulla, Annichini.. (1999) (Correct)
0.2: Analysis Of Production Schemata By Petri Nets - Hack (1972) (Correct)
0.2: Information Societies Technology - Ist Programme Future (Correct)
Similar documents based on text: More All
1.0: Analyzing Fair Parametric Extended Automata - Bouajjani, Collomb-Annichini.. (2001) (Correct)
0.5: TReX: A Tool for Reachability Analysis of Complex Systems - Annichini, Bouajjani.. (2001) (Correct)
0.5: Symbolic Reachability Analysis of FIFO-Channel Systems.. - Bouajjani, Habermehl (1998) (Correct)
Related documents from co-citation: More All
8: Computing Abstractions of Infinite State Systems Compositionally and Automatical.. - Bensalem, Lakhnech et al. - 1998
6: Property preserving abstractions for the verification of concurrent systems - Loiseaux, Graf et al. - 1995
6: Experience with predicate abstraction - Das, Dill et al. - 1999
BibTeX entry: (Update)
P. A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani, P. Habermehl, and Y. Lakhnech. Verification of infinitestate systems by combining abstraction and reachability analysis. In Halbwachs and Peled [20], pages 146--159. http://citeseer.ist.psu.edu/36204.html More
@inproceedings{ abdulla99verification,
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",
booktitle = "Computer-Aided Verification, {CAV} '99",
volume = "1633",
publisher = "Springer-Verlag",
address = "Trento, Italy",
editor = "Nicolas Halbwachs and Doron Peled",
pages = "146--159",
year = "1999",
url = "citeseer.ist.psu.edu/36204.html" }
Citations (may not include all citations):399 The Algorithmic Analysis of Hybrid Systems - Alur, Courcoubetis et al. - 1995
270 Formal verification for faulttolerant architectures: Prolego.. - Owre, Rushby et al. - 1995
250 Automatic Discovery of Linear Restraints among Variables of .. - Cousot, Halbwachs - 1978
231 Model checking and abstraction - Clarke, Grumberg et al. - 1994
200 Construction of Abstract State Graphs with PVS - Graf, Saidi - 1997
151 Reachability Analysis of Pushdown Automata: Application to M.. - Bouajjani, Esparza et al. - 1997
96 Property Preserving Abstractions for the Verification of Con.. - Loiseaux, Graf et al. - 1995
84 A Direct Symbolic Approach to Model Checking Pushdown System.. - Finkel, Willems et al. - 1997
75 Verifying Programs with Unreliable Channels - Abdulla, Jonsson - 1996
70 Computing Abstractions of Infinite State Systems Composition.. - Bensalem, Lakhnech et al. - 1998
62 Symbolic Verification with Periodic Sets - Boigelot, Wolper - 1994
58 Symbolic Verification of Communication Protocols with Infini.. - Boigelot, Godefroid - 1996
57 Proof checking a Data Link Protocol - Helmink, Sellink et al. - 1994
54 A Bounded Retransmission Protocol for Large Data Packets - Groote, Pol - 1996
47 Generation of Reduced Models for Checking Fragments of CTL (context) - Dams, Gerth et al. - 1993
46 Symbolic Reachability Analysis of FIFO-Channel Systems with .. - Bouajjani, Habermehl - 1997
44 The Bounded Retransmission Protocol must be on Time - D'Argenio, Katoen et al. - 1997
44 Static Determination of Dynamic Properties of Recursive Proc.. (context) - Cousot, Cousot - 1977
40 A Tool for Symbolic Program Verification and Abstraction - Graf, Loiseaux - 1993
39 fly Analysis of Systems with Unbounded (context) - Abdulla, Bouajjani et al. - 1998
28 Unreliable Channels Are Easier to Verify Than Perfect Channe.. (context) - C'ec'e, Finkel et al. - 1996
24 InVeSt : A Tool for the Verification of Invariants - Bensalem, Lakhnech et al. - 1998
21 Combining Model Checking and Deduction for I/OAutomata - Muller, Nipkow - 1995
16 Symbolic Verification of Lossy Channel Systems: Application .. - Abdulla, Annichini et al. - 1999
7 Report on the Program AMoRE - Matz, Miller et al. - 1995
4 Parallel Program Schemata: A Mathematical Model for Parallel.. (context) - Karp, Miller - 1967
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC