{"title":"A framework to support an object-oriented view of existing engineering databases","authors":"R. Ahad","doi":"10.1145/62453.62489","DOIUrl":"https://doi.org/10.1145/62453.62489","url":null,"abstract":"This paper presents a framework for an Object Management System (OMS) to support an object-oriented view of an existing engineering database. OMS is intended to run on a workstation to access the engineering database on another machine (host). OMS has three components: a Data Model (DM) to define the objects and the relationships among the objects that exist in the host database, a Transformation Model (TM) to define the modeling concepts that are not directly supported in the DM, and a Mapping Facility/Optimizer (MF/O) to map the relationships to data stored in the host, and to build a host-executable program for each query the user issues. Mapping is done by host-executable procedures that encode the knowledge about the access to host-resident data. MF/O optimizes access to the host's database.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The impact of the LCC-optimization on the performance of a static scope LISP interpreter","authors":"R. Beckmann, Kay-Ulrich Felgentreu","doi":"10.1145/62453.62486","DOIUrl":"https://doi.org/10.1145/62453.62486","url":null,"abstract":"The Low Cost Call - Optimization was introduced as a general approach to the optimization of function calls in shallow binding implementations of applicative static scope languages. The basic idea of the LCC-optimization is to avoid saving obsolete environments for a large class of function calls, thus exceeding the usual optimization of tailrecursive and covered tailrecursive calls. This paper describes how the new technique has been applied in the implementation of a portable static scope LISP interpreter for microcomputers, called LCINT. In a benchmark test we measure the impact of the LCC-optimization on the performance of LCINT. The results show that this technique is particularly valuable for small systems with a rather limited storage. Whereas some of the results fully meet our expectations, others are rather surprising and lead us to certain conclusions for further research.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MUIR - a language development environment","authors":"K. Nørmark","doi":"10.1145/62453.62458","DOIUrl":"https://doi.org/10.1145/62453.62458","url":null,"abstract":"The concept of a language development environment is introduced and motivated. The key facilities and characteristics of such an environment is described, and a concrete system called Muir is studied. In a language development environment the language definition formalism is central. We introduce a context free grammar definition formalism that emphasizes the hierarchical classification of syntactic domains, and we argue that syntax-directed editing is useful especially when making experiments with new languages. Finally, we discuss how to keep documents consistent with a grammar that is under development.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124046879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A highly integrated tool set for program development support","authors":"G. Engels, T. Janning, Wilhelm Schäfer","doi":"10.1145/62453.62454","DOIUrl":"https://doi.org/10.1145/62453.62454","url":null,"abstract":"This paper describes the design of the integrated user interface of the software development environment IPSEN (Integrated Programming Support Environment). We explain the characteristic features of the IPSEN user interface, namely the structured layout of the screen, the command-driven tool activation, and especially the highly integrated use of the IPSEN tool set. We demonstrate those features by taking a sample set of tools of the IPSEN environment. That tool set supports all the programming-in-the-small activities within IPSEN. Finally, we sketch the realization of two prototypes running on an IBM-AT and a net of SUN workstations.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125489175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Increasing the efficiency of Prolog Lexical databases with N-gram Boolean cubes","authors":"R. Rankin","doi":"10.1145/62453.62488","DOIUrl":"https://doi.org/10.1145/62453.62488","url":null,"abstract":"PROLOG has been shown to be an effective tool for expressing the logic of many problems dealing with parsing, natural language processing, and spelling verification [1,7,8,9,12]. As a class, these problems deal with the manipulation of lexical databases as Horn clauses. Since PROLOG does not generally differentiate between program clauses and data clauses, the internal representation and manipulation of data may not be optimal for a particular application. This paper discusses an alternative method of representing and manipulating lexical databases through the use of N-gram analysis, prefiltering, and integration with another high level language.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Affect-chaining and dependency oriented flow analysis applied to queries of programs","authors":"Mariam Kamkar, N. Shahmehri, P. Fritzson","doi":"10.1145/62453.62462","DOIUrl":"https://doi.org/10.1145/62453.62462","url":null,"abstract":"Most of the work on static program flow analysis has been done in the context of code optimization. The situation is different for an application such as an interactive query tool for programmer support. Primarily this is because the information wanted is different from what is needed for optimization, but also because incremental flow analysis algorithms are much more relevant in this context.\u0000In this paper we introduce the concept of affect-chaining, which is the process of analysing flow of data between variables in a program. The objective is to help the user to better understand data flow and data dependencies in programs not only during design and coding but also during test, debugging and maintenance. We present both forward- and backward- versions of affect-chaining analysis together with efficient algorithms.\u0000A long term goal of the work presented in this paper is to combine results from static analysis of a program and information from the run-time state during execution of the same program. The idea is, that this combination will enable an interactive query tool to answer questions about possible reasons for unexpected program behavior, and also to inform about possible consequences of a program change which may be considered. Another goal is to develop better estimates of software complexity based on affect-chaining dependencies.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129547406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Patrick Martin, D. T. Barnard, I. Macleod, B. Nordin, R. Fleming
{"title":"Remote operation calls in a heterogeneous environment","authors":"Patrick Martin, D. T. Barnard, I. Macleod, B. Nordin, R. Fleming","doi":"10.1145/62453.62472","DOIUrl":"https://doi.org/10.1145/62453.62472","url":null,"abstract":"Remote Operation Calls (ROC's) are a mechanism for remote execution in a network of personal computers. This paper describes the implementation of a version of ROC's that function in a heterogeneous environment consisting of a network of personal computers and SUN/UNIX machines.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130905670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A model for the design of high performance protocols for a networked computing environment","authors":"G. Law","doi":"10.1145/62453.62471","DOIUrl":"https://doi.org/10.1145/62453.62471","url":null,"abstract":"The advent of high bandwidth local area networks means that it is now possible to interconnect large numbers of devices with widely differing processing capabilities in such a manner that the various devices may closely interact. Before such a system may be realised, it is necessary to define a set of conventions to govern the way in which the network nodes interact with each other.\u0000The Triadic Network Model is introduced to describe the interactions between personal computers and high performance computers over a general purpose network by using a third classification of devices, whose purpose is to support the operation of the network as a distributed system. The model is not restricted to any particular network or operating system, but may form the interface between the two. Hence, the use of a protocol set based on this model enables the provision of a uniform interface to the applications software. Some of the principles of a protocol set developed from the Triadic Network Model are presented in the paper.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"860 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124602085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Iconic shells for multitasking workstations","authors":"M. Beaudouin-Lafon, S. Karsenty","doi":"10.1145/62453.62492","DOIUrl":"https://doi.org/10.1145/62453.62492","url":null,"abstract":"Today's workstations running a multitasking operating system provide high level graphics toward user friendly interfaces. Microcomputers, on their side, implement graphic interfaces on monotasking operating systems. There are two differences between these machines: the operating system and the user interface to this operating system (the shell). Workstations still use standard shells (textual commands) but through a sophisticated graphic environment as a window manager, while microcomputers have their own graphic shell running on monotasking operating system.\u0000In this paper we examine the features of both systems and then we present an iconic shell developed for Unix#8482;@@@@ workstations. This shell differs from existing shells because the interaction language is based on graphic manipulations, and is integrated in a multitasking environment.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122665225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Limiting a resolution set in a large Prolog database using special hardware","authors":"Kam-Fai Wong, M. H. Williams","doi":"10.1145/62453.62484","DOIUrl":"https://doi.org/10.1145/62453.62484","url":null,"abstract":"There is a growing interest in the application of Prolog and related languages like Parlog to database implementation. Existing Prolog systems, however, are unable to cope with large sets of data of the size necessary for databases. A large Prolog database would consist of millions of clauses. The size of physical memory required to store the database has deemed main memory impractical in many computer systems. Therefore clauses are usually placed on secondary disc memory. Clause retrieval, however, becomes extremely slow. Furthermore, the enormous amount of time required for unification upon a large set of clauses has drastically degraded system performance. Either of these factors leads to non-timely database response which is irritating and in many cases, intolerable. To mediate these problems, a special hardware unit is proposed - the CLAuse Retrieval Engine (CLARE). The functions of the CLARE are to search discs storing database clauses on-the-fly and select potentially unifiable clauses. Two stages of filtering will be applied to the database clauses; thus a small resolution set will be guaranteed.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130827566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}