Listing 1 - 10 of 69 << page
of 7
>>
Sort by
Gesellschaft für Informatik: Fachtagung über Programmiersprachen, Kiel, 5.-7. März 1974
Authors: --- ---
ISBN: 3540066667 Year: 1974 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Logic program synthesis and transformation : proceedings of LOPSTR '91, International Workshop on Logic Program Synthesis and Transformation, University of Manchester, 4-5 July 1991
Authors: --- ---
ISBN: 0387197427 3540197427 144713494X 9783540197423 Year: 1992 Publisher: London : Springer,

Efficiency in program synthesis
Author:
ISBN: 083571215X 9780835712156 Year: 1981 Volume: 8 Publisher: Ann Arbor: UMI research press,

Reasoning about program transformations : imperative programming and flow of data
Author:
ISBN: 0387953914 9780387953915 9780387224619 9786610009534 1280009535 0387224610 Year: 2003 Publisher: New York: Springer,

Loading...
Export citation

Choose an application

Bookmark

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.

Listing 1 - 10 of 69 << page
of 7
>>
Sort by