Flat acceleration in symbolic model checking

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

Volumn 3707 LNCS, Issue , 2005, Pages 474-488

  Bardin, Sébastien ^a   Finkel, Alain ^a   Leroux, Jérôme ^b   Schnoebelen, Philippe ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Acceleration; Symbolic model checking; Verification of infinite state systems

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL MODELS;

SYMBOLIC MODEL CHECKING; VERIFICATION OF INFINITE-STATE SYSTEMS;

CODES (SYMBOLS);

EID: 33646182258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562948_35     Document Type: Conference Paper

References (38)

1. P. A. Abdulla, A. Collomb-Annichini, A. Bouajjani, and B. Jonsson. Using forward reachability analysis for verification of lossy channel systems. FMSD, 25(1):39-65, 2004.
2. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. In Proc. CAV'00, LNCS 1855, pages 419-434, 2000.
3. A. Annichini, A. Bouajjani, and M. Sighireanu. TReX: A tool for reachability analysis of complex systems. In Proc. CAV'01, LNCS 2102, pages 368-372, 2001.
4. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, Pei-Hsin Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. TCS, 138(1):3-34, 1995.
5. R. Alur and D. L. Dill. A theory of timed automata. TCS, 126(2): 183-235, 1994.
6. ALV. www.cs.ucsb.edu/~bultan/composite/.
7. BABYLON. www.ulb.ac.be/di/ssd/lvbegin/CST/.
8. S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In Proc. CAV'03, LNCS 2725, pages 118-121, 2003
9. S. Bardin, A. Finkel and J. Leroux. FASTer acceleration of counter automata. In Proc. TACAS'04, LNCS 2988, pages 576-590, 2004.
10. C. Bartzis and T. Bultan. Widening arithmetic automata. In Proc, CAV'04, LNCS 3114, pages 321-333, 2004.
11. B. Boigelot, L. Bronne, and S. Rassart. Improved reachability analysis method for strongly linear hybrid systems. In Proc. CAV'97, LNCS 1254, pages 167-178, 1997.
12. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. SAS'97, LNCS 1302, pages 172-186, 1997.
13. A. Bouajjani, J. Esparza, A. Finkel, O. Maler, P. Rossmanith, B. Willems, and P. Wolper. An efficient automata approach to some problems on context-free grammars. IPL, 74(5-6):221-227, 2000.
14. A Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. TCS, 221(1-2):211-250, 1999.
15. A. Bouajjani, B. Jonsson, M. Nilsson and T. Touili. Regular Model Checking. Proc. CAV'00, LNCS 1855, pages 403-418, 2000.
16. A. Bouajjani, A. Muscholl, and T. Touili. Permutation rewriting and algorithmic verification. In Proc. LICS'01, pages 399-408, 2001.
17. D. Brand and P. Zafiropulo. On communicating finite-state machines. JACM, 30(2):323-342, 1983.
18. T. Bultan, R. Gerber, and W. Pugh. Symbolic model-checking of infinite state systems using Presburger arithmetic. In Proc. CAV'97, LNCS 1254, pages 400-411, 1997.
19. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
20. H. Comon and Y. Jurski. Multiple counters automata, safety analysis, and Presburger arithmetic. In Proc. CAV'98, LNCS 1427, pages 268-279, 1998.
21. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In Proc. CONCUR'99, LNCS 1664, pages 242-257, 1999.
22. P. Cousot. Abstract interpretation. ACM Comp. Surv., 28(2):324-328, 1996.
23. Ch. Darlot, A. Finkel, and L. Van Begin. About Fast and TReX accelerations. In Proc. AVoCS'04, ENTCS 128(6), pages 87-103, 2005.
24. G. Delzanno, J.-F. Raskin, and L. Van Begin. Covering sharing trees: a compact data structure for parameterized verification. JSTTT, 5(2-3):268-297, 2004.
25. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. Fund. Informaticae, 31(1):13-25, 1997.
26. A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In Proc. FSTTCS'02, LNCS 2556, pages 145-156, 2002.
27. A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems: Application to FIFO automata. Inf. & Comp., 181(1): 1-31, 2003.
28. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! TCS, 256(1-2):63-92, 2001.
29. L. Fribourg and H. Olsén. Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic, In Proc. CONCUR'97, LNCS 1243, pages 213-227, 1997.
30. L. Fribourg. Petri nets, flat languages and linear arithmetic. In M. Alpuente, editor, Proc. WFLP'00, pages 344-365, 2000.
31. O. H. Ibarra, Jianwen Su, Zhe Dang, T. Bultan, and R. A. Kemmerer. Counter machines and verification problems. TCS, 289(1):165-189, 2002.
32. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. TCS, 256(1-2):93-112, 2001.
33. LASH, www.montefiore.ulg.ac.be/~boigelot/research/lash/.
34. J. Leroux and G. Sutre. On flatness for 2-dimensional vector addition systems with states. In Proc. CONCUR '04, LNCS 3170, pages 402-416, 2004.
35. J. Leroux and G. Sutre. Flat counter automata almost everywhere! In Proc. ATVA'05, this volume.
36. J. K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In Proc. PSTV '87, pages 207-219, 1987.
37. T. Rybina and A. Voronkov. Brain: Backward reachability analysis with integers. In Proc. AMAST'02, LNCS 2422, pages 489-494, 2002.
38. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In Proc. CAV'98, LNCS 1427, pages 88-97, 1998.