SMT-based bounded model checking for real-time systems

Proceedings - International Conference on Quality Software

Volumn , Issue , 2008, Pages 120-125

  Xu, Liang ^a,b  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; DIGITAL ARITHMETIC; MODEL CHECKING; SPEECH TRANSMISSION; SURFACE MOUNT TECHNOLOGY;

BOUNDED MODEL CHECKING; CLOCK CONSTRAINTS; INTERNATIONAL CONFERENCES; LINEAR ARITHMETIC; QUALITY SOFTWARE; REAL VARIABLES; SAT SOLVING;

REAL TIME SYSTEMS;

EID: 52449109634     PISSN: 15506002     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QSIC.2008.10     Document Type: Conference Paper

References (25)

1. A. Armando, J. Mantovani and L. Platania. Bounded Model Checking of Software using SMT Solvers instead of SAT Solvers. SPIN 2006: 146-162.
2. S. Aggarwal and R. Kurshan. Modeling Elapsed Time in Protocol Specification. PSTV 1983: 51-62.
3. R. Alur, C. Courcoubetis and D. L. Dill. Model-Checking in Dense Real-time. Information and Computation 104(1): 2-34, 1993.
4. A. Biere, A. Cimatti, E. Clarke, M. Fujita, Y. Zhu. Symbolic Model Checking using SAT procedures instead of BDDs. Proceedings of ACM/IEEE Design Automation Conference (DAC99): 317-320.
5. A. Biere, A. Cimatti, E. Clarke, Y. Zhu. Symbolic Model Checking without BDDs. TACAS99: 193-207.
6. R. E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(12): 1035-1044, 1986.
7. A. Cimatti, E. M. Clarke, F. Giunchiglia and M. Roveri. NuSMV: A New Symbolic Model Verifier. CVA 1999: 495-499.
8. D. L. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. Automatic Verification Methods for Finite State Systems 1989: 197-212.
9. B. Dutertre and L. de Moura. A Fast Linear-Arithmetic Solver for DPLL(T). CAV 2006: 81-94.
10. E. A. Emerson and E. M. Clarke. Using Branching-time Temporal Logics to Synthesize Synchronization Skeletons. Science of Computer Programming 2(3): 241-266, 1982.
11. E. A. Emerson, A. Mok, A. P. Sistla and J. Srinivasan. Quantitative Temporal Reasoning. CAV 1990: 136-145.
12. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9: 105-131, 1995.
13. http://sal.csl.sri.com/index.shtml.
14. F. Jahanian and A.Mok. Safety Analysis of Timing Properties in Real-time Systems. IEEE Transactions on Software Engineering 12(9): 890-904, 1986.
15. R. Koymans. Specifying Real-Time Properties with Metric Temporal Logic. Real-Time Systems 2(4): 255-299 (1990).
16. K. G. Larsen, P. Pettersson, and Wang Yi. UPPAAL in a nutshell. J. Software Tools for Technology Transfer, 1(1-2): 134-152, 1997.
17. N. A. Lynch and H. Attiya. Using Mappings to Prove Timing Properties. PODC 1990: 265-280.
18. N. Markey and P. Schnoebelen. Symbolic Model Checking for Simply-timed Systems. FTRTFT 2004: 102-117.
19. W. Penczek, B. Wozna, and A. Zbrzezny. Bounded Model Checking for the Universal Fragment of CTL. Fundamenta Informaticae 51: 135-156, 2002.
20. W. Penczek, B. Wozna and A. Zbrzezny. Towards Bounded Model Checking for the Universal Fragment of TCTL. FTRTFT 2002: 265-290.
21. Gunter Rote. Crossing the bridge at night. Bulletin of the EATCS, 78: 241-246, 2002
22. L. Xu, W. Chen, Y. Xu, W. Zhang. Improved Bounded Model Checking for the Universal Fragment of CTL. JCST. To appear.
23. F. Yu, B. Y. Wang and Y. W. Huang. Bounded Model Checking for Region Automata. FTRTFT 2004: 246-262.
24. W. Zhang. SAT-Based Verification of LTL Formulas, FMICS 2006.
25. C. Zhou, Decheng Ding. Improved SAT Based Bounded Model Checking. TAMC 2006: 611-620.