Program transformation

About: Program transformation is a research topic. Over the lifetime, 2468 publications have been published within this topic receiving 73415 citations.

Parallel Algorithm Derivation and Program Transformation

Abstract: Transformational programming and parallel computation are two emerging fields that may ultimately depend on each other for success. Perhaps because ad hoc programming on sequential machines is so straightforward, sequential programming methodology has had little impact outside the academic community, and transformational methodology has had little impact at all. However, because ad hoc programming for parallel machines is so hard, and because progress in software construction has lagged behind architectural advances for such machines, there is a much greater need to develop parallel programming and transformational methodologies. Parallel Algorithm Derivation and Program Transformation stimulates the investigation of formal ways to overcome problems of parallel computation, with respect to both software development and algorithm design. It represents perspectives from two different communities: transformational programming and parallel algorithm design, to discuss programming, transformational, and compiler methodologies for parallel architectures, and algorithmic paradigms, techniques, and tools for parallel machine models. Parallel Algorithm Derivation and Program Transformation is an excellent reference for graduate students and researchers in parallel programming and transformational methodology. Each chapter contains a few initial sections in the style of a first-year, graduate textbook with many illustrative examples. The book may also be used as the text for a graduate seminar course or as a reference book for courses in software engineering, parallel programming or formal methods in program development.

Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution

Abstract: Distributed software systems are typically built according to a three layer conceptual structure: Objects on the lowest layer are clustered by components on the second layer, which themselves are located at nodes of a computer network on the third layer. Orthogonal to these three layers, an instance level and a type or schema level are distinguished when modeling these systems. Accordingly, the changes a system experiences during its lifetime can be classified as the system's dynamic behavior on the instance level and as the evolution of the system on the schema level. This paper shows how concepts from the area of graph transformation can be applied to provide a conceptual and formal framework for describing the structural and behavioral aspects of such systems.

Program synthesizing method and apparatus

Abstract: A plurality of program components, which do not have matching interfaces, are combined together automatically to generate a larger new program. An interface specifications' database registers the interface specifications corresponding to each of the program components. A program transformation rule memory stores transformation rules for controlling the reconciliation of the non-matching interface specifications of the program components. A data type memory stores data type transformation rules for reconciling non matching data specifications. A mediating program generator detects a mismatch of the interface specifications between at least two program components which are being combined and generates a mediating program in accordance with the program transformation rule and the data type transformation rule which mediating program enables the two programs and their data to communicate. A components composer generates the larger new program from the program components in the program components' database and the generated mediating program.

Combining abstract interpretation and partial evaluation

Abstract: Earlier work has shown that partial evaluation of a self-interpreter with respect to an input program can be used to effect program transformation. This talk shows that this technique, augmented by a preliminary abstract interpretation, can yield, among many other transformations: . Safe, efficient execution of programs in an unsafe language, and . A change in program style, from one list representation to another Further, partial evaluation can be viewed as an on-line polyvariant abstract interpretation, augmented by code generation. This view generalizes conventional projection-based partial evaluation in the direction of Turchin's supercompilation.