The Kestrel Interactive Development System (KIDS), which provides automated support for
the development of correct and efficient programs from formal specifications, is described …

Despite the long history of classical planning, there has been very little comparative analysis
of the performance tradeoffs offered by the multitude of existing planning algorithms. This is …

The major reason for the lack of use'of parallel'computing, is the mismatch between the
complexity and variety of parallel hardware, and the software development tools to program …

Algorithm theories represent the structure common to a class of algorithms, such as divide-
and-conquer or backtrack. An algorithm theory for a class A provides the basis for design …

This paper presents an overview and a survey of logic program synthesis. Logic program
synthesis is interpreted here in a broad way; it is concerned with the following question …

In this paper, we describe a way to improve the performance of hand-tailorable planners by
compiling each domain description into a separate domain-specific planner. We discuss …

Specification morphisms underlie the refinement of algebraic specifications and provide the
logical foundations for algorithm and data structure design. We present four techniques for …

We introduce function variables to constraint programs (CP), variables whose values are
one of (exponentially many) possible functions between two sets. Such variables are useful …

Program synthesis is a solution to the software crisis. If we had a program that develops
correct programs from specifications, then program validation and maintenance would …

To solve a problem with a dynamic programming algorithm, one must reformulate the
problem such that its solution can be formed from solutions to overlapping subproblems …