An SMT approach to bounded model checking of design in state transition matrix

Proceedings - 2010 10th International Conference on Computational Science and Its Applications, ICCSA 2010

Volumn , Issue , 2010, Pages 231-238

  Kong, Weiqiang ^a   Shiraishi, Tomohiro ^a   Mizushima, Yuki ^a   Katahira, Noriyuki ^a   Fukuda, Akira ^b   Watanabe, Masahiko ^c  

^a Fukuoka Industry Science and Technology Foundation   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c CATS Co Ltd   (Japan)

Author keywords

Bounded model checking; Invariant properties; Satisfiability modulo theories; State transition matrix

Indexed keywords

ENCODING (SYMBOLS); MODELING LANGUAGES; SIGNAL ENCODING;

BOUNDED MODEL CHECKING; DISTRIBUTED SYSTEMS; FUNCTIONAL CORRECTNESS; INVARIANT PROPERTIES; PROTOTYPE IMPLEMENTATIONS; SATISFIABILITY MODULO THEORIES; STATE TRANSITION MATRIX; TABLE-BASED MODEL;

MODEL CHECKING;

EID: 84867421804     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCSA.2010.57     Document Type: Conference Paper

References (21)

1. CATS Co., Ltd., Japan, ZIPC Version 9.2, 2009.
2. SPIN Converter, URL: www.zipc.com/support/rre/spinconv/.
3. A. Armando, J. Mantovani and L. Platania, Bounded Model Checking of Software using SMT Solvers instead of SAT Solvers, In SPIN 2006, LNCS 3925, pp. 146-162, 2006.
4. A. Biere, A. Cimatti, E.M. Clarke and Y. Zhu, Symbolic Model Checking without BDDs, In TACAS 1999, LNCS 1579, pp. 193-207, Springer, 1999.
5. C. Barrett and C. Tinelli, Z3, In CAV 2007, LNCS 4590, pp. 298-302, Springer, 2007.
6. E. Clarke, D. Kroening, and F. Lerda, A Tool for Checking ANSI-C Programs, In TACAS 2004, LNCS 2988, pp. 168-176, Springer, 2004.
7. J. Dubrovin, T. Junttila, K. Heljanko, Symbolic step encodings for object based communicating state machines, In FMOODS 2008, LNCS 5051, pp. 96-112, Springer, 2008.
8. G. Holzmann, The Model Checker SPIN, IEEE Transactions on Software Engineering, Vol. 23, No. 5, pp. 279-295, 1997.
9. G. Holzmann, The SPIN Model Checker: Primer and Reference Mannual, ISBN 0-321-22862-6, Addison-Wesley, 2008.
10. T. Jussila, J. Dubrovin, T. Junttila, T. Latvala, I. Porres, Model checking dynamic and hierarchical UML state machines, In MoDeV2a 2006, pp. 94-110, 2006.
11. F. Laroussinie, N. Markey, and P, Schnoebelen, Temporal Logic with Forgettable Past, In LICS 2002, IEEE CS, pp. 383-392, 2002.
12. T. Latvala, A. Biere, K. Heljanko, and T. Junttila, Simple Bounded LTL Model Checking, In FMCAD 2004, LNCS 3312, pp. 186-200, Springer, 2005.
13. T. Latvala, A. Biere, K. Heljanko, and T. Junttila, Simple is Better: Efficient Bounded Model Checking for Past LTL, In VMCAI 2005, LNCS 3385, pp. 380-395, Springer, 2005.
14. L. Moura and N. Bjørner, Z3: An Efficient SMT Solver, In TACAS 2008, LNCS 4963, pp. 337-340, Springer, 2008.
15. M. Matsumoto, K. Anada, D. Ueshima, M. Watanabe, and A. Fukuda, Model Checking of State Transition Matrix, In ITSSV 2005, AIST Technical Report AIST-PS-2005-017, pp. 2-11, 2005.
16. R. Sebastiani, Lazy Satisfiability Modulo Theories, Journal on Satisfiability, Boolean Modeling and Computation, 3(2007): 141-224, 2007.
17. C. Barrett, R. Sebastiani, S. Seshia, and C. Tinelli, Satisfiability Modulo Theories, In Book: Handbook of Satisfiability, Edited by A. Biere, M. Heule, H. Maaren, and T. Walsh, ISBN 978-1-58603-929-5, IOS Press, 2009.
18. M. Watanabe, Extended Hierarchy State Transition Matrix Design Method-Version 2.0, CATS Technical Report, 1998.
19. B. Dutertre and L. de Moura, A Fast Linear-Arithmetic Solver for DPLL(T), In CAV 2006, LNCS 4144, pp. 81-94, Springer, 2006.
20. S. Ranise and C. Tinelli, The SMT-LIB Format: An Initial Proposal, In PDPAR 2003.
21. M. Veanes, N. Bjørner and Alexander Raschke, An SMT Approach to Bounded Reachability Analysis of Model Programs, In FORTE 2008, LNCS 5048, pp. 53-68, Springer, 2008.