论文信息 - Automating the Design of Algorithm

Automating the Design of Algorithm

This paper has two roughly independent parts. The first is devoted to the automation of program construction. The Kestrel Interactive Development System (KIDS) provides knowledge-based support for the derivation of correct and efficient programs from specifications. We trace the use of KIDS in deriving a scheduling algorithm. The derivation illustrates algorithm design, deductive inference, simplification, finite differencing, partial evaluation, data type refinement, and other techniques. All of the KIDS operations are automatic except the algorithm design tactics which require some interaction at present. Dozens of programs have been derived using the KIDS environment.

Douglas R. Smith

[1] Douglas R. Smith. Track assignment in an air traffic control system: a rational reconstruction of system design , 1992, Proceedings of the Seventh Knowledge-Based Software Engineering Conference.

[2] Zohar Manna,et al. A Deductive Approach to Program Synthesis , 1979, TOPL.

[3] David Gries,et al. The Science of Programming , 1981, Text and Monographs in Computer Science.

[4] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[5] Robert Paige,et al. Finite Differencing of Computable Expressions , 1982, TOPL.

[6] Douglas R. Smith. Applications of a Strategy for Designing Divide-and-Conquer Algorithms , 1987, Sci. Comput. Program..

[7] Douglas R. Smith,et al. Top-Down Synthesis of Divide-and-Conquer Algorithms , 1985, Artif. Intell..

[8] Douglas R. Smith. Constructing Specification Morphisms , 1993, J. Symb. Comput..

[9] Michael R. Lowry. Algorithm Synthesis through Problem Reformulation , 1987, AAAI.

[10] Douglas R. Smith,et al. KIDS: A Semiautomatic Program Development System , 1990, IEEE Trans. Software Eng..

[11] Dines Bjørner,et al. Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987 , 1988 .