<div class="description">
<dl><dd>"NPS-52-82-011."</dd>
<dd>"November 1982."</dd>
<dd>Cover title</dd>
<dd>Includes bibliographic references (p. 98-99)</dd>
<dd>"Prepared for: Chief of Naval Research; Arlington, VA 22217."</dd>
<dd>Technical report; 1982</dd>
<dd>A new method is presented for the deductive synthesis of computer programs. The method takes as given a formal specification of a user's problem. The specification is allowed to be incomplete in that some or all of the input conditions may be omitted. A completed specification plus a computer program are produced by the method. Synthesis involves the top-down decomposition of the user's problem into a hierarchy of subproblems. Solving each of these subproblems results in the synthesis of a hierarchically structured program. The program is guaranteed to satisfy the completed specification and to terminate on all legal inputs. In this paper we present a framework for a top-down synthesis process, explore the structure of a class of divide and conquer algorithms, and present a method for the top-down synthesis of algorithms in this class. Detailed derivations of four sorting algorithms are presented. (Author)</dd></dl><br>Subjects: UNITED STATES. ARMY--EQUIPMENT.; MILITARY SURVEILLANCE--UNITED STATES.; DRONE AIRCRAFT--UNITED STATES.; RECONNAISSANCE AIRCRAFT--UNITED STATES.</div>
<div class="fn value">
Smith, Douglas R.</div>
Internet Archive identifier