Bounded model checking for region automata

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

Volumn 3253, Issue , 2004, Pages 246-262

  Yu, Fang ^a   Wang, Bow Yaw ^a   Huang, Yao Wen ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; REAL TIME SYSTEMS; TIME SHARING SYSTEMS; VERIFICATION;

BOUNDED MODEL CHECKERS; BOUNDED MODEL CHECKING; PRACTICAL METHOD; PROGRAM VARIABLES; REACHABILITY PROBLEM; SOFTWARE VERIFICATION; TRADITIONAL MODELS; TRANSITION RELATIONS;

MODEL CHECKING;

EID: 33746905282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_18     Document Type: Article

References (29)

1. Alur, R., Courcoubetis, C. and Dill, D.,"Model-checking for Real-time Systems." In IEEE 5th Annual Symposium on Logic In Computer Science (LICS), Philadelphia, June 1990.
2. Alur, R. and D. L. Dill, "A Theory of Timed Automata." Theoretical Computer Science 126, pp. 183-235, 1994
3. Amla, N., Kurshan, R., McMillan, K. and Medel, R. K., "Experimental Analysis of Different Techniques for Bounded Model Checking." In Proc. TACAS'03, LNCS, Poland, 2003.
4. Asarin, E., Bozga, M., Kerbrat, A., Maler, O., Pnueli, A. and Rasse, A., "Data-structures for the Verification of Timed Automata." In Proc. HART'97, LNCS 1201, pp. 346-360, 1997.
5. TAudemard, G., Cimatti, A., Korniowicz, A. and Sebastiani, R., "Bounded Model Checking for Timed Systems." In Doron Peled and Moshe Y. Vardi, editors, Formal Techniques for Networked and Distributed Systems - FORTE'02, LNCS 2529, pp. 243-259, 2002.T
6. thP CAV, LNCS 818, 1998.
7. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y., "Symbolic Model Checking Using SAT Procedures Instead of BDDs." In Proc. DAC'99, pp. 317-320, 1999.T
8. Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S. and Yovine, S., "Kronos: a Model-Checking Tool for Real-Time Systems." In Proc. of the 10th Conference on Computer-Aided Verification, CAV'98. LNCS 1427, Springer-Verlag, 1998.T
9. Clarke, E., Biere, A., Raimi, R.,and Zhu, Y., "Bounded Model Checking Using Satisfiability Solving." In Formal Methods in System Design, July 2001.
10. Clarke, E., Kroening, D., Yorav, K., "Behavioral Consistency of C and Verilog Programs using Bounded Model Checking." In Proc. DAC'03, Session 23.3, Anaheim, CA, 2003.
11. Göllü, A., Puri, A., and Varaiya, P., "Discretization of timed automata." In Proc. of the 33rd IEEE conferene on decision and control, pp. 957-958, 1994.
12. Henzinger, T.A., Nicollin, X., Sifakis, J. and Yovine, S., "Symbolic Model Checking for Real-Time Systems." Information and Computation, Vol. III, pp. 193-244, 1994.
13. Huang, Y.-W., Yu, F., Hang, C., Tsai, C.-H., Lee, D.-T. and Kuo, S.-Y., "Verifying Web Applications Using Bounded Model Checking." In Proc. DSN'04, Italy, June, 2004.
14. Laroussinie, F., Larsen, K. G. and Weise, C., "From timed automata to logic - and back." In Proc. MFCS'95, LNCS 969, pp. 529-539
15. Larsen, K. G., Pettersson, P., and Wang, Y., "Compositional and Symbolic Model Checking of Real-time System." In Proc. RTSS'95, Pisa, Italy, 1995.
16. Larsen, K. G., Pettersson, P., and Wang, Y., "UPPAAL in a Nutshell." In Int. Journal on Software Tools for Technology Transfer 1(1-2), pp. 134-152, 1998.
17. Lu, Feng, Wnag, Li-C., Cheng, Kwang-Ting, Huan, Rie C-Y, "A Circuit SAT Solver With Signal Correlation Guided Learning." In Proc. DATE'03, March, 2003.
18. Moller, M. O., Rue, H., and Sorea, M., "Predicate Abstraction for Dense Real-time Systems." in Theory and Practice of Timed Systems (TPTS'2002), 2002.
19. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L. and Malik, S., "Chaff: Engineering an Efficient SAT Solver." In Proc. DAC'01, June 2001.
20. de Moura, L., Rueß, H. and Sorea, M., "Lazy Theorem Proving for Bounded Model Checking over Infinite Domains." In Proc. CADE'02, LNCS 2392, pp. 438-455, 2002.
21. de Moura, L., Owre, S., Rueß, H., Rushby, J., Shanker, N. and Sorea, M., "SAL 2." In Proc. CAV'04, 2004.
22. Niebert, P., Mahfoudh, M., Asarin, E., Bozga, M., Jain, N., and Maler, O., "Verification of Timed Automata via Satisfiability Checking." In Proc. FTRTFT'02, LNCS 2469, 2002.
23. Penczek, W., Wozna, B. and Zbrzezny, A., 'Towards Bounded Model Checking for the Universal Fragment of TCTL." In Proc. FTRTFT'02, LNCS 2469, pp. 265-288, 2002.
24. Seshia, S. A-, BryantT, TR. E., T"Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods." In Proc.T CAV'03. LNCS 2725, Springer-Verlag, 2003.
25. Sorea, M.,"Bounded Model Checking for Timed Automata." CSL Technical Report SRICSL-02-03, 2002.
26. Wang, F., "Efficient Verification of Timed Automata with BDD-like Data-Structures." In Proc. VMCAI'03, LNCS 2575, Springer-Verlag, 2003.
27. Wozna, B., Penczek, W. and Zbrzezny, A., "Checking Reachability Properties for Timed Automata via SAT." Fundamenta Informaticae, Vol. 55(2), pp. 223-241, 2003.
28. Yovine, S., "Model-checking Timed Automata." Embedded Systems, LNCS 1494, 1998.
29. Yu, F. and Wang, B.-Y. 'Toward Unbounded Model Checking for Region Automata." Paper Submitted.