메뉴 건너뛰기




Volumn , Issue , 2007, Pages 446-455

Iterative context bounding for systematic testing of multithreaded programs

Author keywords

Concurrency; Context bounding; Model checking; Multithreading; Partial order reduction; Shared memory programs; Software testing

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; MODEL CHECKING;

EID: 35448945590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250734.1250785     Document Type: Conference Paper
Times cited : (249)

References (24)
  • 1
    • 0005257219 scopus 로고    scopus 로고
    • Systematic testing of multithreaded Java programs
    • Technical Report LCS-TM-607, MIT/LCS
    • Derek Bruening and John Chapin. Systematic testing of multithreaded Java programs. Technical Report LCS-TM-607, MIT/LCS, 2000.
    • (2000)
    • Bruening, D.1    Chapin, J.2
  • 2
    • 85037030721 scopus 로고
    • Synthesis of synchronization skeletons for branching time temporal logic
    • Logic of Programs, 13.1, Springer-Verlag
    • E. M. Clarke and E. A. Emerson, Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs, LNCS 13.1, pages 52-71. Springer-Verlag, 1981.
    • (1981) LNCS , pp. 52-71
    • Clarke, E.M.1    Emerson, E.A.2
  • 3
    • 4444321661 scopus 로고    scopus 로고
    • Exploiting object excape and locking information in partial-order reductions for concurrent object-oriented programs
    • Matthew B. Dwyer, John Hatcliff, Robby, and Venkatesh Prasad Ranganath. Exploiting object excape and locking information in partial-order reductions for concurrent object-oriented programs. Formal Methods in System Design, 25:199-240, 2004.
    • (2004) Formal Methods in System Design , vol.25 , pp. 199-240
    • Dwyer, M.B.1    John Hatcliff, R.2    Prasad Ranganath, V.3
  • 4
    • 34547416218 scopus 로고    scopus 로고
    • Shaz Qadeer, and Serdar Tasiran. Goldilocks: Efficiently computing the happens-before relation using locksets
    • FATES/RV 06: Formal Approaches to Testing and Runtime Verification, of, Springer-Verlag
    • Tayfun. Elmas, Shaz Qadeer, and Serdar Tasiran. Goldilocks: Efficiently computing the happens-before relation using locksets. In FATES/RV 06: Formal Approaches to Testing and Runtime Verification, volume 4262 of Lecture Notes in Computer Science, pages 193-208. Springer-Verlag, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4262 , pp. 193-208
    • Tayfun1    Elmas2
  • 6
    • 2442615037 scopus 로고    scopus 로고
    • Atomizer: A dynamic atomicity checker for multithreaded programs
    • ACM Press
    • C. Flanagan and S. N. Freund. Atomizer: A dynamic atomicity checker for multithreaded programs. In POPL 04: Principles of Programming Languages, pages 256-267. ACM Press, 2004.
    • (2004) POPL 04: Principles of Programming Languages , pp. 256-267
    • Flanagan, C.1    Freund, S.N.2
  • 7
  • 9
    • 0003257889 scopus 로고    scopus 로고
    • Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
    • Springer-Verlag
    • Patrice Godefroid. Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. LNCS 1032. Springer-Verlag, 1996.
    • (1996) LNCS , vol.1032
    • Godefroid, P.1
  • 10
    • 0030651806 scopus 로고    scopus 로고
    • Model checking for programming languages using Verisoft
    • ACM Press
    • Patrice Godefroid. Model checking for programming languages using Verisoft. In POPL 97: Principles of Programming Languages, pages 174-186. ACM Press, 1997.
    • (1997) POPL 97: Principles of Programming Languages , pp. 174-186
    • Godefroid, P.1
  • 11
    • 0036980240 scopus 로고    scopus 로고
    • Alex Groce and Willem Visser. Model checking Java programs using structural heuristics. In ISSTA 02: Software Testing and Analysis, pages 12-2.1, 2002.
    • Alex Groce and Willem Visser. Model checking Java programs using structural heuristics. In ISSTA 02: Software Testing and Analysis, pages 12-2.1, 2002.
  • 12
    • 85116893382 scopus 로고    scopus 로고
    • Exploiting heap symmetries in explicit-state model checking of software
    • Radu Iosif. Exploiting heap symmetries in explicit-state model checking of software. In ASE 01: Automated Software Engineering, pages 254-261, 2001.
    • (2001) ASE 01: Automated Software Engineering , pp. 254-261
    • Iosif, R.1
  • 13
    • 0030211668 scopus 로고    scopus 로고
    • Dill. Better verification through symmetry
    • C. Norris Ip and David L. Dill. Better verification through symmetry. Formal Methods in System Design, 9(1/2):41-75, 1996.
    • (1996) Formal Methods in System Design , vol.9 , Issue.1-2 , pp. 41-75
    • Norris Ip, C.1    David, L.2
  • 14
    • 35448952162 scopus 로고    scopus 로고
    • Dryad: Distributed data-parallel programs from sequential building blocks
    • Technical Report MSR-TR-2006-140, Microsoft Research
    • Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, and Dennis Fetterly. Dryad: Distributed data-parallel programs from sequential building blocks. Technical Report MSR-TR-2006-140, Microsoft Research, 2006.
    • (2006)
    • Isard, M.1    Budiu, M.2    Yu, Y.3    Birrell, A.4    Fetterly, D.5
  • 15
    • 35448955680 scopus 로고    scopus 로고
    • Daan Leijen. Futures: a concurrency library for C#. Technical Report MSR-TR-2006-162, Microsoft Research, 2006.
    • Daan Leijen. Futures: a concurrency library for C#. Technical Report MSR-TR-2006-162, Microsoft Research, 2006.
  • 17
    • 0036569880 scopus 로고    scopus 로고
    • Nalumasu and Ganesh Gopalakrishnan. An efficient partial order reduction algorithm with an alternative proviso implementation
    • May
    • Ratan. Nalumasu and Ganesh Gopalakrishnan. An efficient partial order reduction algorithm with an alternative proviso implementation. Formal Methods in System Design, 20(3):231-247, May 2002.
    • (2002) Formal Methods in System Design , vol.20 , Issue.3 , pp. 231-247
    • Ratan1
  • 18
    • 84947900891 scopus 로고    scopus 로고
    • Partial order reduction: Model-checking using representatives
    • Springer-Verlag
    • Doron Peled. Partial order reduction: Model-checking using representatives. In MFCS 96: Mathematical Foundations of Computer Science, pages 93-112. Springer-Verlag, 1996.
    • (1996) MFCS 96: Mathematical Foundations of Computer Science , pp. 93-112
    • Peled, D.1
  • 19
    • 24644522982 scopus 로고    scopus 로고
    • Context-bounded model checking of concurrent software
    • TACAS 05: Tools and Algorithms for the Construction and Analysis of Systems, of, Springer-Verlag
    • S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS 05: Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of Lecture Notes in Computer Science, pages 93-107. Springer-Verlag, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3440 , pp. 93-107
    • Qadeer, S.1    Rehof, J.2
  • 20
    • 4544338964 scopus 로고    scopus 로고
    • S. Qadeer and D. Wu. KISS: Keep it simple and sequential. In PLDI 04: Programming Language Design and Implementation, pages 14-24. ACM Press, 2004.
    • S. Qadeer and D. Wu. KISS: Keep it simple and sequential. In PLDI 04: Programming Language Design and Implementation, pages 14-24. ACM Press, 2004.
  • 21
    • 0020299274 scopus 로고
    • Specification and verification of concurrent systems in CESAR
    • Fifth International Symposium on Programming, Springer-Verlag
    • J. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Fifth International Symposium on Programming, Lecture Notes in Computer Science 137, pages 337-351. Springer-Verlag, 1981.
    • (1981) Lecture Notes in Computer Science , vol.137 , pp. 337-351
    • Queille, J.1    Sifakis, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.