rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Reasoning About Program Transformations
    sub title: Imperative Programming and Flow of Data
  name:
    name part: Collard, Jean-François.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxu
    date issued: 2003
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 238 p. online resource.
  abstract: Overview The motivation of this text lies in what we believe is the inadequacy of current frameworks to reason about the ?ow of data in imperative programs. This inadequacy clearly shows up when dealing with the individual side effects of loop iterations. - deed, we face a paradoxical situation where, on the one hand, a typical program spends most of its execution time iterating or recursing on a few lines of codes, and, on the other hand, current optimization frameworks are clumsy when trying to capture the effects of each incarnation of these few lines—frameworks we inherited from designs made decades ago. The reasons are manyfold, but one of them stands out: The same concepts have been used, on the one hand, to represent and manipulate programs internally in compilers and, on the other hand, to allow us humans to reason about optimizations. Unfortunately, these two uses have different aims and constraints. An example of such a situation is given by control-?ow graphs of basic blocks, which have been - tremely useful in practice as an internal representation of programs, but which are not always adequate or convenient to formally think about programs and specify their transformations. In some cases, de?nitions based on control-?ow graphs can be overly restrictive. Dominance, studied in Chapter 4, is a good example.
  table of contents: Basic Concepts -- Describing Program Executions -- Labels -- Analyses and Transformations -- Revisiting Some Classical Compiler Concepts -- Reaching Definition Analysis -- Applications of Reaching Definition Analysis -- Some Classical Compiler Concepts, Part II -- Data Flow and Expansion -- Single-Assignment Forms -- Maximal Static Expansion -- Parallel Languages -- Conclusion: Toward Algorithm Recognition.
  note: edited by Jean-François Collard.
  subject:
    topic: Computer science
  subject:
    topic: Computer programming
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer Science
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Programming Techniques
  classification: QA76.7-76.73
  classification: QA76.76.C65
  classification: 005.13
  related item:
    title info:
      title: Springer eBooks
  identifier: 9780387224619
  identifier: http://dx.doi.org/10.1007/b97654
  record info:
    record creation date: 100301
    record change date: 20151204173050.0
    record identifier: 978-0-387-22461-9