Abstract | ||
---|---|---|
Using the technique of program transformation, families of related algorithms have been developed. We show that such families can be represented adequately by class subhierarchies of object-oriented systems where each class describes an algorithm on some level of abstraction. Its immediate subclasses correspond to the various more concrete algorithms that can be derived by different design alternatives. The incremental approach which is typical of object-oriented programming highlights the decisions that are made. We show the details of a subfamily of sorting algorithms and discuss related issues: specialization versus generalization, transforming for efficiency, and program correctness. |
Year | Venue | Keywords |
---|---|---|
1992 | STRUCTURED PROGRAMMING | PROGRAM TRANSFORMATION,OBJECT-ORIENTED PROGRAMMING,PROGRAM CORRECTNESS |
Field | DocType | Volume |
Computer science,Theoretical computer science | Journal | 13 |
Issue | ISSN | Citations |
2 | 0935-1183 | 1 |
PageRank | References | Authors |
0.37 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lothar Schmitz | 1 | 9 | 4.34 |