A library of generic algorithms in Ada

ABSTRACT

It is well-known that data abstractions are crucial to good software engineering practice. We argue that algorithmic abstractions, or generic algorithms, are perhaps even more important for software reusability. Generic algorithms are parameterized procedural schemata that are completely independent of the underlying data representation and are derived from concrete, efficient algorithms. We discuss this notion with illustrations from the structure of an Ada library of reusable software components we are presently developing.

REFERENCES

• 1: Booth, G., Software Components in Ada. Benjamin/Cummings, 1987.
• 2: O.-J. DaM, E. W. Dijkstra, and C. A. R. Hoare, Structured Programming, Academic Press, 1972.
• 3: Brian W. Kernighan , P. J. Plauger, Software Tools in Pascal, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1981
• 4: Donald E. Knuth, The Art of Computer Programming Volumes 1-3 Boxed Set, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1998
• 5: D. R. Musser and A. A. Stepanov, Ada Generic Library Linear Data Structure Packages, Vol. 1, to appear as a General Electric Corporate Research and Development Report, October 1987.
• 6: Robert Sedgewick, Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1984
• 7: Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 1984
• 8: Niklaus Wirth, Algorithms + Data Structures = Programs, Prentice Hall PTR, Upper Saddle River, NJ, 1978

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Data types and structures

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.2 Design Tools and Techniques
          Subjects: Software libraries
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: Ada

General Terms:
Algorithms, Design, Languages, Performance, Theory