Bounded model checking for timed systems

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

Volumn 2529 LNCS, Issue , 2002, Pages 243-259

  Audemard, G ^a   Cimatti, A ^a   Kornilowicz, A ^a   Sebastiani, R ^a,b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; TIME SHARING SYSTEMS;

BOUNDED MODEL CHECKING; FINITE-STATE; MODEL CHECKING PROBLEM; REAL-WORLD; SATISFIABILITY; STATE COMPONENT; SYMBOLIC VERIFICATION; TIMED SYSTEMS; TIMING ASPECTS; VERIFICATION TECHNIQUES;

MODEL CHECKING;

EID: 85120521193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36135-9_16     Document Type: Conference Paper

References (22)

1. G. Audemard, P. Bertoli, A. Cimatti, A. Korni lowicz, and R. Sebastiani. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In Proc. CADE’2002., 2002.
2. R. Alur. Timed Automata. In Proc. CAV’99, pages 8–22, 1999.
3. A. Biere, A. Cimatti, E. M. Clarke, and Yunshan Zhu. Symbolic Model Checking without BDDs. In Proc. TACAS’99, pages 193–207, 1999.
4. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In A. J. Hu and M. Y. Vardi, editors, Proc. 10th International Conference on Computer Aided Verification, Vancouver, Canada, volume 1427 of LNCS, pages 546–550. Springer-Verlag, 1998.
5. F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Proc. CAV’2001, LNCS. Springer, 2001.
6. David L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, pages 197–212. Springer-Verlag, June 1989.
7. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
8. C. Daws and S. Yovine. Two examples of verification of multirate timed automata with kronos. In Proc. 16th IEEE Real-Time Systems Symposium, pages 66–75, 1995.
9. E.A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995–1072. Elsevier Science Publisher B.V., 1990.
10. E. Giunchiglia, A. Massarotto, and R. Sebastiani. Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability. In Proc. AAAI’98, pages 948–953, 1998.
11. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.
12. [LA97] Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 366–371, 1997.
13. L. Lamport. A Fast Mutual-exclusion Algorithm. ACM Transactions on Computer Systems, 5(1), 1987.
14. K. G. Larsen, P. Pettersson, and W. Yi. Model-Checking for Real-Time Systems. In Fundamentals of Computation Theory, pages 62–88, 1995.
15. [LWYP98] K.G. Larsen, C. Weise, W. Yi, and J. Pearson. Clock difference diagrams. Technical Report 98/99, DoCS, Uppsala University, Sweden, 1998.
16. J. Moeller, J. Lichtenberg, H. Andersen, and H. Hulgaard. Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams. In Electronic Notes in Theoretical Computer Science, volume 23. Elsevier Science, 2001.
17. P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, and O. Maler. Verification of Timed Automata via Satisfiability Checking. In Proc. of FTRTFT’02, LNCS. Springer-Verlag, 2002.
18. W. Penczek, B. Woźna, and A. Zbrzezny. Towards bounded model checking for the universal fragment of TCTL. In Proc. of FTRTFT’02, LNCS. Springer-Verlag, 2002.
19. R. Sebastiani. Integrating SAT Solvers with Math Reasoners: Foundations and Basic Algorithms. Technical Report 0111-22, ITC-IRST, November 2001.
20. Ofer Shtrichmann. Tuning SAT Checkers for Bounded Model Checking. In Proc. CAV’2000, volume 1855 of LNCS. Springer, 2000.
21. Maria Sorea. Bounded model checking for timed automata. ENTCS, 68(5), 2002.
22. Farn Wang. Efficient data structure for fully symbolic verification of real-time software systems. In Tools and Algorithms for Construction and Analysis of Systems, pages 157–171, 2000.