메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 280-290

A general compiler framework for speculative optimizations using data speculative code motion

Author keywords

[No Author keywords available]

Indexed keywords

CODE SCHEDULING; DATA SPECULATIVE CODE MOTION; INDIVIDUAL CODE TRANSFORMATION;

EID: 33646849245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (22)
  • 1
    • 0034447887 scopus 로고    scopus 로고
    • Modular interprocedural pointer analysis using access paths: Design, implementation, and valuation
    • Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), June
    • B.-C. Cheng, W.-M. Hwu, "Modular Interprocedural Pointer Analysis Using Access Paths: Design, Implementation, and Valuation", in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), SIGPLAN Notices 35(5), pages 57-69. June 2000
    • (2000) SIGPLAN Notices , vol.35 , Issue.5 , pp. 57-69
    • Cheng, B.-C.1    Hwu, W.-M.2
  • 18
    • 0027983356 scopus 로고
    • Effective partial redundancy elimination
    • Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). June
    • Preston Briggs and Keith D. Cooper. "Effective Partial Redundancy Elimination", in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). SIGPLAN Notices, 29(6) pages 159-170, June 1994.
    • (1994) SIGPLAN Notices , vol.29 , Issue.6 , pp. 159-170
    • Briggs, P.1    Cooper, K.D.2
  • 21
    • 0029717388 scopus 로고    scopus 로고
    • Points-to analysis in almost linear time
    • Bjarne Steensgaard, "points-to Analysis in Almost Linear Time", POPL, pages 32-41, 1996.
    • (1996) POPL , pp. 32-41
    • Steensgaard, B.1


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