Check nearby libraries
Buy this book
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)
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Computer programming, Algorithms, AutomationShowing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Top-down synthesis of simple divide and conquer algorithms
1982, Naval Postgraduate School
in English
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Published in
Monterey, Calif
Edition Notes
"NPS-52-82-011."
"November 1982."
Cover title.
"Prepared for: Chief of Naval Research; Arlington, VA 22217."
Includes bibliographic references (p. 98-99).
"Approved for public release; distribution is unlimited."
Technical report; 1982.
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created July 25, 2014
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
May 15, 2020 | Edited by CoverBot | Added new cover |
July 25, 2014 | Created by ImportBot | Imported from Internet Archive item record. |