메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 187-196

Annotated inclusion constraints for precise flow analysis

Author keywords

[No Author keywords available]

Indexed keywords

INCLUSION-BASED FLOW ANALYSES; PRECISE FLOW ANALYSIS;

EID: 33646930669     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2005.24     Document Type: Conference Paper
Times cited : (4)

References (24)
  • 2
    • 0026881286 scopus 로고
    • Solving systems of set constraints
    • A. Aiken and E. Wimmers. Solving systems of set constraints. In LICS, pages 329-340, 1992.
    • (1992) LICS , pp. 329-340
    • Aiken, A.1    Wimmers, E.2
  • 3
    • 0027870608 scopus 로고
    • Type inclusion constraints and type inference
    • A. Aiken and E. Wimmers, Type inclusion constraints and type inference. In FPCA, pages 31-41, 1993.
    • (1993) FPCA , pp. 31-41
    • Aiken, A.1    Wimmers, E.2
  • 5
    • 84948958710 scopus 로고
    • Optimizations of object-oriented programs using static class hierarchy analysis
    • J. Dean, D. Grove, and C. Chambers. Optimizations of object-oriented programs using static class hierarchy analysis. In ECOOP, pages 77-101, 1995.
    • (1995) ECOOP , pp. 77-101
    • Dean, J.1    Grove, D.2    Chambers, C.3
  • 6
    • 0346246707 scopus 로고    scopus 로고
    • Partial online cycle elimination in inclusion constraint graphs
    • M. Fähndrich, J. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In PLDI, pages 85-96, 1998.
    • (1998) PLDI , pp. 85-96
    • Fähndrich, M.1    Foster, J.2    Su, Z.3    Aiken, A.4
  • 7
    • 0034448101 scopus 로고    scopus 로고
    • Scalable context-sensitive flow analysis using instantiation constraints
    • M. Fähndrich, J. Rehof, and M. Das. Scalable context-sensitive flow analysis using instantiation constraints. In PLDI, pages 253-263, 2000.
    • (2000) PLDI , pp. 253-263
    • Fähndrich, M.1    Rehof, J.2    Das, M.3
  • 8
    • 84906099970 scopus 로고    scopus 로고
    • Polymorphic versus monomorphic flow-insensitive points-to analysis for C
    • LNCS 1824
    • J. Foster, M. Fähndrich, and A. Aiken. Polymorphic versus monomorphic flow-insensitive points-to analysis for C. In SAS, LNCS 1824, pages 175-198, 2000.
    • (2000) SAS , pp. 175-198
    • Foster, J.1    Fähndrich, M.2    Aiken, A.3
  • 9
    • 0345985588 scopus 로고    scopus 로고
    • Call graph construction in object-oriented languages
    • D. Grove, G. DeFouw, J. Dean, and C. Chambers. Call graph construction in object-oriented languages. In OOP-SLA, pages 108-124, 1997.
    • (1997) OOP-SLA , pp. 108-124
    • Grove, D.1    DeFouw, G.2    Dean, J.3    Chambers, C.4
  • 10
    • 0034832870 scopus 로고    scopus 로고
    • Ultra-fast aliasing analysis using CLA: A million lines of C code in a second
    • N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In PLDI, pages 254-264, 2001.
    • (2001) PLDI , pp. 254-264
    • Heintze, N.1    Tardieu, O.2
  • 11
    • 35248842644 scopus 로고    scopus 로고
    • Scaling Java points-to analysis using Spark
    • O. Lhotak and L. Hendren. Scaling Java points-to analysis using Spark. In CC, pages 153-169, 2003.
    • (2003) CC , pp. 153-169
    • Lhotak, O.1    Hendren, L.2
  • 12
    • 0034823715 scopus 로고    scopus 로고
    • Extending and evaluating flow-insensitive and context-insensitive points-to analyses for Java
    • D. Liang, M. Pennings, and M. J. Harrold. Extending and evaluating flow-insensitive and context-insensitive points-to analyses for Java. In PASTE, pages 73-79, 2001.
    • (2001) PASTE , pp. 73-79
    • Liang, D.1    Pennings, M.2    Harrold, M.J.3
  • 14
    • 13844296853 scopus 로고    scopus 로고
    • Parameterized object sensitivity for points-to analysis for Java
    • A. Milanova, A. Rountev, and B. G. Ryder. Parameterized object sensitivity for points-to analysis for Java. ACM TOSEM, 14(1): 1-42, 2005.
    • (2005) ACM TOSEM , vol.14 , Issue.1 , pp. 1-42
    • Milanova, A.1    Rountev, A.2    Ryder, B.G.3
  • 16
    • 0035035698 scopus 로고    scopus 로고
    • Type-based flow analysis: From polymorphic subtyping to CFL-reachability
    • J. Rehof and M. Fähndrich. Type-based flow analysis: From polymorphic subtyping to CFL-reachability. In POPL, pages 54-66, 2001.
    • (2001) POPL , pp. 54-66
    • Rehof, J.1    Fähndrich, M.2
  • 18
    • 0034448274 scopus 로고    scopus 로고
    • Off-line variable substitution for scaling points-to analysis
    • A. Rountev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In PLDI, pages 47-56, 2000.
    • (2000) PLDI , pp. 47-56
    • Rountev, A.1    Chandra, S.2
  • 19
    • 0035551919 scopus 로고    scopus 로고
    • Points-to analysis for Java using annotated constraints
    • A. Rountev, A. Milanova, and B. G. Ryder. Points-to analysis for Java using annotated constraints. In OOPSLA, pages 43-55, 2001.
    • (2001) OOPSLA , pp. 43-55
    • Rountev, A.1    Milanova, A.2    Ryder, B.G.3
  • 20
    • 17144374941 scopus 로고    scopus 로고
    • Effective synchronization removal for Java
    • E. Ruf. Effective synchronization removal for Java. In PLDI, pages 208-218, 2000.
    • (2000) PLDI , pp. 208-218
    • Ruf, E.1
  • 21
    • 0002823436 scopus 로고
    • Two approaches to interprocedural data flow analysis
    • S. Muchnick and N. Jones, editors. Prentice Hall
    • M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 189-234. Prentice Hall, 1981.
    • (1981) Program Flow Analysis: Theory and Applications , pp. 189-234
    • Sharir, M.1    Pnueli, A.2
  • 22
    • 0003555711 scopus 로고    scopus 로고
    • Points-to for Java: A general framework and an emprirical comparison
    • U. Passau, Sept.
    • M. Streckenbach and G. Snelting. Points-to for Java: A general framework and an emprirical comparison. Technical report, U. Passau, Sept. 2000.
    • (2000) Technical Report
    • Streckenbach, M.1    Snelting, G.2
  • 23
    • 0033725888 scopus 로고    scopus 로고
    • Projection merging: Reducing redundancies in inclusion constraint graphs
    • Z. Su, M. Fähndrich, and A. Aiken. Projection merging: Reducing redundancies in inclusion constraint graphs. In POPL, pages 81-95, 2000.
    • (2000) POPL , pp. 81-95
    • Su, Z.1    Fähndrich, M.2    Aiken, A.3
  • 24
    • 4544374465 scopus 로고    scopus 로고
    • Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
    • J. Whaley and M. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI, pages 131-144, 2004.
    • (2004) PLDI , pp. 131-144
    • Whaley, J.1    Lam, M.2


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