메뉴 건너뛰기




Volumn 12, Issue 4, 2004, Pages 311-337

Online cycle detection and difference propagation: Applications to pointer analysis

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SOFTWARE; PROBLEM SOLVING; SECURITY OF DATA; SET THEORY;

EID: 4444341636     PISSN: 09639314     EISSN: 15731367     Source Type: Journal    
DOI: 10.1023/B:SQJO.0000039791.93071.a2     Document Type: Conference Paper
Times cited : (38)

References (90)
  • 1
  • 2
    • 84965037759 scopus 로고
    • Set constraints: Results, applications, and future directions
    • Lecture Notes in Computer Science. Springer
    • Aiken, A. 1994. Set constraints: Results, applications, and future directions, Proceedings of the Workshop on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 874, pp. 326-335. Springer.
    • (1994) Proceedings of the Workshop on Principles and Practice of Constraint Programming , vol.874 , pp. 326-335
    • Aiken, A.1
  • 3
    • 0033226029 scopus 로고    scopus 로고
    • Introduction to set constraint-based program analysis
    • Aiken, A. 1999. Introduction to set constraint-based program analysis, Science of Computer Programming 35(2-3): 79-111.
    • (1999) Science of Computer Programming , vol.35 , Issue.2-3 , pp. 79-111
    • Aiken, A.1
  • 7
    • 84980009359 scopus 로고
    • Slicing programs with arbitrary control-flow
    • Lecture Notes in Computer Science. Springer
    • Ball, T. and Horwitz, S. 1993. Slicing programs with arbitrary control-flow, Proceedings of the Workshop on Automated and Algorithmic Debugging, Lecture Notes in Computer Science, Vol. 749, pp. 206-222. Springer.
    • (1993) Proceedings of the Workshop on Automated and Algorithmic Debugging , vol.749 , pp. 206-222
    • Ball, T.1    Horwitz, S.2
  • 8
    • 0032301276 scopus 로고    scopus 로고
    • The application of program slicing to regression testing
    • Binkley, D. 1998. The application of program slicing to regression testing, Information and Software Technology 40(11-12): 583-594.
    • (1998) Information and Software Technology , vol.40 , Issue.11-12 , pp. 583-594
    • Binkley, D.1
  • 11
    • 0027833830 scopus 로고
    • Abstract debugging of higher-order imperative languages
    • Bourdoncle, F. 1993a. Abstract debugging of higher-order imperative languages, ACM SIGPLAN Notices 28(6): 46-55.
    • (1993) ACM SIGPLAN Notices , vol.28 , Issue.6 , pp. 46-55
    • Bourdoncle, F.1
  • 13
    • 0003657047 scopus 로고    scopus 로고
    • Interprocedural pointer alias analysis
    • IBM Research
    • Burke, M., Carini, P.R., Choi, J.-D., and Hind, M. 1997. Interprocedural pointer alias analysis, Technical Report RC 21055, IBM Research.
    • (1997) Technical Report , vol.RC 21055
    • Burke, M.1    Carini, P.R.2    Choi, J.-D.3    Hind, M.4
  • 17
    • 84957691833 scopus 로고    scopus 로고
    • Incremental computation of static single assignment form
    • Lecture Notes in Computer Science. Springer
    • Choi, J.-D., Sarkar, V., and Schonberg, E. 1996. Incremental computation of static single assignment form, Proceedings of the Conference on Compiler Construction, Lecture Notes in Computer Science, Vol. 1060, pp. 223-237. Springer.
    • (1996) Proceedings of the Conference on Compiler Construction , vol.1060 , pp. 223-237
    • Choi, J.-D.1    Sarkar, V.2    Schonberg, E.3
  • 18
    • 84957700098 scopus 로고    scopus 로고
    • Effective representation of aliases and indirect memory operations in SSA form
    • Lecture Notes in Computer Science. Springer
    • Chow, F.C., Chan, S., Liu, S.-M., Lo, R., and Streich, M. 1996. Effective representation of aliases and indirect memory operations in SSA form, Proceedings of the Conference on Compiler Construction, Lecture Notes in Computer Science, Vol. 1060, pp. 253-267. Springer.
    • (1996) Proceedings of the Conference on Compiler Construction , vol.1060 , pp. 253-267
    • Chow, F.C.1    Chan, S.2    Liu, S.-M.3    Lo, R.4    Streich, M.5
  • 24
    • 84890014643 scopus 로고    scopus 로고
    • Estimating the impact of scalable pointer analysis on optimization
    • Lecture Notes in Computer Science. Springer
    • Das, M., Liblit, B., Fähndrich, M., and Rehof, J. 2001. Estimating the impact of scalable pointer analysis on optimization, Proceedings of the Static Analysis Symposium, Lecture Notes in Computer Science, Vol. 2126, pp. 260-278. Springer.
    • (2001) Proceedings of the Static Analysis Symposium , vol.2126 , pp. 260-278
    • Das, M.1    Liblit, B.2    Fähndrich, M.3    Rehof, J.4
  • 31
    • 84957649278 scopus 로고    scopus 로고
    • An even faster solver for general systems of equations
    • Lecture Notes in Computer Science
    • Fecht, C. and Seidl, H. 1996. An even faster solver for general systems of equations, Proceedings of the Static Analysis Symposium, Lecture Notes in Computer Science, Vol. 1145, pp. 189-204.
    • (1996) Proceedings of the Static Analysis Symposium , vol.1145 , pp. 189-204
    • Fecht, C.1    Seidl, H.2
  • 32
    • 84947755110 scopus 로고    scopus 로고
    • Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
    • Lecture Notes in Computer Science
    • Fecht, C. and Seidl, H. 1998. Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems, Proceedings of the European Symposium on Programming, Lecture Notes in Computer Science, Vol. 1381, pp. 90-104.
    • (1998) Proceedings of the European Symposium on Programming , vol.1381 , pp. 90-104
    • Fecht, C.1    Seidl, H.2
  • 35
    • 0003523613 scopus 로고    scopus 로고
    • Flow-insensitive points-to analysis with term and set constraints
    • University of California, Berkeley
    • Foster, J.S., Fahndrich, M., and Aiken, A. 1997. Flow-insensitive points-to analysis with term and set constraints, Technical Report CSD-97-964, University of California, Berkeley.
    • (1997) Technical Report , vol.CSD-97-964
    • Foster, J.S.1    Fahndrich, M.2    Aiken, A.3
  • 37
    • 84947443392 scopus 로고    scopus 로고
    • VeriSoft: A tool for the automatic analysis of concurrent reactive software
    • Lecture Notes in Computer Science
    • Godefroid, P. 1997. VeriSoft: A tool for the automatic analysis of concurrent reactive software, Proceedings of the Conference on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 1254, pp. 476-479.
    • (1997) Proceedings of the Conference on Computer Aided Verification , vol.1254 , pp. 476-479
    • Godefroid, P.1
  • 38
    • 0041005250 scopus 로고    scopus 로고
    • An improved inter-procedural may-alias analysis algorithm
    • New York University
    • Goyal, D. 1999. An improved inter-procedural may-alias analysis algorithm, Technical Report 1999-777, New York University.
    • (1999) Technical Report , vol.1999 , Issue.777
    • Goyal, D.1
  • 51
    • 0023454190 scopus 로고
    • An efficient general iterative algorithm for dataflow analysis
    • Horwitz, S., Demers, A.J., and Teitelbaum, T. 1987. An efficient general iterative algorithm for dataflow analysis, Acta Informatica 24(6): 679-694.
    • (1987) Acta Informatica , vol.24 , Issue.6 , pp. 679-694
    • Horwitz, S.1    Demers, A.J.2    Teitelbaum, T.3
  • 52
    • 84956630483 scopus 로고
    • Interprocedural slicing using dependence graphs
    • Horwitz, S., Reps, T., and Binkley, D. 1988. Interprocedural slicing using dependence graphs, ACM SIGPLAN Notices 23(7): 35-46.
    • (1988) ACM SIGPLAN Notices , vol.23 , Issue.7 , pp. 35-46
    • Horwitz, S.1    Reps, T.2    Binkley, D.3
  • 55
    • 79957470514 scopus 로고
    • Worklist management strategies
    • Microsoft Research
    • Kanamori, A. and Weise, D. 1994. Worklist management strategies, Technical Report MSR-TR-94-12, Microsoft Research.
    • (1994) Technical Report , vol.MSR-TR-94-12
    • Kanamori, A.1    Weise, D.2
  • 58
    • 84958054218 scopus 로고    scopus 로고
    • Extended SSA numbering: Introducing SSA properties to language with multi-level pointers
    • Lecture Notes in Computer Science. Springer
    • Lapkowski, C. and Hendren, L.J. 1998. Extended SSA numbering: Introducing SSA properties to language with multi-level pointers, Proceedings of the Conference on Compiler Construction, Lecture Notes in Computer Science, Vol. 1383, pp. 128-143. Springer.
    • (1998) Proceedings of the Conference on Compiler Construction , vol.1383 , pp. 128-143
    • Lapkowski, C.1    Hendren, L.J.2
  • 59
    • 35248842644 scopus 로고    scopus 로고
    • Scaling Java points-to analysis using SPARK
    • Lecture Notes in Computer Science. Springer
    • Lhoták, O. and Hendren, L.J. 2003. Scaling Java points-to analysis using SPARK, Proceedings of the Conference on Compiler Construction, Lecture Notes in Computer Science, Vol. 2622, pp. 153-169. Springer.
    • (2003) Proceedings of the Conference on Compiler Construction , vol.2622 , pp. 153-169
    • Lhoták, O.1    Hendren, L.J.2
  • 60
    • 84887498974 scopus 로고    scopus 로고
    • Efficient points-to analysis for whole-program analysis
    • Lecture Notes in Computer Science. Springer/ACM Press
    • Liang, D. and Harrold, M.J. 1999. Efficient points-to analysis for whole-program analysis, Proceedings of the Symposium on the Foundations of Software Engineering, Lecture Notes in Computer Science, Vol. 1687, pp. 199-215. Springer/ACM Press.
    • (1999) Proceedings of the Symposium on the Foundations of Software Engineering , vol.1687 , pp. 199-215
    • Liang, D.1    Harrold, M.J.2
  • 61
    • 84890043219 scopus 로고    scopus 로고
    • Efficient computation of parameterized pointer information for interprocedural analyses
    • Lecture Notes in Computer Science. Springer
    • Liang, D. and Harrold, M.J. 2001. Efficient computation of parameterized pointer information for interprocedural analyses, Proceedings of the Symposium on Static Analysis, Lecture Notes in Computer Science, Vol. 2126, pp. 279-298. Springer.
    • (2001) Proceedings of the Symposium on Static Analysis , vol.2126 , pp. 279-298
    • Liang, D.1    Harrold, M.J.2
  • 66
    • 85034641974 scopus 로고
    • Visual programming, programming by example, and program visualization: A taxonomy
    • Myers, B.A. 1986. Visual programming, programming by example, and program visualization: A taxonomy, Human Factors in Computing Systems, pp. 59-66.
    • (1986) Human Factors in Computing Systems , pp. 59-66
    • Myers, B.A.1
  • 68
    • 0028198016 scopus 로고
    • On finding the strongly connected components in a directed graph
    • Nuutila, E. and Soisalon-Soininen, E. 1994. On finding the strongly connected components in a directed graph, Information Processing Letters 49(1): 9-14.
    • (1994) Information Processing Letters , vol.49 , Issue.1 , pp. 9-14
    • Nuutila, E.1    Soisalon-Soininen, E.2
  • 70
    • 35048900606 scopus 로고    scopus 로고
    • A dynamic algorithm for topologically sorting directed acyclic graphs
    • Lecture Notes in Computer Science. Springer
    • Pearce, D.J. and Kelly, P.H.J. 2004. A dynamic algorithm for topologically sorting directed acyclic graphs, Proceedings of the Workshop on Efficient and Experimental Algorithms, Lecture Notes in Computer Science, Vol. 3059, pp. 383-398. Springer.
    • (2004) Proceedings of the Workshop on Efficient and Experimental Algorithms , vol.3059 , pp. 383-398
    • Pearce, D.J.1    Kelly, P.H.J.2
  • 82
  • 86
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • Tarjan, R. 1972. Depth-first search and linear graph algorithms, SIAM Journal on Computing 1(2): 146-160.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1
  • 87
    • 84957376851 scopus 로고    scopus 로고
    • VIS: A system for verification and synthesis
    • Lecture Notes in Computer Science. Springer
    • The Vis Group. 1996. VIS: A system for verification and synthesis, Proceedings of the Conference on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 1102, pp. 428-432. Springer.
    • (1996) Proceedings of the Conference on Computer Aided Verification , vol.1102 , pp. 428-432


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