Verification of infinite-state systems by combining abstraction and reachability analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1633, Issue , 1999, Pages 146-159

  Abdulla, Parosh Aziz ^a   Annichini, Aurore ^b   Bensalem, Saddek ^b   Bouajjani, Ahmed ^b   Habermehl, Peter ^c   Lakhnech, Yassine ^d  

^a Dept of Computer Systems ^*  (Sweden)

^b VERIMAG   (France)

^c UNIVERSITÉ PARIS DIDEROT   (France)

^d UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ABSTRACTION FUNCTIONS; AUTOMATIC GENERATION; AUTOMATIC PROCEDURES; GENERAL METHODOLOGIES; INVARIANT CHECKING; REACHABILITY ANALYSIS; SYMBOLIC REACHABILITY ANALYSIS; VERIFICATION OF INFINITE-STATE SYSTEMS;

COMPUTER AIDED ANALYSIS;

EID: 84957073072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_15     Document Type: Conference Paper

References (26)

1. P. Abdulla, A. Annichini, and A. Bouajjani. Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol. In TACAS'99. LNCS 1579, 1999. 149, 154
2. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In CAV'98. LNCS 1427, 1998. 147, 149, 154, 154, 154
3. P.A. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. Inform. and Comput., 127(2):91-101, 1996. 147
4. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Oliv-ero, J. Sifakis, and S. Yovine. The Algorithmic Analysis of Hybrid Systems. TCS, 138, 1995. 147
5. S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In CAV'98. LNCS 1427, 1998. 147, 148, 151
6. S. Bensalem, Y. Lakhnech, and S. Owre. InVeSt: A Tool for the Verification of Invariants. In CAV'98. LNCS 1427, 1998. 147, 148
7. B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV'96. LNCS 1102, 1996. 147, 154
8. B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV'94. LNCS 818, 1994. 147, 154
9. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR'97. LNCS 1243, 1997. 147
10. A. Bouajjani and P. Habermehl. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. In ICALP'97. LNCS 1256, 1997. 147
11. Gerard Cece, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Inform. and Comput., 124(1):20-31, 1996. 154
12. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM TOPLAS, 16(5), 1994. 147, 151
13. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In IFIP Conf. on Formal Description of Programming Concepts. North-Holland Pub., 1977. 147, 150, 154
14. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In POPL'78. ACM, 1978. 147
15. D. Dams, R. Gerth, and O. Grumberg. Generation of Reduced Models for Checking Fragments of CTL. In CAV'93. LNCS 697, 1993. 147
16. P. D'Argenio, J-P. Katoen, T. Ruys, and G.J. Tretmans. The Bounded Retransmission Protocol must be on Time. In TACAS'97. LNCS 1217, 1997. 156
17. A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Infinity'97, 1997. 147
18. S. Graf and C. Loiseaux. A Tool for Symbolic Program Verification and Abstraction. In CAV'93. LNCS 697, 1993. 147
19. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In CAV'97, volume 1254 of LNCS, 1997. 147
20. J-F. Groote and J. Van de Pol. A Bounded Retransmission Protocol for Large Data Packets. In AMAST'96. LNCS 1101, 1996. 156
21. L. Helmink, M.P.A. Sellink, and F. Vaandrager. Proof checking a Data Link Protocol. In Types for Proofs and Programs. LNCS 806, 1994. 156
22. R.M. Karp and R.E. Miller. Parallel Program Schemata: A Mathematical Model for Parallel Computation. In Switch. and Automata Theory Symp. IEEE, 1967. 154
23. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property Preserving Abstractions for the Verification of Concurrent Systems. FMSD, 6(1), 1995. 147, 150, 151
24. Oliver Matz, Axel Miller, Andreas Potthoff, Wolfgang Thomas, and Erich Valkema. Report on the Program AMoRE. Technical Report 9507, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1995. 149, 153
25. O. Muller and T. Nipkow. Combining Model Checking and Deduction for I/O-Automata. In TACAS'95. LNCS 1019, 1995. 152
26. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, Feb. 1995. 148