Towards a model-checker for counter systems

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

Volumn 4218 LNCS, Issue , 2006, Pages 493-507

  Demri, S ^a   Finkel, A ^a   Goranko, V ^b   Van Drimmelen, G ^b  

^a CNRS   (France)

^b UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; INTEGER PROGRAMMING; VECTORS;

ADMISSIBLE COUNTER SYSTEMS (ACS); MODEL CHECKING; NATURAL NUMBERS; PRESBURGER ARITHMETIC;

COMPUTER SYSTEMS;

EID: 33845189713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901914_36     Document Type: Conference Paper

References (29)

1. [BCMS01] O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification of infinite structures. In Handbook of Process Algebra, pages 545-623. Elsevier, 2001.
2. [BDR03] V. Bruyère, E. Dall'Olio, and J.F. Raskin. Durations, parametric modelchecking in timed automata with presburger arithmetic. In STACS'03, volume 2607 of LNCS, pages 687-698. Springer, 2003.
3. [BEH95] A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In LICS '95, pages 123-133, 1995.
4. [BEM97] A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In CONCUR '97, volume 1243 of LNCS, pages 135-150. Springer, 1997.
5. [BFL04] S. Bardin, A. Finkel, and J. Leroux. FASTer acceleration of counter automata in practice. In TACAS'04, volume 2988 of LNCS, pages 576-590. Springer, March 2004.
6. [BFLP03] S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In CAV'03, volume 2725 of LNCS, pages 118-121. Springer, 2003.
7. [BFLS05] S. Bardin, A. Finkel, J. Leroux, and P. Schnoebelen. Flat acceleration in symbolic model checking. In ATVA '05, volume 3707 of LNCS, pages 474-488. Springer, 2005.
8. [BGP97] T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state systems using Presburger arithmetic. In CAV'97, volume 1254 of LNCS, pages 400-411. Springer, 1997.
9. [BH99] A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. TCS, 221(1-2):211-250, 1999.
10. [Boi98] B. Boigelot. Symbolic methods for exploring infinite state spaces. PhD thesis, Université de Liège, 1998.
11. [CC00] H. Comon and V. Cortier. Flatness is not a weakness. In CSL'00, volume 1862 of LNCS, pages 262-276. Springer, 2000.
12. [CJ98] H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger analysis. In CAV'98, volume 1427 of LNCS, pages 268-279. Springer, 1998.
13. [Cor02] V. Cortier. About the decision of reachability for register machines. Theoretical Informatics and Applications, 36(4):341-358, 2002.
14. [Dem06] S. Demri. Temporal logics. Lecture notes for MPRI, 2005/2006. www.lsv.ens-cachan.fr/~demri/.
15. [DPK03] Z. Dang, P. San Pietro, and R. Kemmerer. Presburger liveness verification of discrete timed automata. TCS, 299:413-438, 2003.
16. [EFM99] J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In LICS'99, pages 352-359, 1999.
17. [FL02] A. Finkel and J. Leroux. How to compose Presburger accelerations: Applications to broadcast protocols. In FST&TCS'02, volume 2256 of LNCS, pages 145-156. Springer, 2002.
18. [FO97] L. Fribourg and H. Olsén. Proving safety properties of infinite state systems by compilation into presburger arithmetic. In CONCUR '97, volume 1243 of LNCS, pages 213-227. Springer, 1997.
19. [FWW97] A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In INFINITY'97, volume 9 of ENTCS. Elsevier Science, 1997.
20. [Iba78] O. Ibarra. Reversal-bounded multicounter machines and their decision problems. JACM, 25(1):116-133, 1978.
21. +00] O. Ibarra, J. Su, Z. Dang, T. Bultan, and A. Kemmerer. Counter machines: Decidable properties and applications to verification problems. In MFCS'00, volume 1893 of LNCS, pages 426-435. Springer, 2000.
22. [Lag85] J. Lagarias. The 3x + 1 problem and its generalizations. The American Mathematical Monthly, 92(1):3-23, 1985.
23. [Ler03] J. Leroux. Algorithmique de la vérification des systèmes à compteurs. Approximation et accélération. Implementation de l'outil FAST. PhD thesis, ENS de Cachan, France, 2003.
24. [Ler06] J. Leroux. Regular acceleration for number decision diagrams. Technical Report 1385-06, LABRI, January 2006.
25. [LS05] J. Leroux and G. Sutre. Flat counter systems are everywherel In ATVA '05, volume 3707 of LNCS, pages 489-503. Springer, 2005.
26. [Min67] M. Minsky. Computation, Finite and Infinite Machines. Prentice Hall, 1967.
27. [SS04] T. Schuele and K. Schneider. Global vs. local model checking: A comparison of verification techniques for infinite state systems. In SEFM'04, pages 67-76. IEEE, 2004.
28. [Wal01] I. Wahikiewicz. Pushdown processes: games and model-checking. I & C, 164(2) :234-263, 2001.
29. [Wol83] P. Wolper. Temporal logic can be more expressive. I & C, 56:72-99, 1983.