Symbolic techniques for parametric reasoning about counter and clock systems

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

Volumn 1855, Issue , 2000, Pages 419-434

  Annichini, Aurore ^a   Asarin, Eugene ^a   Bouajjani, Ahmed ^b  

^a VERIMAG   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS;

ALGORITHMIC APPROACH; AUTOMATIC ANALYSIS; CLOCK SYSTEMS; EXTRAPOLATION TECHNIQUES; REACHABILITY ANALYSIS; RETRANSMISSIONS; SYMBOLIC REPRESENTATION; SYMBOLIC TECHNIQUES;

COMPUTER AIDED ANALYSIS;

EID: 84944407299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_32     Document Type: Conference Paper

References (30)

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.
2. P.A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani, and Y. Lakhnech, P. Habermehl. Verification of Infinite-State Systems by Combining Ab- straction and Reachability Analysis. In 11th Intern. Conf. on Computer Aided Verification (CAV'99). LNCS 1633, 1999.
3. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing Verification based on au- tomata emptiness. In RTSS'92. IEEE, 1992.
4. R. Alur and D. Dill. A Theory of Timed Automata. TCS, 126, 1994.
5. R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 592-601. ACM Press, 1993.
6. Tevfik Bultan, Richard Gerber, and Christopher League. Verifying systems with integer constraints and Boolean predicates: A composite approach. In Proc. of the Intern. Symp. on Software Testing and Analysis. ACM Press, 1998.
7. T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state systems using Presburger arithmetic. LNCS, 1254, 1997.
8. Tevfik Bultan, Richard Gerber, and William Pugh.: Model checking con- current systems with unbounded integer variables: Symbolic representations, approximations and experimental results. Tech. Rep. CS-TR-3870, University of Maryland, College Park, 1998.
9. B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. Lecture Notes in Computer Science, 818:55-67, 1994.
10. 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.
11. Patrick Cousot and Nicholas Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78. ACM, 1978.
12. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and presburger arithmetic. In CAV'98. LNCS 1427, 1998.
13. D. Dill. Timing assumptions and Verification of finite-state concurrent systems. In CAV'89. LNCS 407, 1989.
14. 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.
15. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The Tool KRONOS. In Hybrid Systems III, Verification and Control. LNCS 1066, 1996.
16. A. Dolzmann and T. Sturm. Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2-9, 1997.
17. A. Dolzmann, T. Sturm, and V. Weispfenning. A new approach for automatic theorem proving in real geometry. Automated Reasoning, 21(3):357-380, 1998.
18. J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A Protocol Validation and Verification Toolbox. In CAV'96. LNCS 1102, 1996.
19. L. Fribourg and H. Olsen. Reachability sets of parametrized rings as regular languages. In Infinity'97. volume 9 of Electronical Notes in Theo- retical Computer Science. Elsevier Science, 1997.
20. J-F. Groote and J. Van de Pol. A Bounded Retransmission Protocol for Large Data Packets. In AMAST'96. LNCS 1101, 1996.
21. N. Halbwachs. Delay Analysis in Synchronous Programs. In CAV'93. LNCS 697, 1993.
22. T. Henzinger, P.H. Ho, and H. Wong-Toi. A User Guide to HyTech. In TACAS'95. LNCS 1019, 1995.
23. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic Model- Checking for Real-Time Systems. In LICS'92. IEEE, 1992.
24. L. Helmink, M.P.A. Sellink, and F. Vaandrager. Proof checking a Data Link Protocol. In Types for Proofs and Programs. LNCS 806, 1994.
25. K. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using clock difference diagrams. In CAV'99. LNCS 1633, 1999.
26. K.G. Larsen, P. Pettersson, and W. Yi. UPPAAL: Status and Developments. In CAV'97. LNCS, 1997.
27. R. Mateescu.: Formal Description and Analysis of a Bounded Retrans- mission Protocol. Technical report no. 2965, INRIA, 1996.
28. J. Moller, J. Lichtenberg, H.R. Andersen, and H. Hulgaard.: Difference decision diagrams. Tech. rep it-tr-1999-023, Department of Information Technology, Technical University of Denmark, 1999.
29. A. Valmari. State generation with induction. In Scandinavian Conference on Artificial Intelligence, 1989.
30. S. Yovine. Model-checking timed automata. Embedded Systems, LNCS, 1998.