메뉴 건너뛰기




Volumn , Issue , 2006, Pages 232-242

JAAT: Java alias analysis tool for program maintenance activities

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; OPTIMIZATION; PROGRAM DEBUGGING; REAL TIME SYSTEMS; SOFTWARE ENGINEERING; XML;

EID: 33751059718     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISORC.2006.     Document Type: Conference Paper
Times cited : (9)

References (26)
  • 4
    • 0025444591 scopus 로고
    • Analysis of pointers and structures
    • White Plains, NY
    • D. R. Chase, M. N. Wegman and F. K. Zadeck, Analysis of Pointers and Structures, PLDI, pp.296-310, White Plains, NY, 1990.
    • (1990) PLDI , pp. 296-310
    • Chase, D.R.1    Wegman, M.N.2    Zadeck, F.K.3
  • 5
    • 0032661202 scopus 로고    scopus 로고
    • Relevant context inference
    • San Antonio, TX
    • R. K. Chatterjee, B. G. Ryder and W. Landi, Relevant Context Inference, POPL, pp. 133-146, San Antonio, TX, 1999.
    • (1999) POPL , pp. 133-146
    • Chatterjee, R.K.1    Ryder, B.G.2    Landi, W.3
  • 7
    • 0027961597 scopus 로고
    • Context-sensitive interprocedural points-to analysis in the presence of function pointers
    • Orlando, FL
    • M. Enami, R. Ghiya and L. J. Hendren, Context-sensitive interprocedural points-to analysis in the presence of function pointers, PLDI, pp.242-256, Orlando, FL, 1994.
    • (1994) PLDI , pp. 242-256
    • Enami, M.1    Ghiya, R.2    Hendren, L.J.3
  • 8
    • 16544390641 scopus 로고    scopus 로고
    • Separate computation of alias information for reuse
    • M. J. Harrold and G. Rothermel, Separate Computation of Alias Information for Reuse, IEEE TSE,22-7, pp.442-460, 1996.
    • (1996) IEEE TSE , vol.22 , Issue.7 , pp. 442-460
    • Harrold, M.J.1    Rothermel, G.2
  • 9
    • 0034837173 scopus 로고    scopus 로고
    • Demand-driven pointer analysis
    • Snowbird, UT
    • N. Heintze and O. Tardieu, Demand-Driven Pointer Analysis, PLDI, pp.24-34, Snowbird, UT, 2001.
    • (2001) PLDI , pp. 24-34
    • Heintze, N.1    Tardieu, O.2
  • 10
    • 0034825842 scopus 로고    scopus 로고
    • Pointer analysis: Haven't we solved this problem yet?
    • Snowbird, UT
    • M. Hind, Pointer Analysis: Haven't We Solved This Problem Yet?, Program Analysis for Software Tools and Engineering, pp.54-61, Snowbird, UT, 2001,
    • (2001) Program Analysis for Software Tools and Engineering , pp. 54-61
    • Hind, M.1
  • 11
    • 0026987136 scopus 로고
    • A safe approximate algorithm for interprocedural pointer aliasing
    • San Francisco, CA
    • W. Landi and B. G. Ryder, A Safe Approximate Algorithm for Interprocedural Pointer Aliasing, PLDI, pp.235-248, San Francisco, CA, 1992.
    • (1992) PLDI , pp. 235-248
    • Landi, W.1    Ryder, B.G.2
  • 12
    • 0027830142 scopus 로고
    • Interprocedural modification side effect analysis with pointer aliasing
    • Albuquerque, NM
    • W. Landi, B. G. Ryder and S. Zhang, Interprocedural Modification Side Effect Analysis With Pointer Aliasing, PLDI, pp.56-67, Albuquerque, NM, 1993.
    • (1993) PLDI , pp. 56-67
    • Landi, W.1    Ryder, B.G.2    Zhang, S.3
  • 14
    • 84887498974 scopus 로고    scopus 로고
    • Efficient points-to analysis for whole-program analysis
    • Toulouse, France
    • D. Liang and M. J. Harrold, Efficient Points-to Analysis for Whole-Program Analysis, 7th ESEC/FSE, pp. 199-215, Toulouse, France, 1999.
    • (1999) 7th ESEC/FSE , pp. 199-215
    • Liang, D.1    Harrold, M.J.2
  • 15
    • 33751070464 scopus 로고    scopus 로고
    • JAAT: A practical alias analysis tool for java programs
    • Department of Information and Computer Sciences, SE-lab-362, Dec
    • F. Ohata and K. Inoue, JAAT: A Practical Alias Analysis Tool for Java Programs, Technical Report of Osaka University, Department of Information and Computer Sciences, SE-lab-362, Dec, 2001.
    • (2001) Technical Report of Osaka University
    • Ohata, F.1    Inoue, K.2
  • 16
    • 0035551919 scopus 로고    scopus 로고
    • Points-to analysis for java using annotated constraints
    • Tampa, FL
    • A. Rountev, A. Milanova and B. G. Ryder, Points-To Analysis for Java using Annotated Constraints, OOPSLA, pp.43-55,Tampa, FL, 2001.
    • (2001) OOPSLA , pp. 43-55
    • Rountev, A.1    Milanova, A.2    Ryder, B.G.3
  • 17
    • 0032650620 scopus 로고    scopus 로고
    • Pointer analysis for multi-threaded programs
    • Atlanta, GA.
    • R. Rugina and M. C. Rinard, Pointer Analysis for Multi-threaded Programs, PLDI, pp.77-90, 1999, Atlanta, GA.
    • (1999) PLDI , pp. 77-90
    • Rugina, R.1    Rinard, M.C.2
  • 18
    • 0002174919 scopus 로고    scopus 로고
    • A schema for Interprocedural modification side-effect analysis with pointer aliasing
    • B. G. Ryder, W. Landi, P. Stocks, S. Zhang and R. Altucher, A schema for Interprocedural modification side-effect analysis with pointer aliasing, ACM TOPLAS, 23-2, pp. 105-186, 2001.
    • (2001) ACM TOPLAS , vol.23 , Issue.2 , pp. 105-186
    • Ryder, B.G.1    Landi, W.2    Stocks, P.3    Zhang, S.4    Altucher, R.5
  • 19
    • 0030677609 scopus 로고    scopus 로고
    • Fast and accurate flow-insensitive point-to analysis
    • Paris, France
    • M. Shapiro and S. Horwitz, Fast and accurate flow-insensitive point-to analysis, POPL, pp. 1-14, Paris, France, 1997.
    • (1997) POPL , pp. 1-14
    • Shapiro, M.1    Horwitz, S.2
  • 20
    • 0032306336 scopus 로고    scopus 로고
    • Analysis of programs with exception-handling constructs
    • Washington, D.C.
    • S. Sinha and M. J. Harrold, Analysis of Programs With Exception-Handling Constructs, ICSM, pp.358-367, Washington, D.C., 1998.
    • (1998) ICSM , pp. 358-367
    • Sinha, S.1    Harrold, M.J.2
  • 21
    • 0029717388 scopus 로고    scopus 로고
    • Points-to analysis in almost linear time
    • St. Petersburg Beach, FL
    • B. Steensgaard, Points-to analysis in almost linear time, POPL, pp.32-41, St. Petersburg Beach, FL, 1996.
    • (1996) POPL , pp. 32-41
    • Steensgaard, B.1
  • 22
    • 0030649003 scopus 로고    scopus 로고
    • Flow insensitive C++ pointers and polymorphism analysis and its application to slicing
    • Boston, MA
    • P. Tonella, G. Antoniol, R. Fiutem and E. Merlo, Flow insensitive C++ pointers and polymorphism analysis and its application to slicing, 19th ICSE, pp.433-443, Boston, MA, 1997.
    • (1997) 19th ICSE , pp. 433-443
    • Tonella, P.1    Antoniol, G.2    Fiutem, R.3    Merlo, E.4
  • 23
    • 84976841171 scopus 로고
    • Efficient context-sensitive pointer analysis for C programs
    • La Jolla, CA.
    • R. P. Wilson and M. S. Lam, Efficient context-sensitive pointer analysis for C programs, PLDI, pp. 1-12, 1995, La Jolla, CA.
    • (1995) PLDI , pp. 1-12
    • Wilson, R.P.1    Lam, M.S.2
  • 24
    • 0032660031 scopus 로고    scopus 로고
    • Pointer analysis for programs with structures and casting
    • Atlanta, GA
    • S. H. Yong, S. Horwitz and T. W. Reps, Pointer Analysis for Programs with Structures and Casting, PLDI, pp.91-103, Atlanta, GA, 1999.
    • (1999) PLDI , pp. 91-103
    • Yong, S.H.1    Horwitz, S.2    Reps, T.W.3
  • 26
    • 0030402131 scopus 로고    scopus 로고
    • Program decomposition for pointer aliasing: A step toward practical analyses
    • San Francisco, CA
    • S. Zhang, B. G. Ryder and W. A. Landi, Program Decomposition for Pointer Aliasing: A Step Toward Practical Analyses, 4th FSE, pp.81-92, San Francisco, CA, 1996.
    • (1996) 4th FSE , pp. 81-92
    • Zhang, S.1    Ryder, B.G.2    Landi, W.A.3


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