메뉴 건너뛰기




Volumn 1411, Issue , 1998, Pages 238-250

Symbolic reaching definitions analysis of ada programs

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; DATA TRANSFER;

EID: 84957639165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055009     Document Type: Conference Paper
Times cited : (7)

References (12)
  • 2
    • 84976850518 scopus 로고
    • Information-flow and datarflow analysis of while-programs
    • J.-F. Bergeretti and B. A. Carre. Information-flow and datarflow analysis of while-programs. ACM Trans. Prog. Lang. Sys., 7(1):37-61, 1985.
    • (1985) ACM Trans. Prog. Lang. Sys , vol.7 , Issue.1 , pp. 37-61
    • Bergeretti, J.-F.1    Carre, B.A.2
  • 4
    • 0030244313 scopus 로고    scopus 로고
    • Combining static worst-case timing analysis and program proof
    • R. Chapman, A. Burns, and A. Wellings. Combining static worst-case timing analysis and program proof. Real-Time Systems, 11(2): 145-171, 1996.
    • (1996) Real-Time Systems , vol.11 , Issue.2 , pp. 145-171
    • Chapman, R.1    Burns, A.2    Wellings, A.3
  • 7
    • 84976706502 scopus 로고
    • Global data flow analysis and iterative algorithms
    • J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. J. ACM, 23(1):158-171, 1976.
    • (1976) J. ACM , vol.23 , Issue.1 , pp. 158-171
    • Kam, J.B.1    Ullman, J.D.2
  • 8
    • 0000833167 scopus 로고
    • Monotone data flow analysis frameworks
    • J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:305-317, 1977.
    • (1977) Acta Informatica , vol.7 , pp. 305-317
    • Kam, J.B.1    Ullman, J.D.2
  • 9
    • 0025548384 scopus 로고
    • Properties of data flow frameworks - A unified model
    • T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks - a unified model. Acta Informatica, 28:121-163, 1990.
    • (1990) Acta Informatica , vol.28 , pp. 121-163
    • Marlowe, T.J.1    Ryder, B.G.2
  • 11
    • 0022787552 scopus 로고
    • Elimination algorithms for data flow analysis
    • B. G. Ryder and M. C. Pauli. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277-316, 1986.
    • (1986) ACM Computing Surveys , vol.18 , Issue.3 , pp. 277-316
    • Ryder, B.G.1    Pauli, M.C.2
  • 12
    • 0003713467 scopus 로고
    • PhD thesis, School of Computer Science, McGill University, Montréal, Québec, Canada
    • V. C. Sreedhar. Efficient Program Analysis Using DJ Graphs. PhD thesis, School of Computer Science, McGill University, Montréal, Québec, Canada, 1995.
    • (1995) Efficient Program Analysis Using DJ Graphs
    • Sreedhar, V.C.1


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