{"title":"An environment for understanding programs","authors":"L. Cleveland","doi":"10.1109/HICSS.1988.11843","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11843","url":null,"abstract":"The time-consuming task of understanding the program to be maintained is particularly difficult when the code to be understood was not constructed using modern software-engineering techniques or modern programming languages. In such cases, it is difficult for the programmer to navigate through the name, control-flow, and data-flow spaces of the program to try to achieve a sense of function. A system is described that attempts to alleviate many of these problems by capturing, in a database, the name, control-flow, and data-flow relationships defined by an assembler program and providing a viewing environment, context-sensitive program. In the systems' environment, context-sensitive functions are provided to allow navigation of the name, control-flow, and data-flow spaces of the program, so the programmer is free to concentrate on the understanding task.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"221 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":"116424689","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 design of a flexible distributed testbed for communication systems","authors":"W. Thoet, J. Hauser, D. Baker","doi":"10.1109/HICSS.1988.11878","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11878","url":null,"abstract":"The structure and design of a simulation testbed for communication systems are described. The testbed, which is called the Distributed Simulation and Prototyping Testbed (DSPT), models the physical-layer activities of communication networks with a design that facilitates the addition of higher-layer protocols either as part of the simulation program itself or as prototype software that can execute concurrently with the simulation on a separate machine. As is typical of R&D systems, the DSPT requirements have evolved with the projects that it supports. The author shows some of the benefits of developing software using the object-oriented methodology in the dynamic R&D environment. The design involves extensions to the Simula programming language, which are easily implemented using Simula's class inheritance capability. The author explores these extensions and discusses further needs of the Simula language that appeared during the implementation of DPST.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"2 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":"128961673","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 distributed Prolog system with AND-parallelism","authors":"M. Carlton, P. Van Roy","doi":"10.1109/HICSS.1988.11800","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11800","url":null,"abstract":"A description is given of the design and implementation of a distributed version of a Prolog interpreter running on a network of Sun workstations. The system easily takes advantage of AND-parallelism using fork and join primitives implemented by message passing. The design decisions and tradeoffs are explained in detail. The design is simple and yet powerful enough to achieve practical speedups on large existing Prolog programs. It is proved that deadlock is not possible provided a weak condition is met. The principles of programming using the new primitives are explained with simple examples. It is concluded that implementing AND-parallelism can give a significant performance gain despite the message overhead, and that the design complexity is less than that needed to incorporate other types of parallelism in Prolog.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"11 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":"123956858","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":"Attribute grammar based programming and its environment","authors":"Y. Shinoda, T. Katayama","doi":"10.1109/HICSS.1988.11859","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11859","url":null,"abstract":"The authors describe a programming paradigm they call attribute-grammar-based programming, its realization language AG, and the programming environment for AG, called SAGE (Support for AG Environment). AG is designed so that it can be used as a general-purpose programming language, as well as for the kernel language of various software production systems based on attribute grammars. AG is strongly typed; programs in AG are composed from data types and module definitions. The subsystems of SAGE, namely, the editor, the interpreter, the debugger, the compiler, the verifier, system browser, and other miscellaneous support modules are described, and the interactions among them are examined.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"29 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":"126381459","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":"Specifying Ada tasking using patterns of behavior","authors":"S. Meldal, D. Luckham, M. A. Haberler","doi":"10.1109/HICSS.1988.11798","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11798","url":null,"abstract":"TLS-1 is a language for specifying sequences of tasking events occurring in the execution of concurrent Ada programs. Such specifications are intended primarily for testing and debugging of Ada tasking programs. They can also be applied in the design of programs. TSL-1 specifications are included in Ada programs as formal comments. They express constraints to be satisfied by the sequences of actual tasking events. An overview is presented of TSL-1 as an annotation and specification language. The features of the language are described informally, using the alternating-bit protocol as an example. The main goal is to show how to express the patterns of desirable and undesirable behavior as well as the circumstances under which the patterns must or must not happen.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"5 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":"132773716","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":"Shadow: a system for capturing software design information in a browsable form","authors":"P. Carando","doi":"10.1109/HICSS.1988.11790","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11790","url":null,"abstract":"A description is given of Shadow, a tool for obtaining, recording, and graphically presenting system design information for systems that are developed incrementally. Shadow addresses the task of aiding a programmer's understanding of complex systems for the purpose of performing system enhancements. The central concept of Shadow is that system models integrated with system development tools can be used to capture design information. This information would otherwise be lost in a conventional development environment. Captured information can be used to facilitate system understanding because it can be browsed and because it can be applied by Shadow itself to aid continued system evolution.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"132 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":"123048156","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":"Entity-relationship logical design of database systems: relational normal forms and extended regular ERDs","authors":"F. Springsteel","doi":"10.1109/HICSS.1988.11854","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11854","url":null,"abstract":"The design of the logical structure of databases using the entity-relationship (E-R) model is considered. The goal is to focus on E-R conditions for desirable logical design, using an extended translation of the full E-R model into the more easily implementable relational database model; all entity sets in a regular E-R diagram will map to relation schemes that are in the very desirable Boyce-Codd normal form (BCNF). Conditions under which extended E-R relationship sets translate to BCNF schemes are found. These results extend to both types of weak entity sets, subset and dependent entity sets, and contribute to the logical design of robust database systems. An E-R-diagram-based design system currently under development enforces the conditions that ensure BCNF by ensuring extended regularity and other measures of well-behaved E-R models.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"72 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":"123160971","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":"Shared memory multiprocessors and sequential programming languages: a case study","authors":"L. Crowl","doi":"10.1109/HICSS.1988.11795","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11795","url":null,"abstract":"The Chrysalis operating system for the BBN Butterfly parallel processor provides a flexible, object-oriented, shared-memory environment for parallel programming. C++ is a safe, sequential, object-oriented programming language. The pairing of these environments is seen potentially as a natural fit. The development of Chrysalis++, and interface between C++ and Chrysalis, indicates that subtle assumptions within each system lead to surprising inconsistencies. Any combination of sequential programming language and shared-memory multiprocessor operating system is likely to be plagued by these inconsistencies because they center around differing assumptions on the nature of the computational environment. The author describes some of the inconsistencies that arose during the development of Chrysalis++ and suggests possible solutions.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"2 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":"129251006","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":"Developing multitasking applications programs","authors":"B. Appelbe, C. McDowell","doi":"10.1109/HICSS.1988.11793","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11793","url":null,"abstract":"The current state-of-the-art tools for developing numerical/scientific multitasking applications programs are examined. An integrated toolkit is proposed that is necessary before reliable multitasking applications can be effectively developed. A prototype of the proposed toolkit is being developed on the basis of a static-analysis tool that has been developed by the authors.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"86 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114122835","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":"OOPs: an environment for implementing protocols","authors":"S. Hickman, R. Dunning","doi":"10.1109/HICSS.1988.11838","DOIUrl":"https://doi.org/10.1109/HICSS.1988.11838","url":null,"abstract":"A flavor-based object-oriented programming system (OOPs) has been used to implement the Open Systems Interconnection (OSI) Transport Protocol Class 1 (basic error recovery). Experiences with this approach, including simulations of the class 1 protocol, are reported. The methodology used to implement protocols using object-oriented programming is presented.<<ETX>>","PeriodicalId":148246,"journal":{"name":"[1988] Proceedings of the Twenty-First Annual Hawaii International Conference on System Sciences. Volume II: Software track","volume":"14 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":"128597823","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}