Efficient modeling of concurrent systems in BMC

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

Volumn 5156 LNCS, Issue , 2008, Pages 114-133

  Ganai, Malay K ^a   Gupta, Aarti ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; SEMANTICS; SPIN DYNAMICS; TECHNICAL PRESENTATIONS;

BOUNDED MODEL CHECKING; CASE STUDIES; CONCURRENCY SEMANTICS; CONCURRENT SYSTEMS; DATA RACES; EFFICIENT; EFFICIENT METHODS; INTERLEAVING SEMANTICS; MODELING; SAFETY PROPERTIES; SCALE-UP; SEQUENTIAL CONSISTENCIES; SHARED VARIABLES; VERIFICATION RESULTS;

MODEL CHECKING;

EID: 54249087637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85114-1_10     Document Type: Conference Paper

References (32)

1. Adve, S.V., Gharachorloo, K.: Shared memory consistency models: A tutorial. IEEE Computer, Los Alamitos (1996)
2. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM (1978)
3. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579. Springer, Heidelberg (1999)
4. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
5. Ramalingam, G.: Context sensitive synchronization sensitive analysis is undecidable. In: ACM Transactions on Programming Languages and Systems (2000)
6. Godefroid, P.: Model checking for programming languages using verisoft. In: Proc. of POPL (1997)
7. Andrews, T., Qadeer, S., Rajamani, S.K., Rehof, J., Xie, Y.: ZING: Exploiting program structure for model checking concurrent software. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 1-15. Springer, Heidelberg (2004)
8. Godefroid, P.: Partial-order Methods for the Verification of Concurrent Systems: An Approach to the State-explosion Problem. PhD thesis (1995)
9. Flanagan, C., Qadeer, S.: Transactions for software model checking. In: Proc. of TACAS (2003)
10. Stoller, S.D.: Model-checking multi-threaded distributed Java programs. Journal on STTT (2002)
11. Stoller, S.D., Cohen, E.: Optimistic synchronization-based state-space reduction. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 489-504. Springer, Heidelberg (2003)
12. Levin, V., Palmer, R., Qadeer, S., Rajamani, S.K.: Sound transaction-based reduction without cycle detection. In: Proc. of SPIN Workshop (2003)
13. Alur, R., Brayton, R.K., Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Partial-order reduction in symbolic state space exploration. In: Proc. of CAV, pp. 340-351 (1997)
14. Kahlon, V., Gupta, A., Sinha, N.: Symbolic model checking of concurrent programs using partial orders and on-the-fly transactions. In: Proc. of CAV (2006)
15. Rabinovitz, I., Grumberg, O.: Bounded model checking of concurrent programs. In: Proc. of CAV (2005)
16. Lerda, F., Sinha, N., Theobald, M.: Symbolic model checking of software. Electronic Notes Theoretical Computer Science (2003)
17. Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005)
18. Grumberg, O., Lerda, F., Strichman, O., Theobald, M.: Proof-guided Underapproximation-Widening for Multi-process Sytems. In: Proc. of POPL (2005)
19. Cook, B., Kroening, D., Sharygina, N.: Symbolic Model Checking for Asynchronous Boolean Programs. In: Proc. of SPIN Workshop (2005)
20. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
21. Ganai, M.K., Gupta, A.: Accelerating high-level bounded model checking. In: Proc. of ICCAD (2006)
22. Adve, S.V., Hill, M.D., Miller, B.P., Netzer, R.H.B.: Detecting data races on weak memory systems. In: Proc. of ISCA (1991)
23. Yang, Y., Gopalakrishnan, G., Lindstrom, G.: Memory-model-sensitive data race analysis. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 30-45. Springer, Heidelberg (2004)
24. Burckhardt, S., Alur, R., Martin, M.M.K.: CheckFence: Checking consistency of concurrent data types on relaxed memory models. In: Proc. of PLDI (2007)
25. Yang, Y., Gopalakrishnan, G., Lindstrom, G., Slind, K.: Nemos: A framework for axiomatic and executable specifications of memory consistency models. In: Proc. of IPDPS (2004)
26. Voung, J.W., Jhala, R., Lerner, S.: Relay: static race detection on millions of lines of code. In: ESEC/SIGSOFT FSE, pp. 205-214 (2007)
27. Naik, M., Aiken, A.: Conditional must not aliasing for static race detection. In: Proc. of POPL, pp. 327-338 (2007)
28. Ivančić, F., Yang, Z., Ganai, M.K., Gupta, A., Ashar, P.: Efficient SAT-based Bounded Model Checking for Software Verification. In: Margaria, T., Steffen, B. (eds.) ISoLA 2004. LNCS, vol. 4313. Springer, Heidelberg (2006)
29. Ganai, M.K., Gupta, A.: Completeness in SMT-based BMC for software programs. In: Proc. of DATE (2008)
30. Joint CAV/ISSTA Special Event. Specification, Verification, and Testing of Concurrent Software (2004), http://research.microsoft.com/~quadeer/cav-issta. htm
31. SRI. Yices: An SMT solver, http://fm.csl.sri.com/yices
32. Kroening, D., Clarke, E., Yorav, K.: Behavioral consistency of C and verilog programs using bounded model checking. In: Proc. of DAC (2003)