{"title":"A recoverable object store","authors":"Rob Strom, S. Yemini, David F. Bacon","doi":"10.1109/HICSS.1988.11808","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11808","url":null,"abstract":"A design is presented for the storage component of a self-recovering distributed operating system. This component consists of an object manager, which maintains objects on main memory and on the disk, and a recovery layer, which incorporates a collection of highly optimized algorithms based on optimistic recovery. With optimistic recovery it is possible for a machine (or collection of machines) to present a fault-free interface to programs running on it (or them), making all data appear to be persistent. The optimizations presented make it possible to do this at a cost no higher than that of transaction systems.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126541262","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":"High-level debugging with the aid of an incremental optimizer","authors":"L. Pollock, M. Soffa","doi":"10.1109/HICSS.1988.11846","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11846","url":null,"abstract":"The design of a high-level debugger that tailors optimizations to conform to desired debugging capabilities is presented. In this scheme, debugging requests are specified before program execution and viewed as changes that inhibit optimizations in ways similar to program edits invalidating optimizations. Debugging requests are honored by detecting and temporarily disabling those optimizations that prohibit correct debugging response. An intermediate program representation keeps a history of all optimizations possible prior to debugging. Any modifications to debugging requests are incrementally incorporated into this representation which is then used to generate optimized code tailored to the new desired debugging capabilities. When debugging requests have little effect on optimizations, code closely related to the final optimized code is debugged. Execution time and debugging accuracy are always comparable to debugging unoptimized code as no additional analysis or optimization history is needed at run time.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130126912","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":"Rapid prototyping of knowledge-based systems: knowledge acquisition using Aquinas","authors":"J. Boose, J. Bradshaw","doi":"10.1109/HICSS.1988.11839","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11839","url":null,"abstract":"The process of acquiring and modeling expertise involves cycles of revision and review that can take from six to twenty-four months. A description is given of Aquinas, an automated knowledge-acquisition tool that has been developed to help cut down the revise-and-review cycle time. The Aquinas system and applications are examined. The advantages of using Aquinas for rapid prototyping are discussed. Other knowledge-acquisition tools that can be used for rapid prototyping are mentioned.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121650635","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":"Improved optimistic concurrency control and its use in distributed database systems","authors":"R. Unland, G. Schlageter","doi":"10.1109/HICSS.1988.11850","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11850","url":null,"abstract":"The original optimistic concurrency control scheme (H.T. Kung, and J.T. Robinson, 1979) has weaknesses with respect to the validation technique, the treatment of long transactions, and the problem of starvation. Some alternatives for the validation-phase are considered that not only avoid these disadvantages but also improve the performance of the original approach. Most promising is a technique which supports read-transactions, thereby decreasing the number of backups substantially. An adaptation of a centralized optimistic concurrency control scheme to a distributed environment is presented. The proposed algorithm is deadlock-free and offers high parallelism.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127619159","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":"Prototyping user interfaces for applications depicted by graphs","authors":"M. Beaudouin-Lafon, S. Karsenty","doi":"10.1109/HICSS.1988.11835","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11835","url":null,"abstract":"A tool for constructing graphical interfaces for several kinds of applications is described. The tool, called Graffiti, maintains the display of a graph representing the data of the application. The graph can be manipulated directly by the user, Such actions are linked to application operations. This tool has two components: one to describe the layout and syntactic constraints on the graph, the other to describe the layout of the user interface and the interactive dialogue with the end user. It can be used to construct or prototype such diverse pieces of software as state diagram editors, Petri nets development utilities, network simulation systems, tools for software engineering based on dataflow diagrams, etc.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128444881","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":"Software construction method with Extended Modula-2 language environment","authors":"T. Yamaoka, N. Saito","doi":"10.1109/HICSS.1988.11815","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11815","url":null,"abstract":"The authors assume that the description of a software construction process is analogous to constructing software itself and propose a model for describing the process and its execution environment. The description is based on a modular concept, and its execution unit is called the Extended Modula-2 language environment. a software construction method using the language environment is discussed.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114744992","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":"Dynamic data flow analysis of C programs","authors":"F.W. Caliss, B. Cornelius","doi":"10.1109/HICSS.1988.11845","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11845","url":null,"abstract":"A description of a dynamic data-flow analysis method for C programs is given. The method extends the work of J.C. Huang (IEEE Trans. Softw. Eng., vol.SE-5, no.3, p.226, 236, 1979) to array elements, struct variables, pointers, and dynamic variables. A different approach is used for the analysis of subroutines. For most kinds of variables, a full set of operations is permitted, and for pointer variables, pointer arithmetic, and pointer-array notation interchanging is allowed. The method can be used as the basis for a tool for detecting anomalies in C programs.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127470116","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 visual programming language designed for automatic programming","authors":"N. C. Shu","doi":"10.1109/HICSS.1988.11865","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11865","url":null,"abstract":"Four visual programming languages are discussed as examples of the efforts directed at four different areas of interest: command language, algorithmic language, graphical extension, and automatic programming. A new style of programming that captures not only the spirit of visual programming languages, but also the benefits of automating many data processing applications, is discussed.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124901323","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":"Combining logic- and object-oriented programming language paradigms","authors":"L. Leonardi, P. Mello","doi":"10.1109/HICSS.1988.11828","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11828","url":null,"abstract":"The usefulness and synergetic advantages of combining logic- and object-oriented programming in a declarative framework are explored. Rather than present another specific combination of logic and object programming, the authors discuss different kind of extensions.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"1156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121540444","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 Control structure Diagram: an automated graphical representation for software","authors":"J. Cross, S. Sheppard","doi":"10.1109/HICSS.1988.11836","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11836","url":null,"abstract":"A description is given of the Control Structure Diagram (CSD), a graphical stepwise refinement tool for use in the development and maintenance of software. The CSD can be used as a natural extension to popular high-level representations such as data-flow diagrams and structure charts. It includes graphical constructs for refinement, sequence, concurrency, selection, iteration, and exit, which are clearly distinguishable, have meaningful connotations, and provide for a high degree of connectivity in the CSD. The CSD is easy to use manually since it can be virtually superimposed on structured pseudocode or source code. A fully operational prototype CSD editor was designed and implemented to provide extensive automated support for the CSD, thus making it especially suitable for use in rapid prototyping environments.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131832913","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}