Entry Cytron:1990:CRC from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | 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{Cytron:1990:CRC,
  author =       "Ron Cytron and Jeanne Ferrante and Vivek Sarkar",
  title =        "Compact representations for control dependence",
  journal =      j-SIGPLAN,
  volume =       "25",
  number =       "6",
  pages =        "337--351",
  month =        jun,
  year =         "1990",
  CODEN =        "SINODQ",
  ISBN =         "0-89791-364-7",
  ISBN-13 =      "978-0-89791-364-5",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:15:53 MST 2003",
  bibsource =    "Compendex database; http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p337-cytron/",
  abstract =     "Recently the Program Dependence Graph (PDG) has been
                 shown useful as a basis for solving a variety of
                 problems, including optimization, vectorization,
                 translation to dataflow machines, code generation for
                 VLIW machines, program transformation, merging versions
                 of programs, and automatic detection and management of
                 parallelism. The edges of the PDG consist of control
                 dependence and data dependence edges. The data
                 dependence edges represent the essential data flow
                 relationships of a program. In this paper, we examine
                 the control dependence aspect of the PDG, which
                 summarizes essential control flow relationships in a
                 program. Informally, for nodes X and Y in CFG, Y is
                 control dependent on X if during execution, X can
                 directly affect whether Y is executed. We improve the
                 space and time required to compute those aspects of
                 control dependence used by most algorithms.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM T. J. Watson Research Cent",
  affiliationaddress = "Yorktown Heights, NY, USA",
  annote =       "Published as part of the Proceedings of PLDI'90.",
  classification = "722; 723",
  conference =   "Proceedings of the ACM SIGPLAN '90 Conference on
                 Programming Language Design and Implementation",
  conferenceyear = "1990",
  journalabr =   "SIGPLAN Not",
  keywords =     "algorithms; Computer Operating Systems; Computer
                 Programming Languages --- Design; Control Dependence;
                 design; experimentation; Optimizing Compilers;
                 performance; Program Compilers; Program Dependence
                 Graph (PDG); theory",
  meetingaddress = "White Plains, NY, USA",
  meetingdate =  "Jun 20--22 1990",
  meetingdate2 = "06/20--22/90",
  sponsor =      "Assoc for Computing Machinery, Special Interest Group
                 on Programming Languages",
  subject =      "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS
                 OF PROGRAMS, Studies of Program Constructs, Control
                 primitives. {\bf F.2.2} Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf G.2.2} Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.3}
                 Software, PROGRAMMING LANGUAGES, Language Constructs
                 and Features, Control structures. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Optimization.",
}

Related entries