Abstract
The overall goal in the field of systems for automated synthesis, such as program synthesis, design, configuration or scheduling, is to construct plans or executable systems that conform with user-needs and adapt to changing environments. The Internet will be a foundation for a future generation of synthesis systems, providing for instance, tools for constructing graphical user-interfaces and comprehensive domain-specific information. Formal methods for synthesis should be like mathematical theorems in the sense that they state the assumptions which yield correctness, completeness or efficiency, and once methods have been deployed, they are re-usable, can be seamlessly combined with various tools and never have to be recoded manually.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Brogi, S. C. and Turini, F. (1998). The use of renaming in composing general programs.
ACM (1996). Proc. International Workshop on Multiple Perspectives in Software Development (View-points’96), San Francisco, ACM Symposium on Foundations of Software Engineering.
Bibel, W. (1980). Syntax-directed, semantics supported program synthesis. Artificial Intelligence, 14: 243–261.
Bundy, A. (1988). The use of explicit plans to guide inductive proofs. In Lusk, E. and Overbeek, R., editors, Proc. 9th International Conference on Automated Deduction, pages 111–120.
Lecture Notes in Computer Science 310, Springer. Calmet, J., Jekutsch, S., Kulhnann, P., and Schü, J.. (1997). Komet - a system for the integration of
heterogenous information sources. In Proc. ISMIS’97,pages 318–327. Springer Verlag.
Cicekli, I. (1989). Design and implementation of an abstract metaprolog engine for metaprolog. In Abramson, H. and Rogers, M., editors, Meta-Programming in Logic Programming, pages 417–434.
MIT Press. de Bosschere, K. and Tarau, P. (1996). Blackboard-based extensions in Prolog. Software–Practice and Experience, 26 (1): 49–69.
Eusterbrock, J. (1992a). Errata to “Selecting the top three elements” by M. Aigner: A Result of a computer assisted proof search. Discrete Applied Mathematics, 41: 131–137.
Eusterbrock, J. (1992b). Wissensbasierte Verfahren zur Synthese mathematischer Beweise: Eine kombinatorische Anwendung,volume 10 of DISK!. INFIX.
Eusterbrock, J. (1996). A multi-layer architecture for knowledge-based system synthesis. In Proc. ISMIS,pages 582–592. Springer Verlag.
Eusterbrock, J. (1997). Canonical term representations of isomorphic transitive DAGs for efficient knowledge-based reasoning. In Proceedings of the International KRUSE Symposium, Knowledge Retrieval, Use and Storage for Efficiency, pages 235–249.
Eusterbrock, J. and Nicolaides, M. (1996). The visualization of constructive proofs by compositional graph layout: A world-wide web interface. Proc. CADE Visual Reasoning Workshop, Rutgers University. Fernandez, M. and Suciu, D. (1998). Optimizing regular path expressions using graph schemas. In Proc. Int’l Conference on Data Engineering 1998,page to appear.
Flener, P., Lau, K., and Ornaghi, M. (1998). On correct program schemas. In Fuchs, N., editor, Proc. LOPSTR’97,pages 124–143. Lecture Notes in Computer Science.
Fugetta, A. (1993). A classification of case technology. COMPUTER, pages 25–38.
Garlan, D. (1995). Research directions in software architecture. ACM Computing Surveys, 27 (2): 257–260.
Goh, C. H., Madnick, S. E., and Siegel, M. D. (1995). Ontologies, contexts, and mediation: Representing and reasoning about semantic conflicts in heterogeneous and autonomous systems. Technical report, Sloan School of Management Working Paper 3848.
Gray, P. and et al (1997). KRAFT: Knowledge fusion from distributed databases and knowledge bases. In Wagner, R., editor, Proc. Int’l Workshop on Databases and Expert Systems (DEXA’97),pages 682.-691. IEEE Press.
Green, C. (1981). Application of theorem proving to problem solving. In Webber, B. L., editor, Readings in Artificial Intelligence,pages 202–222. Tioga Publishing Company.
Guha, R. and Lenat, D. (1994). Enabling agents to work together. Communciations of the ACM, 37(7):-. Heissel, M., Santen, T., and Zimmermann, D. ( 1995 ). A generic system architecture for strategy-based software development. Technical report, Technische Universität Berlin.
ISO/IEC 10746–4 (1995). Information Technology - Open Distributed Processing - Reference Model - Open Distributed Processing. Part 4: Architectural Semantics.
Kreitz, C. (1993). Metasynthesis - deriving programs that develop programs. Habilitationsschrift, Technische Hochschule Darmstadt, 1992.
Lowry, M. and Van Baalen, J. (1997). Meta-Amphion: Synthesis of efficient domain-specific program synthesis systems. Automated Software Engineering, 4 (2): 199–242.
Maluf, D. and Wiederhold, G. (1997). Abstraction of representation of interoperation. In Proc. ISMIS’97,pages 441–455. Springer Verlag.
Marlin, C. (1996). Multiple views based on unparsing canonical representations - the multiview architecture. In Proc. International Workshop on Multiple Perspectives in Software Development (Viewpoints’96),pages 217–221. Association for Computing Machinery.
McCarthy, J. and Buvac, S. (1998). Formalizing context (expanded notes). http://www-formal.standford.edu/jmc/mccarthy-buvac-98/index.html.
McDermott, J. (1982). R1: A rule based configurer of computer systems. Artificial Intelligence, 19: 29–88.
Novak, G. (1994). Composing reusable software components through views. In Knowledge-Based Software Engineering Conference, pages 39–47.
Nuseibeh, B., Kramer, J., and Finkelstein, A. (1994). A framework for expressing the relationships between multiple views in requirements specification. IEEE Transactions on Software Engineering,20(10):760772.
Schwartz, D. (1995). Cooperating Heterogenous Systems. Kluwer Academic Publishers. Smith, D. (1985). Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence, 27: 43–96.
Smith, D. (1993). Constructing specification morphisms. Journal Symbolic Computation, 15:571–606. Sowa, John, F. (1984). Conceptual Structures, Information Processing in Mind and Machine. Addison Wesley.
Srinivas, Y. and Jüllig, R. (1995). SPECWARE (TM): Formal support for composing software. In Proceedings of the International Conference on the Mathematics of Program Construction. Pitman Publ. van Harmelen, F. and Balder, J. (1992). (ML)2: A formal language for KADS models. In Proc. of the 10th
European Conference on Artificial Intelligence,pages 582–586. John Wiley & Sons.
Wiederhold, G. (1992). Mediators in the architecture of future information systems. IEEE Computer, pages 38–49.
Wiederhold, G., Rathmann, P. Barsalou, T., Lee, B., and Quass, D. (1990). Partitioning and composing knowledge. Information Systems, 15 (1): 61–72.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Eusterbrock, J. (2000). Composing Re-Usable Synthesis Methods through Graph-Based Viewpoints. In: Hölldobler, S. (eds) Intellectics and Computational Logic. Applied Logic Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9383-0_9
Download citation
DOI: https://doi.org/10.1007/978-94-015-9383-0_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5438-8
Online ISBN: 978-94-015-9383-0
eBook Packages: Springer Book Archive