메뉴 건너뛰기




Volumn , Issue , 2001, Pages 65-72

Detecting dead statements for concurrent programs

Author keywords

concurrent program flow graph; dead statements; MHP algorithm; rendezvous

Indexed keywords

FLOW GRAPHS; GRAPHIC METHODS;

EID: 84963850935     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2001.972667     Document Type: Conference Paper
Times cited : (5)

References (14)
  • 3
    • 0003195032 scopus 로고    scopus 로고
    • Dependence Analysis and Static Slices of Concurrent Programs
    • Nanjing, China
    • Z. Chen and B. Xu. Dependence Analysis and Static Slices of Concurrent Programs. ICYCS'99, Nanjing, China, 239-242
    • ICYCS'99 , pp. 239-242
    • Chen, Z.1    Xu, B.2
  • 4
    • 0000918439 scopus 로고    scopus 로고
    • Detecting All Pairs of Statements in Parallel Programs
    • Nanjing, China
    • Z. Chen and B. Xu. Detecting All Pairs of Statements in Parallel Programs, NCYCS'2000, Nanjing, China, 265-269
    • NCYCS'2000 , pp. 265-269
    • Chen, Z.1    Xu, B.2
  • 5
    • 17644402403 scopus 로고    scopus 로고
    • An Approach to Analysing Dependency of Concurrent Programs
    • Hongkong
    • Z. Chen, B. Xu and et al. An Approach to Analysing Dependency of Concurrent Programs. IEEE APAQS'2000, Hongkong, 34-39
    • IEEE APAQS'2000 , pp. 34-39
    • Chen, Z.1    Xu, B.2
  • 6
    • 0002611591 scopus 로고    scopus 로고
    • Slicing Concurrent Java Programs
    • Z. Chen and B. Xu, Slicing Concurrent Java Programs. ACM SIGPLAN Notices, 2001, to Appear
    • (2001) ACM SIGPLAN Notices
    • Chen, Z.1    Xu, B.2
  • 9
    • 0347177460 scopus 로고    scopus 로고
    • Static Slicing of Threaded Programs
    • J. Krinke. Static Slicing of Threaded Programs. ACM SIGPLAN Notices, 33(7): 35-42, 1998
    • (1998) ACM SIGPLAN Notices , vol.33 , Issue.7 , pp. 35-42
    • Krinke, J.1
  • 12
    • 84887435787 scopus 로고    scopus 로고
    • An Efficient Algorithm for computing MHP Information for Concurrent Java Programs
    • September
    • G. Naumovich, S. Avrunin, et al. An Efficient Algorithm for computing MHP Information for Concurrent Java Programs. ESEC/FSE '99. pp. 338-354, September 1999
    • (1999) ESEC/FSE '99 , pp. 338-354
    • Naumovich, G.1    Avrunin, S.2
  • 13
    • 0020736536 scopus 로고
    • Complexity of analyzing the synchronization structure of concurrent programs
    • R. N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57-84, 1983
    • (1983) Acta Informatica , vol.19 , pp. 57-84
    • Taylor, R.N.1
  • 14
    • 0000303964 scopus 로고
    • Reverse Program flow Dependency Analysis and Applications
    • B. Xu. Reverse Program flow Dependency Analysis and Applications. Chinese J. Computers, 16(5): 385-392, 1993
    • (1993) Chinese J. Computers , vol.16 , Issue.5 , pp. 385-392
    • Xu, B.1


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