메뉴 건너뛰기




Volumn Part F129371, Issue , 1995, Pages 13-22

Context-insensitive alias analysis reconsidered

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES;

EID: 85016876025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/207110.207112     Document Type: Conference Paper
Times cited : (16)

References (23)
  • 8
    • 0027061682 scopus 로고
    • A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations
    • [Deu92] IEEE, Apr.
    • [Deu92] A. Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In International Conference on Computer Languages, pages 2-13 IEEE, Apr. 1992.
    • (1992) International Conference On Computer Languages , pp. 2-13
    • Deutsch, A.1
  • 11
    • 34047163757 scopus 로고
    • The interprocedural analysis and automatic parallelization of Scheme programs
    • [Har89]
    • [Har89] W. L Harrison III. The interprocedural analysis and automatic parallelization of Scheme programs Lisp and Symbolic Computation, 2(3/4).179-396, 1989.
    • (1989) Lisp and Symbolic Computation , vol.2 , Issue.3-4 , pp. 179-396
    • Harrison, W.L.1
  • 18
    • 0008870029 scopus 로고
    • Optimizing sparse representations for dataflow analysis
    • [Ruf95] Jan Proceedings available as Microsoft Research technical report MSR-TR-95-01
    • [Ruf95] E. Ruf Optimizing sparse representations for dataflow analysis. In ACM SIGPLAN Workshop on Intermediate Representations (IR'95), pages 50-61, Jan 1995 Proceedings available as Microsoft Research technical report MSR-TR-95-01
    • (1995) ACM SIGPLAN Workshop On Intermediate Representations (IR'95) , pp. 50-61
    • Ruf, E.1


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