Theory of Algorithm Structure and Design

Abstract

Algorithms and data structures are among the primary constituents of computer software and thus are among basic objects of study in Computer Science. This project is concerned with the structure and automated design of algorithms and data structures. Our scientific hypothesis is that there exist general algorithm, data structure,and design concepts that underlie and explain most of the detailed structure of conventional software systems. By abstracting and formalizing these concepts and showing how to mechanize their application, we can prepare the way for the coming generation of automated software design environments. Our approach involves identifying classes of algorithms that solve a broad range of useful problems. In particular we have emphasized formalizing abstract algorithms that make minimal assumptions about the structure of a problem. Once a class of algorithms has been identified we represent its essence as a theory, called and algorithm theory. (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 05, 1990
Accession Number
ADA229115

Entities

People

  • Douglas R. Smith

Organizations

  • Kestrel Institute

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Human Systems

DTIC Thesaurus Topics

  • Algorithm Theory
  • Algorithms
  • California
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Electronic Mail
  • Engineering
  • Information Systems
  • Military Research
  • New York
  • Programming Languages
  • Software Design
  • Software Development
  • Systems Engineering
  • Trees (Data Structures)

Fields of Study

  • Computer science
  • Engineering

Readers

  • Database Systems and Applications
  • Parallel and Distributed Computing.
  • Theoretical Analysis.