On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels (1998)

Cached

Download Links

by Parosh Aziz Abdulla , Ahmed Bouajjani , Bengt Jonsson
Venue:In CAV'98. LNCS 1427
Citations:64 - 15 self

Active Bibliography

19 Using Forward Reachability Analysis for Verification of Lossy Channel Systems – Parosh Aziz Abdulla, Aurore Annichini, Ahmed Bouajjani, Bengt Jonsson - 2004
73 Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs (Extended Abstract) – Bernard Boigelot, Patrice Godefroid
150 Verifying Programs with Unreliable Channels (Extended Abstract) – Parosh Abdulla, Bengt Jonsson - 1992
50 Undecidable Verification Problems for Programs with Unreliable Channels – Parosh Aziz Abdulla, Bengt Jonsson - 1994
Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract) – Parosh Aziz Abdullah, Abdulla Mats Kindahl
35 Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol – Parosh Abdulla, Aurore Annichini, Ahmed Bouajjani - 1999
10 Verification of Communication Protocols Using Abstract Interpretation of FIFO queues – Tristan Le Gall, Thierry Jéron - 2006
25 Probabilistic Lossy Channel Systems – Purush Iyer, Murali Narasimha - 1996
6 Effective Lossy Queue Languages – Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani - 2001
13 Well-Abstracted Transition Systems: Application to FIFO Automata – Alain Finkel, S. Purushothaman Iyer - 2000
52 The Power of QDDs – Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper - 1997
22 Verification of probabilistic systems with faulty communication – Parosh Aziz Abdulla, Alexander Rabinovich - 2003
11 Programs with quasi-stable channels are effectively recognizable – G. Cece, A. Finkel - 1997
1 Piecewise FIFO Channels Are Analyzable – Naghmeh Ghafari, Richard Trefler
1 Model Checking Probabilistic Lossy Channel Systems – Purush Iyer, Murali Narasimha - 1998
3 Languages, Rewriting systems, and Verification of Infinite-State Systems – Ahmed Bouajjani - 2001
2 Effective Recognizability and Model Checking of Reactive Fiffo Automata – G. Sutre, G. Sutre, A. Finkel, A. Finkel, O. Roux, O. Roux, F. Cassez, F. Cassez - 1998
Information Societies Technology – Ist Programme Future
39 Transitive Closures of Regular Relations for Verifying Infinite-State Systems – Bengt Jonsson, Marcus Nilsson