메뉴 건너뛰기




Volumn , Issue , 2001, Pages 647-656

On optimal slicing of parallel programs

Author keywords

Complexity; Interprocedural analysis; Parallel programs; Slicing; Undecidability

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; MULTITASKING; PARALLEL PROCESSING SYSTEMS; SEMANTICS;

EID: 0034819434     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380864     Document Type: Conference Paper
Times cited : (25)

References (28)
  • 14
  • 16
  • 18
    • 84896693034 scopus 로고    scopus 로고
    • Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
    • (2000) STTT , vol.2 , Issue.4 , pp. 343-349
    • Millett, L.I.1    Teitelbaum, T.2
  • 20
    • 84957102708 scopus 로고    scopus 로고
    • The complexity of copy constant detection in parallel programs
    • LNCS 2010, Springer
    • (2001) STACS 2001 , pp. 490-501
    • Müller-Olm, M.1
  • 23
    • 0000422707 scopus 로고    scopus 로고
    • Context-sensitive synchronization-sensitive analysis is undecidable
    • (2000) ACM TOPLAS , vol.22 , Issue.2 , pp. 416-430
    • Ramalingam, G.1
  • 24
  • 25


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