메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 312-317

Reachability testing of semaphore-based programs

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT PROGRAMMING; PREFIX-BASED TESTING; REACHABILITY TESTING; SEMAPHORE-BASED PROGRAMS;

EID: 18744413533     PISSN: 07303157     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (9)
  • 1
    • 18744371675 scopus 로고    scopus 로고
    • A general model for reachability testing of concurrent programs
    • to be published
    • R. H. Carver and Y. Lei. A general model for reachability testing of concurrent programs, to be published in ICFEM 2004.
    • ICFEM 2004
    • Carver, R.H.1    Lei, Y.2
  • 4
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • July
    • L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System, Comm. ACM, July 1978, pp. 558-565.
    • (1978) Comm. ACM , pp. 558-565
    • Lamport, L.1
  • 9
    • 0026116649 scopus 로고
    • Replay and testing for concurrent programs
    • March
    • Richard Carver and K. C. Tai, "Replay and Testing for Concurrent Programs," IEEE Software, Vol. 8. No. 2, March 1991, pp. 66-74.
    • (1991) IEEE Software , vol.8 , Issue.2 , pp. 66-74
    • Carver, R.1    Tai, K.C.2


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