Methodology for algorithm development through schema transformations
Technical Report
·
OSTI ID:6690752
A programming methodology based on schema transformations is presented. Such an approach is a logical outcome of recent developments in program manipulating systems. Concurrent development of algorithms and thir proofs of correctness is a significant feature of the proposed methodology. As the development process begins with an abstract schema, it is often possible to derive several related end algorithms in a single development process. This has implications in both the economics of software development and the understanding and teaching of algorithms. The initial schematic specification (a skeleton algorithm schema), the intermediate and final algorithm schemata are all expressed in Darlington's first-order recursion equation language exploiting set-theoretic constructs. A set of transformation rules together with a set of reduction rules for set expressions is then used to successively transform the schematic specification into different algorithm schemata. Most of the transformations are applications of a small number of common rewriting rules.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6690752
- Report Number(s):
- ANL-82-45; ON: DE83003342
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel programming with algorithmic skeletons
Proceedings of a symposium on logic in computer science
Parallel implementation of concurrent logic languages using graph-rewriting techniques
Conference
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:6782487
Proceedings of a symposium on logic in computer science
Conference
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6118612
Parallel implementation of concurrent logic languages using graph-rewriting techniques
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5533843