Entry Gerlek:1995:BIV from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Gerlek:1995:BIV,
  author =       "Michael P. Gerlek and Eric Stoltz and Michael Wolfe",
  title =        "Beyond Induction Variables: Detecting and Classifying
                 Sequences Using a Demand-Driven {SSA} Form",
  journal =      j-TOPLAS,
  volume =       "17",
  number =       "1",
  pages =        "85--122",
  month =        jan,
  year =         "1995",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/201003.html",
  abstract =     "Linear induction variable detection is usually
                 associated with the strength reduction optimization.
                 For restructuring compilers, effective data dependence
                 analysis requires that the compiler detect and
                 accurately describe linear and nonlinear induction
                 variables as well as more general sequences. In this
                 article we present a practical technique for detecting
                 a broader class of linear induction variables than is
                 usually recognized, as well as several other sequence
                 forms, including periodic, polynomial, geometric,
                 monotonic, and wrap-around variables. Our method is
                 based on Factored Use-Def (FUD) chains, a demand-driven
                 representation of the popular Static Single Assignment
                 (SSA) form. In this form, strongly connected components
                 of the associated SSA graph correspond to sequences in
                 the source program: we describe a simple yet efficient
                 algorithm for detecting and classifying these
                 sequences. We have implemented this algorithm in
                 Nascent, our restructuring Fortran 90+ compiler, and we
                 present some results showing the effectiveness of our
                 approach.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; languages",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf D.3.4}: Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers.",
}

Related entries