메뉴 건너뛰기




Volumn 25, Issue 6, 2003, Pages 776-813

Fractal symbolic analysis

Author keywords

Algorithms; Languages; Theory

Indexed keywords

FRACTAL SYMBOLIC ANALYSIS; LANGUAGES; MEMORY LOCATIONS; PROGRAM STATEMENTS;

EID: 4544346973     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/945885.945888     Document Type: Article
Times cited : (21)

References (32)
  • 4
    • 1942435049 scopus 로고    scopus 로고
    • Equational verification of cache blocking in lu decomposition using Kleene algebra with tests
    • Cornell University, Ithaca, NY
    • BARTH, A. AND KOZEN, D. 2002. Equational verification of cache blocking in lu decomposition using Kleene algebra with tests. Tech. rep. 2002-1865. Cornell University, Ithaca, NY.
    • (2002) Tech. Rep. , vol.2002 , Issue.1865
    • Barth, A.1    Kozen, D.2
  • 5
    • 84938023119 scopus 로고
    • Analysis of programs for parallel processing
    • BERNSTEIN, A. 1966. Analysis of programs for parallel processing. IEEE Trans. Electron. Comput. EC-15, 5, 757-763.
    • (1966) IEEE Trans. Electron. Comput. , vol.EC-15 , Issue.5 , pp. 757-763
    • Bernstein, A.1
  • 6
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • BRYANT, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C35, 8 (Aug.), 677-691.
    • (1986) IEEE Trans. Comput. , vol.C35 , Issue.8 AUG. , pp. 677-691
    • Bryant, R.E.1
  • 7
    • 0031223129 scopus 로고    scopus 로고
    • Compiler blockability of dense matrix factorizations
    • CARR, S. AND LEHOUCQ, R. B. 1997. Compiler blockability of dense matrix factorizations. ACM Trans. Math. Softw. 23, 3 (Sept.), 336-361.
    • (1997) ACM Trans. Math. Softw. , vol.23 , Issue.3 SEPT. , pp. 336-361
    • Carr, S.1    Lehoucq, R.B.2
  • 11
    • 0003889493 scopus 로고    scopus 로고
    • Compiler techniques for MATLAB programs
    • Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
    • DEROSE, L. A. 1996. Compiler techniques for MATLAB programs. Tech. rep. 1956. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL.
    • (1996) Tech. Rep. , vol.1956
    • DeRose, L.A.1
  • 12
    • 0026109335 scopus 로고
    • Dataflow analysis of array and scalar references
    • FEAUTRIER, P. 1991. Dataflow analysis of array and scalar references. Int. J. Parallel Program. 20, 1 (Feb.), 23-53.
    • (1991) Int. J. Parallel Program. , vol.20 , Issue.1 FEB. , pp. 23-53
    • Feautrier, P.1
  • 13
    • 0026933251 scopus 로고
    • Some efficient solutions to the affine scheduling problem - Part 1: One dimensional time
    • FEAUTRIER, P. 1992. Some efficient solutions to the affine scheduling problem - part 1: One dimensional time. Int. J. Parallel Program. 21, 5 (Oct.), 313-348.
    • (1992) Int. J. Parallel Program. , vol.21 , Issue.5 OCT. , pp. 313-348
    • Feautrier, P.1
  • 14
    • 0004236492 scopus 로고    scopus 로고
    • The Johns Hopkins University Press, Baltimore, MD
    • GOLUB, G. AND LOAN, C. V. 1996. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD.
    • (1996) Matrix Computations
    • Golub, G.1    Loan, C.V.2
  • 15
    • 0004114762 scopus 로고
    • Foundations of Computing Series. MIT Press, Cambridge, MA
    • GUNTER, C. A. 1992. Semantics of Programming Languages. Foundations of Computing Series. MIT Press, Cambridge, MA.
    • (1992) Semantics of Programming Languages
    • Gunter, C.A.1
  • 17
    • 84968488129 scopus 로고
    • Generation of permutations by adjacent transposition (in technical notes and short papers)
    • JOHNSON, S. M. 1963. Generation of permutations by adjacent transposition (in Technical Notes and Short Papers). Math. Comput. 17, 83 (July), 282-285.
    • (1963) Math. Comput. , vol.17 , Issue.83 JULY , pp. 282-285
    • Johnson, S.M.1
  • 18
    • 0004257495 scopus 로고
    • Mathematisch Centrum, Amsterdam, The Netherlands
    • KLOP, J. W. 1980. Combinatory Reduction Systems. Mathematisch Centrum, Amsterdam, The Netherlands.
    • (1980) Combinatory Reduction Systems
    • Klop, J.W.1
  • 20
    • 0005300894 scopus 로고    scopus 로고
    • The caml light system, release 0.71
    • Sophia Antipolis, France
    • LEROY, X. 1996. The Caml Light system, release 0.71. Documentation and user's manual. Tech. rep. INRIA, Sophia Antipolis, France. Available online from Projet Cristal at http://pauillac.inria.fr.
    • (1996) Documentation and User's Manual. Tech. Rep. INRIA
    • Leroy, X.1
  • 21
    • 0028409782 scopus 로고
    • A singular loop transformation based on non-singular matrices
    • Li, W. AND PINGALI, K. 1994. A singular loop transformation based on non-singular matrices. Int. J. Parallel Program. 22, 2 (April), 183-205.
    • (1994) Int. J. Parallel Program , vol.22 , Issue.2 APRIL , pp. 183-205
    • Li, W.1    Pingali, K.2
  • 22
    • 0029194451 scopus 로고
    • Enhancing array dataflow dependence analysis with on-demand global value propagation
    • MASLOV, V. 1995. Enhancing array dataflow dependence analysis with on-demand global value propagation. In Proceedings of the International Conference on Supercomputing. 265-269.
    • (1995) Proceedings of the International Conference on Supercomputing , pp. 265-269
    • Maslov, V.1
  • 23
    • 24644470282 scopus 로고    scopus 로고
    • Left-looking to right-looking and vice versa: An application of fractal symbolic analysis to linear algebra code restructuring
    • Munich, Germany
    • MATEEV, N., MENON, V., AND PINGALI, K. 2000. Left-looking to right-looking and vice versa: An application of fractal symbolic analysis to linear algebra code restructuring. In Proceedings of Euro-Par (Munich, Germany).
    • (2000) Proceedings of Euro-par
    • Mateev, N.1    Menon, V.2    Pingali, K.3
  • 25
    • 84976676720 scopus 로고
    • The Omega test: A fast and practical integer programming algorithm for dependence analysis
    • PUGH, W. 1992. The Omega test: A fast and practical integer programming algorithm for dependence analysis. Commun. ACM 35, 8(Aug.), 102-114.
    • (1992) Commun. ACM , vol.35 , Issue.8 AUG. , pp. 102-114
    • Pugh, W.1
  • 26
    • 0033076827 scopus 로고    scopus 로고
    • The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization
    • RAUCHWERGER, L. AND PADUA, D. A. 1999. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Trans. Parallel Distrib. Syst. 10, 2 (Feb.), 218-232.
    • (1999) IEEE Trans. Parallel Distrib. Syst. , vol.10 , Issue.2 FEB. , pp. 218-232
    • Rauchwerger, L.1    Padua, D.A.2
  • 27
    • 0003656654 scopus 로고
    • Symbolic program analysis in almost linear time
    • REIF, J. H. AND TARJAN, R. E. 1982. Symbolic program analysis in almost linear time. SIAM J. Comput. 11, 1 (Feb.), 81-93.
    • (1982) SIAM J. Comput. , vol.11 , Issue.1 FEB. , pp. 81-93
    • Reif, J.H.1    Tarjan, R.E.2
  • 28
    • 0031274872 scopus 로고    scopus 로고
    • Commutativity analysis: A new analysis technique for parallelizing compilers
    • RINARD, M. C. AND DINIZ, P. C. 1997. Commutativity analysis: A new analysis technique for parallelizing compilers. ACM Trans. Program. Lang. Syst. 19, 6 (Nov.), 942-991.
    • (1997) ACM Trans. Program. Lang. Syst. , vol.19 , Issue.6 NOV. , pp. 942-991
    • Rinard, M.C.1    Diniz, P.C.2
  • 29
    • 0021457061 scopus 로고
    • Program slicing
    • WEISER, M. 1984. Program slicing. IEEE Trans. Softw. Eng. 10, 4, 352-357.
    • (1984) IEEE Trans. Softw. Eng. , vol.10 , Issue.4 , pp. 352-357
    • Weiser, M.1
  • 31
    • 0030379246 scopus 로고    scopus 로고
    • Combining loop transformations considering caches and scheduling
    • Silicon Graphics, Mountain View, CA
    • WOLF, M. E., MAYDAN, D. E., AND CHEN, D.-K. 1996. Combining loop transformations considering caches and scheduling. In MICRO 29. Silicon Graphics, Mountain View, CA, 274-286.
    • (1996) MICRO , vol.29 , pp. 274-286
    • Wolf, M.E.1    Maydan, D.E.2    Chen, D.-K.3


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