Relational data bases in the design of program construction systems

ABSTRACT

A methodology for designing and implementing program construction systems using relational data bases is presented. Relations are the only data structures used by them and in the definition of interfaces between subsystems. A special-purpose relational database manager (RDB) has been designed for this application.Two large projects using this approach are described. ART (Ada-Relational-Translator) is an experimental compiler-interpreter for ADA in which all subsystems, including parser, semantic analyzer, interpreter and kernel, use relations as their only data structure; the relational approach has been pushed to the upmost to achieve fast prototyping. MML (Multi-Micro Line) is a tool-set for constructing program programs for multi-microprocessors targets, in which relations are used for allocation and configuration control. Both experiences confirm the validity of the approach for managing team work in evolving projects.

REFERENCES

• 1: {ADA 80} "Reference Manual for the Ada Programming Language", US-DoD, July 1980.
• 2: {ADA 82} "Reference Manual for the Ada Programming Language", US-DoD, July 1982.
• 3: {APSE 80} "Requirements for Ada Programming Support Environments", US-DoD, February 1980.
• 4: {BOARI 82} M. Boari et al: "MML: a Programming Line for Multiple-Microprocessor Systems", <u>Proc. IEEE 3rd conf. on Distributed Computer Systems</u>, Miami, 1982.
• 5: T. P. Baker, A One-Pass Algorithm for Overload Resolution in Ada, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.4, p.601-614, Oct. 1982 [doi>10.1145/69622.69623]
• 6: {CHAMB 76} D. D. Chamberlin et al.: "SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control", <u>IBM Journal of Res. and Devel.</u>, vol. 20 no. 6, 1976.
• 7: {CONTE 81} G. Conte, D. Del Corso, F. Gregoretti: "TOMP-80: a Multiprocessor Prototype", <u>Proc. Euro-Micro 81</u>, North Holland, 1981.
• 8: {GHEZZI 82} C. Ghezzi and M. Jazayeri: <u>Programming Language Concepts</u>, Wiley, NewYork, 1982.
• 9: William Kent, A simple guide to five normal forms in relational database theory, Communications of the ACM, v.26 n.2, p.120-125, Feb. 1983 [doi>10.1145/358024.358054]
• 10: J. Lewi , M. Huybrechts , Vlaminck K. De , J. Huens, A Programming Methodology in Compiler Construction, Elsevier Science Inc., New York, NY, 1979
• 11: B. J. MacLennan, Overview of relational programming, ACM SIGPLAN Notices, v.18 n.3, March 1983 [doi>10.1145/988209.988213]
• 12: {SCHATZ 79} B. R. Schatz et al.: "TCOL-ADA: an intermediate representation for the DoD standard programming language", Int. Rep. CMU-CS-79-112, Dept. of Comp. Sci., Carnegie Mellon Univ. Pittsburgh, 1979.
• 13: Michael Stonebraker , Gerald Held , Eugene Wong , Peter Kreps, The design and implementation of INGRES, ACM Transactions on Database Systems (TODS), v.1 n.3, p.189-222, Sept. 1976 [doi>10.1145/320473.320476]
• 14: Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman & Co., New York, NY, 1983
• 15: {YAU 81} S. S. Yau, P. C. Grabow: "A Model for representing Programs using Hierarchical Graphs", <u>IEEE-Trans. SE</u>, vol. 7 no. 6, November 1981, 556--574.

INDEX TERMS

Keywords:
compiler design, complex software design, interface design, prototyping, relational databases