메뉴 건너뛰기




Volumn 1383, Issue , 1998, Pages 159-173

Detecting parallelism in C programs with recursive data structures

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; PROGRAM COMPILERS; TREES (MATHEMATICS);

EID: 84958049341     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026429     Document Type: Conference Paper
Times cited : (19)

References (15)
  • 2
    • 0030412019 scopus 로고    scopus 로고
    • Connection Analysis: A practical interprocedural heap analysis for C
    • Rakesh Ghiya and Laurie J. Hendren. Connection Analysis: A practical interprocedural heap analysis for C. International Journal of Parallel Programming, 24(6), pages 547-578, 1996.
    • (1996) International Journal of Parallel Programming , vol.24 , Issue.6 , pp. 547-578
    • Ghiya, R.1    Hendren, L.J.2
  • 5
    • 0346639792 scopus 로고    scopus 로고
    • PhD Thesis, School of Computer Science, McGill University, Montreal, Canada. February, Expected
    • Rakesh Ghiya. Putting Pointer Analysis to Work. PhD Thesis, School of Computer Science, McGill University, Montreal, Canada. February 1998. Expected.
    • (1998) Putting Pointer Analysis to Work
    • Ghiya, R.1
  • 6
    • 0024138602 scopus 로고
    • A technique for analyzing pointer and structure references in parallel restructuring compilers
    • August
    • Vincent A. Guarna Jr. A technique for analyzing pointer and structure references in parallel restructuring compilers. In Proceeding s of the 1988 International Conference on Parallel Processing, volume II, pages 212-220, August 1988.
    • (1988) Proceeding S of the 1988 International Conference on Parallel Processing , vol.2 , pp. 212-220
    • Guarna, V.A.1


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