메뉴 건너뛰기




Volumn 47, Issue 2-3, 2003, Pages 221-242

Eliminating dead code on recursive data

Author keywords

Constraints; Dead code elimination; Program analysis; Recursive data structures; Regular tree grammars; Slicing

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; DATA REDUCTION; DATA STRUCTURES; SEMANTICS;

EID: 0037400724     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(02)00134-X     Document Type: Conference Paper
Times cited : (12)

References (65)
  • 7
    • 0017552770 scopus 로고
    • An algorithm for reduction of operator strength
    • Cocke J., Kennedy K. An algorithm for reduction of operator strength. Comm. ACM. 20(11):1977;850-856.
    • (1977) Comm. ACM , vol.20 , Issue.11 , pp. 850-856
    • Cocke, J.1    Kennedy, K.2
  • 15
    • 84947755110 scopus 로고    scopus 로고
    • Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
    • C. Hankin (Ed.), Proc. 7th European Symp. on Programming, Berlin: Springer
    • Fecht C., Seidl H. Propagating differences. an efficient new fixpoint algorithm for distributive constraint systems Hankin C. Proc. 7th European Symp. on Programming. Lecture Notes in Computer Science. vol. 1381:1998;90-104 Springer, Berlin.
    • (1998) Lecture Notes in Computer Science , vol.1381 , pp. 90-104
    • Fecht, C.1    Seidl, H.2
  • 20
    • 0012307668 scopus 로고
    • Practical aspects of set based analysis
    • K. Apt (Ed.), Cambridge, MA: The MIT Press, November
    • Heintze N. Practical aspects of set based analysis. Apt K. Proc. Joint Internat. Conf. and Symp. on Logic Programming. November 1992;765-779 The MIT Press, Cambridge, MA.
    • (1992) Proc. Joint Internat. Conf. and Symp. on Logic Programming , pp. 765-779
    • Heintze, N.1
  • 21
    • 0003721364 scopus 로고
    • Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October
    • N. Heintze, Set-based program analysis, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1992.
    • (1992) Set-Based Program Analysis
    • Heintze, N.1
  • 23
    • 85019291505 scopus 로고
    • Efficient type inference for higher-order binding-time analysis
    • Proc. 5th Internat. Conf. on Functional Programming Languages and Computer Architecture, Berlin: Springer, August
    • Henglein F. Efficient type inference for higher-order binding-time analysis. Proc. 5th Internat. Conf. on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science. vol. 523:August 1991;448-472 Springer, Berlin.
    • (1991) Lecture Notes in Computer Science , vol.523 , pp. 448-472
    • Henglein, F.1
  • 24
    • 0012278327 scopus 로고
    • Compile-time analysis of functional programs
    • D. Turner. Reading, MA: Addison-Wesley
    • Hughes J. Compile-time analysis of functional programs. Turner D. Research Topics in Functional Programming. 1990;117-153 Addison-Wesley, Reading, MA.
    • (1990) Research Topics in Functional Programming , pp. 117-153
    • Hughes, J.1
  • 27
    • 0002371687 scopus 로고
    • Flow analysis and optimization of LISP-like structures
    • S.S. Muchnick, & N.D. Jones. Englewood Cliffs, NJ: Prentice-Hall
    • Jones N.D., Muchnick S.S. Flow analysis and optimization of LISP-like structures. Muchnick S.S., Jones N.D. Program Flow Analysis. 1981;102-131 Prentice-Hall, Englewood Cliffs, NJ.
    • (1981) Program Flow Analysis , pp. 102-131
    • Jones, N.D.1    Muchnick, S.S.2
  • 29
    • 0018048449 scopus 로고
    • Use-definition chains with applications
    • Kennedy K. Use-definition chains with applications. J. Comput. Lang. 3(3):1978;163-179.
    • (1978) J. Comput. Lang. , vol.3 , Issue.3 , pp. 163-179
    • Kennedy, K.1
  • 31
  • 34
    • 0031631281 scopus 로고    scopus 로고
    • Dependence analysis for recursive data
    • Los Alamitos, CA: IEEE CS Press, May
    • Liu Y.A. Dependence analysis for recursive data. Proc. IEEE 1998 Internat. Conf. on Computer Languages. May 1998;206-215 IEEE CS Press, Los Alamitos, CA.
    • (1998) Proc. IEEE 1998 Internat. Conf. on Computer Languages , pp. 206-215
    • Liu, Y.A.1
  • 36
    • 84957866852 scopus 로고    scopus 로고
    • Dynamic programming via static incrementalization
    • Proc 8th European Symp. on Programming, Berlin: Springer, March
    • Liu Y.A., Stoller S.D. Dynamic programming via static incrementalization. Proc 8th European Symp. on Programming. Lecture Notes in Computer Science. vol. 1576:March 1999;288-305 Springer, Berlin.
    • (1999) Lecture Notes in Computer Science , vol.1576 , pp. 288-305
    • Liu, Y.A.1    Stoller, S.D.2
  • 39
    • 0029254310 scopus 로고
    • Systematic derivation of incremental programs
    • Liu Y.A., Teitelbaum T. Systematic derivation of incremental programs. Sci. Comput. Program. 24(1):1995;1-39.
    • (1995) Sci. Comput. Program , vol.24 , Issue.1 , pp. 1-39
    • Liu, Y.A.1    Teitelbaum, T.2
  • 41
    • 0002750052 scopus 로고    scopus 로고
    • Interconvertibility of a class of set constraints and context-free language reachability
    • Melski D., Reps T. Interconvertibility of a class of set constraints and context-free language reachability. Theoret. Comput. Sci. 248(1-2):2000;29-98.
    • (2000) Theoret. Comput. Sci. , vol.248 , Issue.1-2 , pp. 29-98
    • Melski, D.1    Reps, T.2
  • 46
    • 84976843894 scopus 로고
    • Finite differencing of computable expressions
    • Paige R., Koenig S. Finite differencing of computable expressions. ACM Trans. Program. Lang. Systems. 4(3):1982;402-454.
    • (1982) ACM Trans. Program. Lang. Systems , vol.4 , Issue.3 , pp. 402-454
    • Paige, R.1    Koenig, S.2
  • 48
    • 0030684280 scopus 로고    scopus 로고
    • Iteration space slicing and its application to communication optimization
    • Vienna, Austria, July
    • W. Pugh, E. Rosser, Iteration space slicing and its application to communication optimization, in: Internat. Conf. on Supercomputing, Vienna, Austria, July 1997.
    • (1997) Internat. Conf. on Supercomputing
    • Pugh, W.1    Rosser, E.2
  • 50
    • 84957647698 scopus 로고    scopus 로고
    • Program specialization via program slicing
    • O. Danvy, R. Glück, & P. Thiemann (Eds.), Proc. Dagstuhl Sem. on Partial Evaluation, Berlin: Springer
    • Reps T., Turnidge T. Program specialization via program slicing. Danvy O., Glück R., Thiemann P. Proc. Dagstuhl Sem. on Partial Evaluation. Lecture Notes in Computer Science. vol. 1110:1996;409-429 Springer, Berlin.
    • (1996) Lecture Notes in Computer Science , vol.1110 , pp. 409-429
    • Reps, T.1    Turnidge, T.2
  • 51
    • 0031598986 scopus 로고    scopus 로고
    • Solving shape-analysis problems in languages with destructive updating
    • Sagiv M., Reps T., Wilhelm R. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Systems. 20(1):1998;1-50.
    • (1998) ACM Trans. Program. Lang. Systems , vol.20 , Issue.1 , pp. 1-50
    • Sagiv, M.1    Reps, T.2    Wilhelm, R.3
  • 52
    • 0000065454 scopus 로고
    • Lectures on a mathematical theory of computation
    • M. Broy, & G. Schmidt. Dordrecht: D. Reidel Publishing Company
    • Scott D.S. Lectures on a mathematical theory of computation. Broy M., Schmidt G. Theoretical Foundations of Programming Methodology. 1982;145-292 D. Reidel Publishing Company, Dordrecht.
    • (1982) Theoretical Foundations of Programming Methodology , pp. 145-292
    • Scott, D.S.1
  • 55
    • 85010950644 scopus 로고
    • A grammar-based data-flow analysis to stop deforestation
    • S. Tison (Ed.), CAAP'94: Proc. 19th Internat. Colloq. on Trees in Algebra and Programming, Berlin: Springer, April
    • Sørensen M.H. A grammar-based data-flow analysis to stop deforestation. Tison S. CAAP'94: Proc. 19th Internat. Colloq. on Trees in Algebra and Programming. Lecture Notes in Computer Science. vol. 787:April 1994;335-351 Springer, Berlin.
    • (1994) Lecture Notes in Computer Science , vol.787 , pp. 335-351
    • Sørensen, M.H.1
  • 58
    • 0000990322 scopus 로고
    • A survey of program slicing techniques
    • Tip F. A survey of program slicing techniques. J. Program. Lang. 3(3):1995;121-189.
    • (1995) J. Program. Lang. , vol.3 , Issue.3 , pp. 121-189
    • Tip, F.1
  • 59
    • 0025444759 scopus 로고
    • Deforestation: Transforming programs to eliminate trees
    • (Special issue of selected papers from the 2nd European Symposium on Programming)
    • Wadler P. Deforestation. Transforming programs to eliminate trees Theoret. Comput. Sci. 73:1990;231-248. (Special issue of selected papers from the 2nd European Symposium on Programming).
    • (1990) Theoret. Comput. Sci. , vol.73 , pp. 231-248
    • Wadler, P.1
  • 60
    • 84909750205 scopus 로고
    • Projections for strictness analysis
    • Proc. 3rd Internat. Conf. on Functional Programming Languages and Computer Architecture, Berlin: Springer, September
    • Wadler P., Hughes R.J.M. Projections for strictness analysis. Proc. 3rd Internat. Conf. on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science. vol. 274:September 1987;385-407 Springer, Berlin.
    • (1987) Lecture Notes in Computer Science , vol.274 , pp. 385-407
    • Wadler, P.1    Hughes, R.J.M.2
  • 61
    • 0031641495 scopus 로고    scopus 로고
    • Set constraints for destructive array update optimization
    • Los Alamitos, CA: IEEE CS Press, May
    • Wand M., Clinger W.D. Set constraints for destructive array update optimization. Proc. IEEE 1998 Internat. Conf. on Computer Languages. May 1998;184-193 IEEE CS Press, Los Alamitos, CA.
    • (1998) Proc. IEEE 1998 Internat. Conf. on Computer Languages , pp. 184-193
    • Wand, M.1    Clinger, W.D.2
  • 64
    • 0021457061 scopus 로고
    • Program slicing
    • Weiser M. Program slicing. IEEE Trans. Software Eng. SE-10(4):1984;352-357.
    • (1984) IEEE Trans. Software Eng. , vol.SE-10 , Issue.4 , pp. 352-357
    • Weiser, M.1


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