Results 1 
5 of
5
Viewing A Program Transformation System At Work
 Joint 6th International Conference on Programming Language Implementation and Logic Programming (PLILP) and 4th International conference on Algebraic and Logic Programming (ALP), volume 844 of Lecture Notes in Computer Science
, 1994
"... How to decrease labor and improve reliability in the development of efficient implementations of nonnumerical algorithms and labor intensive software is an increasingly important problem as the demand for computer technology shifts from easier applications to more complex algorithmic ones; e.g., opt ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
How to decrease labor and improve reliability in the development of efficient implementations of nonnumerical algorithms and labor intensive software is an increasingly important problem as the demand for computer technology shifts from easier applications to more complex algorithmic ones; e.g., optimizing compilers for supercomputers, intricate data structures to implement efficient solutions to operations research problems, search and analysis algorithms in genetic engineering, complex software tools for workstations, design automation, etc. It is also a difficult problem that is not solved by current CASE tools and software management disciplines, which are oriented towards data processing and other applications, where the implementation and a prediction of its resource utilization follow more directly from the specification. Recently, Cai and Paige reported experiments suggesting a way to implement nonnumerical algorithms in C at a programming rate (i.e., source lines per second) t...
Future Directions In Program Transformations
, 1997
"... This paper briefly surveys what transformational programming is about, and how to make progress in the field. A program transformation is a meaningpreserving mapping defined on a programming language. Transformational programming is a program development methodology in which an implementation I is ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This paper briefly surveys what transformational programming is about, and how to make progress in the field. A program transformation is a meaningpreserving mapping defined on a programming language. Transformational programming is a program development methodology in which an implementation I is obtained from a specification S by applying a sequence T k :::T 1 of transformations to S. If S and each transformation T i applied to successive implementations T i\Gamma1 :::T 1 S of S are proved correct for
The Derivation of a Hierarchy of Algorithms for Pattern Matching on Arrays
 Proceedings ATABLE92, Second international workshop on array structures
, 1992
"... This paper derives a hierarchy of algorithms for pattern matching on arrays in the BirdMeertens calculus for program transformation. In this calculus, both specifications and algorithms are functions, and a few highlevel theorems are used as transformation rules. An algorithm is derived from its s ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper derives a hierarchy of algorithms for pattern matching on arrays in the BirdMeertens calculus for program transformation. In this calculus, both specifications and algorithms are functions, and a few highlevel theorems are used as transformation rules. An algorithm is derived from its specification by means of a calculation which typically consists of a sequence of equalities, each an instantiation of a highlevel theorem or a definition. Aspects of the BirdMeertens calculus can be found in [4], [5], [9], [14], [15], and [13]. The laws we use in the derivation are derived from the definition of the data type
Finding palindromes: variants and algorithms
"... Abstract. The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It al ..."
Abstract
 Add to MetaCart
Abstract. The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. The paper connects the properties for palindrome predicates to two algorithms for finding palindromes in strings, and shows how we can extend some of the predicates to satisfy the properties that allow us to use an algorithm for finding palindromes. 1