Exploiting step semantics for efficient bounded model checking of asynchronous systems

Science of Computer Programming

Volumn 77, Issue 10-11, 2012, Pages 1095-1121

  Dubrovin, Jori ^a   Junttila, Tommi ^a   Heljanko, Keijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Asynchronous systems; Bounded model checking; Process semantics; SMT; Step encodings

Indexed keywords

ASYNCHRONOUS SYSTEM; BENCHMARK SUITES; BOUNDED MODEL CHECKING; DATA MANIPULATIONS; ENCODINGS; EXPLICIT-STATE MODEL; LOW LEVEL; MODELING FORMALISMS; PARTIAL ORDER SEMANTICS; PROCESS SEMANTICS; SIMPLE MODELING; TRANSITION RELATIONS;

ENCODING (SYMBOLS); MODEL CHECKING; SURFACE MOUNT TECHNOLOGY;

SEMANTICS;

EID: 84861624565     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2011.07.005     Document Type: Conference Paper

References (45)

1. E.M. Clarke Jr., O. Grumberg, and D.A. Peled Model Checking 1999 The MIT Press
2. C. Baier, and J.-P. Katoen Principles of Model Checking 2008 The MIT Press
3. 20 states and beyond Information and Computation 98 2 1992 142 170
4. A. Biere, A. Cimatti, E.M. Clarke, and Y. Zhu Symbolic model checking without BDDs Proc. TACAS 1999 LNCS vol. 1579 1999 Springer 193 207
5. J. Marques-Silva, I. Lynce, and S. Malik CDCL solvers Handbook of Satisfiability 2009 IOS Press 131 153
6. C. Barrett, R. Sebastiani, S.A. Seshia, and C. Tinelli Satisfiability modulo theories Handbook of Satisfiability 2009 IOS Press 825 885
7. A. Biere, K. Heljanko, T. Junttila, T. Latvala, and V. Schuppan Linear encodings of bounded LTL model checking Logical Methods in Computer Science 2 5:5 2006 1 64
8. G.J. Holzmann The model checker Spin IEEE Transactions on Software Engineering 23 5 1997 279 295
9. J. Barnat, L. Brim, and P. Ročkai DiVinE 2.0: high-performance model checking Proc. HiBi 2009 2009 IEEE Computer Society Press 31 32
10. A. Valmari The state explosion problem Lectures on Petri Nets I: Basic Models LNCS vol. 1491 1998 Springer 429 528
11. E. Best, and R.R. Devillers Sequential and concurrent behaviour in Petri net theory Theoretical Computer Science 55 1 1987 87 136
12. K. Heljanko Bounded reachability checking with process semantics Proc. CONCUR 2001 LNCS vol. 2154 2001 Springer 218 232
13. J. Rintanen, K. Heljanko, and I. Niemelä Planning as satisfiability: parallel plans and algorithms for plan search Artificial Intelligence 170 12-13 2006 1031 1080
14. H.A. Kautz, and B. Selman Pushing the envelope: planning, propositional logic and stochastic search Proc. AAAI'96/IAAI'96, vol. 2 1996 AAAI Press 1194 1201
15. J. Malinowski, and P. Niebert SAT based bounded model checking with partial order semantics for timed automata J. Esparza, R. Majumdar, TACAS Lecture Notes in Computer Science vol. 6015 2010 Springer 405 419
16. Y. Dimopoulos, B. Nebel, and J. Koehler Encoding planning problems in nonmonotonic logic programs Proc. ECP 1997 LNCS vol. 1348 1997 Springer 169 181
17. M. Wehrle, and J. Rintanen Planning as satisfiability with relaxed ∃-step plans AI 2007: Advances in Artificial Intelligence LNCS vol. 4830 2007 Springer 244 253
18. S. Ogata, T. Tsuchiya, and T. Kikuno SAT-based verification of safe Petri nets Proc. ATVA 2004 LNCS vol. 3299 2004 Springer 79 92
19. T. Jussila BMC via dynamic atomicity analysis Proc. ACSD 2004 2004 IEEE Computer Society 197 206
20. T. Jussila, K. Heljanko, and I. Niemelä BMC via on-the-fly determinization International Journal on Software Tools for Technology Transfer 7 2 2005 89 101
21. T. Jussila, On bounded model checking of asynchronous systems, Research Report A97, Helsinki University of Technology, Laboratory for Theoretical Computer Science, doctoral dissertation, 2005.
22. J. Dubrovin, T. Junttila, and K. Heljanko Symbolic step encodings for object based communicating state machines Proc. FMOODS 2008 LNCS vol. 5051 2008 Springer 96 112
23. C. Wang, Z. Yang, V. Kahlon, and A. Gupta Peephole partial order reduction Proc. TACAS 2008 LNCS vol. 4963 2008 Springer 382 396
24. V. Kahlon, C. Wang, and A. Gupta Monotonic partial order reduction: an optimal symbolic partial order reduction technique Proc. CAV 2009 LNCS vol. 5643 2009 Springer 398 413
25. S. Burckhardt, R. Alur, and M.M.K. Martin CheckFence: checking consistency of concurrent data types on relaxed memory models Proc. PLDI 2007 2007 ACM 12 21
26. J. Dubrovin Checking bounded reachability in asynchronous systems by symbolic event tracing Proc. VMCAI 2010 LNCS vol. 5944 2010 Springer 146 162
27. K.L. McMillan Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits Proc. CAV 1992 LNCS vol. 663 1993 Springer 164 177
28. J. Esparza, and K. Heljanko Unfoldings - a partial-order approach to model checking EATCS Monographs in Theoretical Computer Science 2008 Springer-Verlag
29. S. Ranise, C. Tinelli, The SMT-LIB standard: Version 1.2, 2006.
30. T. Bultan, R. Gerber, and W. Pugh Symbolic model checking of infinite state systems using Presburger arithmetic Proc. CAV 1997 LNCS vol. 1254 1997 Springer 400 411
31. S. Graf, and H. Saïdi Construction of abstract state graphs with PVS Proc. CAV 1997 LNCS vol. 1254 1997 Springer 72 83
32. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar Symbolic model checking with rich assertional languages Theoretical Computer Science 256 1-2 2001 93 112
33. T. Rybina, and A. Voronkov A logical reconstruction of reachability Proc. PSI 2003 LNCS vol. 2890 2003 Springer 222 237
34. P.A. Abdulla, G. Delzanno, and A. Rezine Parameterized verification of infinite-state processes with global conditions Proc. CAV 2007 LNCS vol. 4590 2007 Springer 145 157
35. A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu Rewriting systems with data Proc. FCT 2007 LNCS vol. 4639 2007 Springer 1 22
36. S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli Towards SMT model checking of array-based systems Proc. IJCAR 2008 LNCS vol. 5195 2008 Springer 67 82
37. R. Pelánek BEEM: benchmarks for explicit model checkers Proc. SPIN 2007 LNCS vol. 4595 2007 Springer 263 267
38. T. Junttila, and J. Dubrovin Encoding queues in satisfiability modulo theories based bounded model checking Proc. LPAR 2008 LNCS vol. 5330 2008 Springer 290 304
39. SRI International, Yices 2.0 prototype, software, 2009. URL: http://yices.csl.sri.com/download-yices2.shtml.
40. R. Brummayer, and A. Biere Boolector: an efficient SMT solver for bit-vectors and arrays TACAS LNCS vol. 5505 2009 Springer 174 177
41. N. Eén, and N. Sörensson Temporal induction by incremental SAT solving Electronic Notes in Theoretical Computer Science 89 4 2003 543 560
42. D.H. Younger Minimum feedback arc sets for a directed graph IEEE Transactions on Circuit Theory 10 2 1963 238 245
43. V. Diekert, and Y. Métivier Partial Commutation and Traces Handbook of Formal Languages vol. 3 1997 Springer Berlin 457 534
44. K. Heljanko, and I. Niemelä Bounded LTL model checking with stable models Theory and Practice of Logic Programming 3 4-5 2003 519 550
45. K.L. McMillan Interpolation and SAT-based model checking Proc. CAV 2003 LNCS vol. 2725 2003 Springer 1 13