Verifying multi-threaded software using SMT-based context-bounded model checking

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2011, Pages 331-340

  Cordeiro, Lucas ^a   Fischer, Bernd ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

formal software verification; multi threaded systems; sat modulo theories; symbolic and explicit model checking

Indexed keywords

ABSTRACTION REFINEMENT; BOUNDED MODEL; BOUNDED MODEL CHECKING; CONTEXT SWITCH; CONTEXT-BOUNDED MODEL CHECKING; EXPLICIT MODEL CHECKING; FORMAL SOFTWARE VERIFICATIONS; INTERLEAVINGS; MODEL CHECK; MULTI-THREADED SYSTEM; MULTITHREADED SOFTWARES; PTHREADS; SAT MODULO THEORIES; SATISFIABILITY MODULO THEORIES; SHARED VARIABLES; STATE SPACE; SYNCHRONIZATION PRIMITIVE; UNDER-APPROXIMATION;

ABSTRACTING; C (PROGRAMMING LANGUAGE); SOFTWARE ENGINEERING;

MODEL CHECKING;

EID: 79959878971     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1985793.1985839     Document Type: Conference Paper

References (29)

1. A. Armando, J. Mantovani, and L. Platania. Bounded model checking of software using SMT solvers instead of SAT solvers. STTT, vol. 11 (1), pp. 69-83, 2009.
2. C. Baier and J.-P. Katoen. Principles of Model Checking. MIT Press, 2008.
3. A. Biere. Bounded model checking. In Handbook of Satisfiability, pp. 457-481. 2009.
4. A. Cimatti et al. Verifying SystemC: a software model checking approach. FMCAD, 2010.
5. E. Clarke, D. Kroening, and F. Lerda A tool for checking ANSI-C programs. TACAS, LNCS 2988, pp. 168-176, 2004.
6. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav SATABS: SAT-based predicate abstraction for ANSI-C. TACAS, LNCS 3440, pp. 570-574, 2005.
7. L. Cordeiro et al. Agile development methodology for embedded systems: A platform-based design approach. ECBS, pp. 195-202, 2007.
8. L. Cordeiro, B. Fischer, and J. Marques-Silva. SMT-based bounded model checking for embedded ANSI-C software. ASE, pp. 137-148, 2009.
9. T. H. Cormen et al. Introduction to algorithms. Second edition, 2001.
10. L. M. de Moura and N. Bjørner. Z3: An efficient SMT solver. TACAS, LNCS 4963, pp. 337-340, 2008.
11. L. M. de Moura and N. Bjørner. Proofs and refutations, and Z3. In LPAR Workshops, 2008.
12. M. K. Ganai and A. Gupta. Accelerating high-level bounded model checking. ICCAD, pp. 794-801, 2006.
13. M. K. Ganai and A. Gupta. Efficient modeling of concurrent systems in BMC. SPIN, LNCS 5156, pp. 114-133, 2008.
14. N. Ghafari, A. Hu, and Z. Rakamaric. Context-bounded translations for concurrent software: An empirical evaluation. SPIN, LNCS 6349, pp. 227-244, 2010.
15. O. Grumberg et al. Proof-guided underapproximation-widening for multi-process systems. POPL, pp. 122-131, 2005.
16. V. Kahlon et al. Semantic reduction of thread interleavings in concurrent programs. TACAS, LNCS 5505, pp. 124-138, 2009.
17. V. Kahlon, C. Wang, and A. Gupta. Monotonic partial order reduction: An optimal symbolic partial order reduction technique. CAV, LNCS 5643, pp. 398-413, 2009.
18. A. Lal and T. Reps. Reducing concurrent analysis under a context bound to sequential analysis. Form. Methods Syst. Des., 35(1):73-97, 2009.
19. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. TACAS, LNCS 2619, pp. 2-17, 2003.
20. F. Mueller. A library implementation of posix threads under unix. USENIX, pp. 29-41, 1993.
21. M. Musuvathi and S. Qadeer. Iterative context bounding for systematic testing of multithreaded programs. PLDI, pp. 446-455, 2007.
22. http://www.nxp.com/, 2009.
23. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. TACAS, LNCS 3440, pp. 93-107, 2005.
24. S. Qadeer and D. Wu. Kiss: keep it simple and sequential. In PLDI, pp. 14-24, 2004.
25. I. Rabinovitz and O. Grumberg. Bounded model checking of concurrent programs. CAV, LNCS 3576, pp. 82-97, 2005.
26. N. Rungta and E. G. Mercer. Clash of the titans: tools and techniques for hunting bugs in concurrent programs. PADTAD, pp. 1-10, 2009.
27. SMT-LIB. The Satisfiability Modulo Theories Library. http://combination. cs.uiowa.edu/smtlib, 2009.
28. S. L. Torre, P. Madhusudan, and G. Parlato. Reducing context-bounded concurrent reachability to sequential reachability. CAV, LNCS 5643, pages 477-492, 2009.
29. http://www.cs.utah.edu/, 2010.