Abstract
The system ADTCOMP constructs working programs from algebraic specifications of abstract data types. It is an experimental system devised to develop methods for codifying a rather broad extent of programming knowledge necessary to generate programs from axiomatizations constituting the most abstract form of specifying data types.
ADTCOMP codifies programming knowledge in terms of five separate production systems which are successively applied to an algebraic specification and intermediate results. So far, the system is restricted to specifications of data types with objects being inductively constructed from elementary objects. ADTCOMP admits hidden operations and successively generates code for all specifications we could get hold of. ADTCOMP compiles LISP-programs representing data objects as singly/doubly linked lists, association lists, and arrays.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Coguen, J.A., J.W. Thatcher, E.G. Wagner. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. IBM Research Rept. RC-6487 (1976).
Thatcher, J.W., E.G. Wagner, J.B. Wright. Data Type Specification: Parametrization and the Power of Specification Techniques (Revised). IBM Res. Rept. (1979).
Barstow, D.R. Automatic construction of algorithms and data structures using a knowledge base of programming rules. Rept. STAN-CS-77–641(77), Stanford U.
Barstow, D.R. Experience with a refinement paradigm in a knowledge-based automatic programming system. Proc. AISB/GI-Conference on Artificial intelligence 1978.
Bibel, W. Syntax-directed, semantics-supported program synthesis. Proc. 4th Workshop on Automatic Deduction (Austin, Texas), 1979.
Davis, R., I.King. An overview of production systems in El cock, Michie (Eds.) Machine Representation of Knowledge. Horwood & Wylie, 1977.
Eigemeier, H., Ch.Knabe, P.Raulefs, K.Tramer. Automatic implemen ion of algebraic specifications of abstract data types. Memo SEKI-BN-79- (Nov. 79), Univ. Bonn, Inst. f. Informatik III and Proc. AISB-80 Conf. on Artificial Intelligence (in press).
Green, C.C. The design of the PSI program synthesis system. Proc. 2nd Inf. Conf. on Software Engineering (San Francisco, CA), 1976.
Hornung, G., P.Raulefs. Terminal algebra semantics and retractions for abstract data types. Proc. 7th ICALP, 1980. Springer LNCS (in press).
Kant, E. Efficiency considerations in programming synthesis: a knowledge-based approach. Tech. Rept. STAN-CS-79–755, Comp. Sci. Dept, Stanford Univ.
Manna, Z., R.Waldinger. Synthesis: Dreams ⇒ Programs. IEEE-TSE:5(1979)294–327.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Eigemeier, H., Knabe, C., Raulefs, P., Tramer, K. (1980). An Expert System for Automatic Coding of Abstract Data Type Specifications. In: Wilhelm, R. (eds) GI - 10. Jahrestagung. Informatik-Fachberichte, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-67838-7_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10388-2
Online ISBN: 978-3-642-67838-7
eBook Packages: Springer Book Archive