메뉴 건너뛰기




Volumn , Issue , 1994, Pages

Static type determination for C++

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; NP-HARD; STATIC ANALYSIS;

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

References (36)
  • 1
    • 0025461033 scopus 로고
    • An interval-based approach to exhaustive and incremental interprocedural data flow analysis
    • July
    • M. Burke. An interval-based approach to exhaustive and incremental interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems, 12(3):341-395, July 1990.
    • (1990) ACM Transactions on Programming Languages and Systems , vol.12 , Issue.3 , pp. 341-395
    • Burke, M.1
  • 10
    • 0003500623 scopus 로고
    • Interprocedural analysis in the presence of function pointers
    • McGill University School of Computer Science AC APS Technical Memo 62, December
    • Rakesh Ghiya. Interprocedural analysis in the presence of function pointers. McGill University School of Computer Science AC APS Technical Memo 62, December 1992.
    • (1992)
    • Ghiya, Rakesh1
  • 19
    • 72349089166 scopus 로고
    • Graph theoretic foundations of program slicing and integration
    • The Center for Advanced Computer Studies, University of Southwestern Louisiana Technical Report CACS TR-91-5-5
    • Arun Lakhotia. Graph theoretic foundations of program slicing and integration. The Center for Advanced Computer Studies, University of Southwestern Louisiana Technical Report CACS TR-91-5-5, 1991.
    • (1991)
    • Lakhotia, Arun1
  • 25
    • 0028436630 scopus 로고
    • Interprocedural def-use associations for C systems with single level pointers
    • To appear in April
    • H. D. Pande, W. Landi and B. G. Ryder. Interprocedural def-use associations for C systems with single level pointers. To appear in IEEE Transactions on Software Engineering, April 1994.
    • (1994) IEEE Transactions on Software Engineering
    • Pande, H. D.1    Landi, W.2    Ryder, B. G.3
  • 26
    • 85095607122 scopus 로고    scopus 로고
    • B. G. R y d e r a n d W. L a n d i. I n t e r p r o c e d u r a l def-use a s s o c i a t i o n s i n C p r o g r a m s
    • H. D. P a n d e O c t o b e r 1 9 9 1
    • H. D. P a n d e, B. G. R y d e r a n d W. L a n d i. I n t e r p r o c e d u r a l def-use a s s o c i a t i o n s i n C p r o g r a m s. In Proceedings of the 1991 Symposium on Software Testing, Analysis and Verification (TAV4), O c t o b e r 1 9 9 1.
    • Proceedings of the 1991 Symposium on Software Testing, Analysis and Verification (TAV4)
  • 29
    • 85095579092 scopus 로고
    • Masters Thesis, Department of Computer Science, University of Wisconsin Madison
    • R a m e s h P a r a m e s w a r a n. I n t e r p r o c e d u r a l a l i a s a n d t y p e a n a l y s i s for p o i n t e r s. Masters Thesis, Department of Computer Science, University of Wisconsin - Madison. 1992.
    • (1992)
  • 30
    • 0022043004 scopus 로고
    • Selecting software test data using data flow information
    • SE-ll April
    • S. Rapps and E. Weyuker. Selecting software test data using data flow information. IEEE Transactions on Software Engineering, SE-ll(4):367-375, April 1985.
    • (1985) IEEE Transactions on Software Engineering , Issue.4 , pp. 367-375
    • Rapps, S.1    Weyuker, E.2
  • 31
    • 0018466659 scopus 로고
    • Constructing the call graph of a program
    • May
    • B. G. Ryder. Constructing the call graph of a program. IEEE Transactions on Software Engineering, SE-5(3):216-225, May 1979.
    • (1979) IEEE Transactions on Software Engineering , vol.SE-5 , Issue.3 , pp. 216-225
    • Ryder, B. G.1


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