메뉴 건너뛰기




Volumn , Issue , 2005, Pages 110-121

Dynamic partial-order reduction for model checking software

Author keywords

Partial order reduction; Software model checking

Indexed keywords

ALGORITHMS; CONCURRENT ENGINEERING; STATE SPACE METHODS;

EID: 29144439944     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1040305.1040315     Document Type: Conference Paper
Times cited : (121)

References (27)
  • 1
    • 70350760682 scopus 로고    scopus 로고
    • The SLAM toolkit
    • Proceedings of CAV'2001 (13th Conference on Computer Aided Verification), Paris, July 2001. Springer-Verlag
    • T. Ball and S. Rajamani, The SLAM Toolkit. In Proceedings of CAV'2001 (13th Conference on Computer Aided Verification), volume 2102 of Lecture Notes in Computer Science, pages 260-264, Paris, July 2001. Springer-Verlag.
    • Lecture Notes in Computer Science , vol.2102 , pp. 260-264
    • Ball, T.1    Rajamani, S.2
  • 5
    • 4444321661 scopus 로고    scopus 로고
    • Exploiting object escape and locking information in partial order reduction for concurrent object-oriented programs
    • To appear in
    • M. B. Dwyer, J. Hatcliff, V. R. Prasad, and Robby. Exploiting Object Escape and Locking Information in Partial Order Reduction for Concurrent Object-Oriented Programs. To appear in Formal Methods in System Design, 2004.
    • (2004) Formal Methods in System Design
    • Dwyer, M.B.1    Hatcliff, J.2    Prasad, V.R.3    Robby4
  • 6
    • 0028756614 scopus 로고
    • Model checking using net unfoldings
    • J. Esparza. Model Checking Using Net Unfoldings. Science of Computer Programming, 23:151-195, 1994.
    • (1994) Science of Computer Programming , vol.23 , pp. 151-195
    • Esparza, J.1
  • 7
    • 84894614752 scopus 로고    scopus 로고
    • Implementing LTL model checking with net unfoldings
    • Proceedings of the 8th SPIN Workshop (SPIN'2001), Toronto, May. Springer-Verlag
    • J. Esparza and K. Heljanko. Implementing LTL model checking with net unfoldings. In Proceedings of the 8th SPIN Workshop (SPIN'2001), volume 2057 of Lecture Notes in Computer Science, pages 37-56, Toronto, May 2001. Springer-Verlag.
    • (2001) Lecture Notes in Computer Science , vol.2057 , pp. 37-56
    • Esparza, J.1    Heljanko, K.2
  • 9
    • 0003758313 scopus 로고    scopus 로고
    • Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. Springer-Verlag, January
    • P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer-Verlag, January 1996.
    • (1996) Lecture Notes in Computer Science , vol.1032
    • Godefroid, P.1
  • 11
    • 24144461208 scopus 로고    scopus 로고
    • Software model checking: The VeriSoft approach
    • Also available as Bell Labs Technical Memorandum ITD-03-44189G
    • P. Godefroid. Software Model Checking: The VeriSoft Approach. To appear in Formal Methods in System Design, 2005. Also available as Bell Labs Technical Memorandum ITD-03-44189G.
    • (2005) Appear in Formal Methods in System Design
    • Godefroid, P.1
  • 12
    • 85027595530 scopus 로고
    • Refining dependencies improves partial-order verification methods
    • Proceedings of CAV'93 (5th Conference on Computer Aided Verification), Elounda, June. Springer-Verlag
    • P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods. In Proceedings of CAV'93 (5th Conference on Computer Aided Verification), volume 697 of Lecture Notes in Computer Science, pages 438-449, Elounda, June 1993. Springer-Verlag.
    • (1993) Lecture Notes in Computer Science , vol.697 , pp. 438-449
    • Godefroid, P.1    Pirottin, D.2
  • 13
    • 0027577622 scopus 로고
    • Using partial orders for the efficient verification of deadlock freedom and safety properties
    • April
    • P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149-164, April 1993.
    • (1993) Formal Methods in System Design , vol.2 , Issue.2 , pp. 149-164
    • Godefroid, P.1    Wolper, P.2
  • 15
    • 0026886169 scopus 로고
    • Defining conditional independence using collapses
    • S. Katz and D. Peled. Defining conditional independence using collapses. Theoretical Computer Science, 101:337-359, 1992.
    • (1992) Theoretical Computer Science , vol.101 , pp. 337-359
    • Katz, S.1    Peled, D.2
  • 16
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-564, 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-564
    • Lamport, L.1
  • 17
    • 0003055324 scopus 로고
    • Virtual time and global states of distributed systems
    • North-Holland / Elsevier
    • F. Mattern. Virtual Time and Global States of Distributed Systems. In Proc. Workshop on Parallel and Distributed Algorithms, pages 215-226. North-Holland / Elsevier, 1989.
    • (1989) Proc. Workshop on Parallel and Distributed Algorithms , pp. 215-226
    • Mattern, F.1
  • 18
    • 85034819445 scopus 로고
    • Trace theory
    • Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course. Springer-Verlag
    • A. Mazurkiewicz. Trace theory. In Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course, volume 255 of Lecture Notes in Computer Science, pages 279-324. Springer-Verlag, 1986.
    • (1986) Lecture Notes in Computer Science , vol.255 , pp. 279-324
    • Mazurkiewicz, A.1
  • 19
    • 33847258494 scopus 로고
    • Using unfolding to avoid the state explosion problem in the verification of asynchronous circuits
    • Proc. 4th Workshop on Computer Aided Verification, Montreal, June. Springer-Verlag
    • K. McMillan. Using unfolding to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. 4th Workshop on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164-177, Montreal, June 1992. Springer-Verlag.
    • (1992) Lecture Notes in Computer Science , vol.663 , pp. 164-177
    • McMillan, K.1
  • 20
    • 85010991128 scopus 로고
    • All from one, one for all: On model checking using representatives
    • Proc. 5th Conference on Computer Aided Verification, Elounda, June. Springer-Verlag
    • D. Peled. All from one, one for all: on model checking using representatives. In Proc. 5th Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 409-423, Elounda, June 1993. Springer-Verlag.
    • (1993) Lecture Notes in Computer Science , vol.697 , pp. 409-423
    • Peled, D.1
  • 22
    • 35248848307 scopus 로고    scopus 로고
    • Optimistic synchronization-based state-space reduction
    • H. Garavel and J. Hatcliff, editors, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Springer-Verlag, April
    • S. D. Stoller and E. Cohen. Optimistic Synchronization-Based State-Space Reduction. In H. Garavel and J. Hatcliff, editors, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2619 of Lecture Notes in Computer Science, pages 489-504. Springer-Verlag, April 2003.
    • (2003) Lecture Notes in Computer Science , vol.2619 , pp. 489-504
    • Stoller, S.D.1    Cohen, E.2
  • 23
    • 84944402184 scopus 로고    scopus 로고
    • Efficient detection of global properties in distributed systems using partial-order methods
    • Proceedings of the 12th Conference on Computer Aided Verification, Chicago, July. Springer-Verlag
    • S. D. Stoller, L. Unnikrishnan, and Y. A. Liu. Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods. In Proceedings of the 12th Conference on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 264-279, Chicago, July 2000. Springer-Verlag.
    • (2000) Lecture Notes in Computer Science , vol.1855 , pp. 264-279
    • Stoller, S.D.1    Unnikrishnan, L.2    Liu, Y.A.3
  • 25
    • 0003047591 scopus 로고
    • Stubborn sets for reduced state space generation
    • Advances in Petri Nets 1990. Springer-Verlag
    • A. Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets 1990, volume 483 of Lecture Notes in Computer Science, pages 491-515. Springer-Verlag, 1991.
    • (1991) Lecture Notes in Computer Science , vol.483 , pp. 491-515
    • Valmari, A.1
  • 26
    • 85029421081 scopus 로고
    • On-the-fly verification with stubborn sets
    • Proc. 5th Conference on Computer Aided Verification, Elounda, June. Springer-Verlag
    • A. Valmari. On-the-fly verification with stubborn sets. In Proc. 5th Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 397-408, Elounda, June 1993. Springer-Verlag.
    • (1993) Lecture Notes in Computer Science , vol.697 , pp. 397-408
    • Valmari, A.1


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