Entry Flexeder:2011:FIL 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{Flexeder:2011:FIL,
  author =       "Andrea Flexeder and Markus M{\"u}ller-olm and Michael
                 Petter and Helmut Seidl",
  title =        "Fast interprocedural linear two-variable equalities",
  journal =      j-TOPLAS,
  volume =       "33",
  number =       "6",
  pages =        "21:1--21:??",
  month =        dec,
  year =         "2011",
  CODEN =        "ATPSDT",
  DOI =          "http://dx.doi.org/10.1145/2049706.2049710",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Thu Dec 29 16:28:40 MST 2011",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toplas/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  abstract =     "In this article we provide an interprocedural analysis
                 of linear two-variable equalities. The novel algorithm
                 has a worst-case complexity of $O(n,k^4)$, where $k$ is
                 the number of variables and $n$ is the program size.
                 Thus, it saves a factor of $k^4$ in comparison to a
                 related algorithm based on full linear algebra. We also
                 indicate how the practical runtime can be further
                 reduced significantly.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
}

Related entries