메뉴 건너뛰기




Volumn 81, Issue 2, 2002, Pages 111-117

An efficient method for computing dynamic program slices

Author keywords

Control flow graph; Dynamic slicing; Program debugging; Program dependence graph; Program slicing; Static slicing

Indexed keywords

DATA PROCESSING; GRAPH THEORY; REENGINEERING;

EID: 0037203619     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00202-2     Document Type: Article
Times cited : (14)

References (9)


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