Automatic discovery of transition symmetry in multithreaded programs using dynamic analysis

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

Volumn 5578 LNCS, Issue , 2009, Pages 279-295

  Yang, Yu ^a   Chen, Xiaofang ^a   Gopalakrishnan, Ganesh ^a   Wang, Chao ^b  

^a University of Utah   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC DISCOVERY; CONCURRENT PROGRAM; CONCURRENT SOFTWARE; DISCOVERY ALGORITHM; DYNAMIC PROGRAM ANALYSIS; DYNAMIC VERIFICATIONS; LOCAL STATE; MULTI-THREADED APPLICATION; MULTI-THREADED PROGRAMS; SEARCH SPACES; STATE SPACE; SYMMETRY REDUCTION;

ALGORITHMS; COMPUTER SOFTWARE SELECTION AND EVALUATION; DYNAMIC ANALYSIS; DYNAMIC MODELS; MULTITASKING; SPIN DYNAMICS;

MODEL CHECKING;

EID: 70350627101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02652-2_22     Document Type: Conference Paper

References (27)

1. Godefroid, P.: Model Checking for Programming Languages using Verisoft. In: POPL, pp. 174-186 (1997)
2. Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: Ferrante, J., McKinley, K.S. (eds.) PLDI, pp. 446-455. ACM, New York (2007)
3. Yang, Y., Chen, X., Gopalakrishnan, G.: Inspect: A Runtime Model Checker for Multithreaded C Programs. Technical Report UUCS-08-004, University of Utah (2008)
4. Flanagan, C., Godefroid, P.: Dynamic Partial-order Reduction for Model Checking Software. In: Palsberg, J., Abadi, M. (eds.) POPL, pp. 110-121. ACM, New York (2005)
5. Yang, Y., Chen, X., Gopalakrishnan, G., Kirby, R.M.: Efficient stateful dynamic partial order reduction. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 288-305. Springer, Heidelberg (2008)
6. Wang, C., Yang, Y., Gupta, A., Gopalakrishnan, G.: Dynamic model checking with property driven pruning to detect race conditions. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 126-140. Springer, Heidelberg (2008)
7. Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Form. Methods Syst. Des. 9(1-2), 77-104 (1996)
8. Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Form. Methods Syst. Des. 9(1-2), 105-131 (1996)
9. Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods in System Design 9(1/2), 41-75 (1996)
10. Godefroid, P.: Exploiting symmetry when model-checking software. In: FORTE. IFIP Conference Proceedings, vol. 156, pp. 257-275. Kluwer, Dordrecht (1999)
11. Havelund, K., Pressburger, T.: Model Checking Java Programs using Java PathFinder. STTT 2(4), 366-381 (2000)
12. Zaks, A., Joshi, R.: Verifying multi-threaded c programs with SPIN. In: Havelund, K., Ma-jumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 325-342. Springer, Heidelberg (2008)
13. http://www.cs.utah.edu/~yuyang/inspect/
14. Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. Springer, Heidelberg (1996)
15. Necula, G.C., McPeak, S., Rahul, S.P., Weimer, W.: CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, pp. 213-228. Springer, Heidelberg (2002)
16. http://freshmeat.net/projects/aget/
17. http://freshmeat.net/projects/pfscan
18. Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: DAC, pp. 731-736. ACM, New York (2002)
19. Chai, D., Kuehlmann, A.: Building a better boolean matcher and symmetry detector. In: DATE, pp. 1079-1084 (2006)
20. Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for CNF. In: DAC, pp. 530-534. ACM, New York (2004)
21. Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: SIMA Workshop on Algorithm Engineering and Experiments (2007)
22. Darga, P.T., Sakallah, K.A., Markov, I.L.: Faster symmetry discovery using sparsity of symmetries. In: DAC, pp. 149-154. ACM, New York (2008)
23. Wahl, T.: Adaptive symmetry reduction. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 393-405. Springer, Heidelberg (2007)
24. Lerda, F., Visser, W.: Addressing dynamic issues of program model checking. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 80-102. Springer, Heidelberg (2001)
25. Iosif, R.: Exploiting heap symmetries in explicit-state model checking of software. In: 16th IEEE International Conference on Automated Software Engineering (ASE 2001), Coronado Island, San Diego, CA, USA, November 26-29, 2001, pp. 254-261. IEEE Computer Society, Los Alamitos (2001)
26. Iosif, R.: Symmetry reductions for model checking of concurrent dynamic software. STTT 6(4), 302-319 (2004)
27. Visser, W., Pasareanu, C.S., Pelánek, R.: Test input generation for java containers using state matching. In: Pollock, L.L., Pezzè, M. (eds.) Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2006, Portland, Maine, USA, July 17-20, 2006, pp. 37-48. ACM, New York (2006)