Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48066
S. Mannucci, B. Mojana, V. Romano, M. C. Terzi
The innovative graphic features of the kernel of the integrated software development environment GRASPIN are discussed. GRASPIN extends to the graphic languages used in the early stages of software life cycle the benefits of the software development environment approach, in that it provides a graphlike internal representation of software documents and automatic layout tools. Standard techniques based on the abstract syntax tree are extended with links and attributes, which decorate internal representations, to describe the context-sensitive aspects of graphic languages. The consistency of graphic documents is maintained through the kernel syntactic primitives to provide context-free checks, while action routines are introduced to perform semantic and context-sensitive checks. The automatic layout produces aesthetic and pleasing layouts of documents.<>
{"title":"The kernel of a software development environment for graphic languages","authors":"S. Mannucci, B. Mojana, V. Romano, M. C. Terzi","doi":"10.1109/HICSS.1989.48066","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48066","url":null,"abstract":"The innovative graphic features of the kernel of the integrated software development environment GRASPIN are discussed. GRASPIN extends to the graphic languages used in the early stages of software life cycle the benefits of the software development environment approach, in that it provides a graphlike internal representation of software documents and automatic layout tools. Standard techniques based on the abstract syntax tree are extended with links and attributes, which decorate internal representations, to describe the context-sensitive aspects of graphic languages. The consistency of graphic documents is maintained through the kernel syntactic primitives to provide context-free checks, while action routines are introduced to perform semantic and context-sensitive checks. The automatic layout produces aesthetic and pleasing layouts of documents.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132701417","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.47992
A. Finkelstein, H. Fuks
A formal framework for understanding the software development process is proposed, and software development as cooperative work is considered. The requirements for a framework are reviewed and set in the context of an established development paradigm. An underlying model of cooperative based on dialog is motivated and outlined. A formal scheme for expressing this model is introduced, and the basis constructs are described. Examples of the application of the framework taken from a small specification case study are provided. A tool to investigate software development in this style is presented. Software development strategies and methods are discussed. Future research directions are briefly presented.<>
{"title":"A cooperative framework for software engineering","authors":"A. Finkelstein, H. Fuks","doi":"10.1109/HICSS.1989.47992","DOIUrl":"https://doi.org/10.1109/HICSS.1989.47992","url":null,"abstract":"A formal framework for understanding the software development process is proposed, and software development as cooperative work is considered. The requirements for a framework are reviewed and set in the context of an established development paradigm. An underlying model of cooperative based on dialog is motivated and outlined. A formal scheme for expressing this model is introduced, and the basis constructs are described. Examples of the application of the framework taken from a small specification case study are provided. A tool to investigate software development in this style is presented. Software development strategies and methods are discussed. Future research directions are briefly presented.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133732171","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48095
S. Yang, T. Lewis, C. Hsieh
Oregon Speedcode Universe (OSU) is a software development environment for design, implementation, and maintenance of large software systems. Designed to be highly visual, OSU combines traditional structured-analysis techniques found in most computer-aided software engineering tools with the advanced graphical user-interface management systems found on most contemporary workstations. The design and implementation of four minute features of OSU are described: (1) the combination of functional decomposition with object-oriented design; (2) alternate architectural views, e.g. call graph, uses graph, object graph, and graphical display of procedures; (3) program understanding tools for design and maintenance; and (4) merging the user-interface specification with design and coding specifications.<>
{"title":"Integrating computer-aided software engineering and user interface management systems","authors":"S. Yang, T. Lewis, C. Hsieh","doi":"10.1109/HICSS.1989.48095","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48095","url":null,"abstract":"Oregon Speedcode Universe (OSU) is a software development environment for design, implementation, and maintenance of large software systems. Designed to be highly visual, OSU combines traditional structured-analysis techniques found in most computer-aided software engineering tools with the advanced graphical user-interface management systems found on most contemporary workstations. The design and implementation of four minute features of OSU are described: (1) the combination of functional decomposition with object-oriented design; (2) alternate architectural views, e.g. call graph, uses graph, object graph, and graphical display of procedures; (3) program understanding tools for design and maintenance; and (4) merging the user-interface specification with design and coding specifications.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134283189","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48080
J.R. Weisbecker
The Concurr language for parallel systems is designed as an easy-to-use parallel programming facility. It provides constructs for expressing parallelism explicitly as well as constructs from which parallelism can be extracted implicitly by the compiler. Thus is offers a framework to evaluate the potential of the explicit and implicit approaches to parallelism within the same programming language. The language also attempts to overcome some restrictions of previous, sequential languages. Concurr can be used to prepare code for either multiprocessor parallel (MIMD) or data parallel (SIMD) architectures.<>
{"title":"Concurr-a problem solving language for parallel systems","authors":"J.R. Weisbecker","doi":"10.1109/HICSS.1989.48080","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48080","url":null,"abstract":"The Concurr language for parallel systems is designed as an easy-to-use parallel programming facility. It provides constructs for expressing parallelism explicitly as well as constructs from which parallelism can be extracted implicitly by the compiler. Thus is offers a framework to evaluate the potential of the explicit and implicit approaches to parallelism within the same programming language. The language also attempts to overcome some restrictions of previous, sequential languages. Concurr can be used to prepare code for either multiprocessor parallel (MIMD) or data parallel (SIMD) architectures.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115909839","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48074
J.-Y. Chung, J.W.-S. Liu
The authors describe and evaluate a class of heuristic algorithms, called length-monotone algorithms, for scheduling periodic jobs on systems that support imprecise computations. The algorithms are designed to keep the cumulative error in the results produced over a number of consecutive periods below a threshold. The approach taken is to consider each task as consisting of a mandatory part followed by an optional part. The mandatory part must be completed before the deadline of the task for the task to produce an acceptable result. The optional part must be completed occasionally to keep the cumulative error from exceeding an upper limit. The rate-monotone algorithm is used to schedule the mandatory parts to meet all deadlines. Different algorithms are used to schedule the optional parts. The performance of these algorithms is evaluated, and the schedulability criteria for jobs with the same repetition period and simply periodic jobs are discussed.<>
{"title":"Performance of algorithms for scheduling periodic jobs to avoid timing faults","authors":"J.-Y. Chung, J.W.-S. Liu","doi":"10.1109/HICSS.1989.48074","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48074","url":null,"abstract":"The authors describe and evaluate a class of heuristic algorithms, called length-monotone algorithms, for scheduling periodic jobs on systems that support imprecise computations. The algorithms are designed to keep the cumulative error in the results produced over a number of consecutive periods below a threshold. The approach taken is to consider each task as consisting of a mandatory part followed by an optional part. The mandatory part must be completed before the deadline of the task for the task to produce an acceptable result. The optional part must be completed occasionally to keep the cumulative error from exceeding an upper limit. The rate-monotone algorithm is used to schedule the mandatory parts to meet all deadlines. Different algorithms are used to schedule the optional parts. The performance of these algorithms is evaluated, and the schedulability criteria for jobs with the same repetition period and simply periodic jobs are discussed.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133247522","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.47987
H. Hausen, H. Neusser
Method and tool selection are defined by a method rule system and a tool rule system. The former defines the order in which methods might be applied to perform a specific software-engineering task. Tools supporting the methods are managed by the tool system. A set of interrelation rules defines the transformation of a methodological refined task into a set of appropriate tools of a selected environment. Parameters and weights are used in both rule systems to distinguish alternative or complementary rules and to define preference for a selection process. Three methods of knowledge acquisition are examined: analysis of handbooks, usage protocols, and expert meeting reports.<>
{"title":"Knowledge-based method and tool handling","authors":"H. Hausen, H. Neusser","doi":"10.1109/HICSS.1989.47987","DOIUrl":"https://doi.org/10.1109/HICSS.1989.47987","url":null,"abstract":"Method and tool selection are defined by a method rule system and a tool rule system. The former defines the order in which methods might be applied to perform a specific software-engineering task. Tools supporting the methods are managed by the tool system. A set of interrelation rules defines the transformation of a methodological refined task into a set of appropriate tools of a selected environment. Parameters and weights are used in both rule systems to distinguish alternative or complementary rules and to define preference for a selection process. Three methods of knowledge acquisition are examined: analysis of handbooks, usage protocols, and expert meeting reports.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132572213","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48089
K. Rao, A. Gafni, G. Raeder
Dynamo is an object-oriented information model that underlies the Dynamo system, a general-purpose system for information management in a shared, distributed environment. The aim of the Dynamo system is to serve as a software platform for supporting a broad range of multimedia information processing activities than can be undertaken on a technical workstation. The Dynamo model synthesizes concepts from object-oriented programming languages and databases, hypermedia, CAD, (computer-aided design), and simulation. The core of the model consists of a very simple notion of active objects of which virtual time is an integral element. Objects are defined incrementally using cloning and delegation, and realize hypertextlike nodes and links with more expressive power than the usual passive links of hypertext. Virtual time provides the basis for a uniform approach to synchronization, versioning, and configuration control.<>
{"title":"Dynamo: a model for a distributed multi-media information processing environment","authors":"K. Rao, A. Gafni, G. Raeder","doi":"10.1109/HICSS.1989.48089","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48089","url":null,"abstract":"Dynamo is an object-oriented information model that underlies the Dynamo system, a general-purpose system for information management in a shared, distributed environment. The aim of the Dynamo system is to serve as a software platform for supporting a broad range of multimedia information processing activities than can be undertaken on a technical workstation. The Dynamo model synthesizes concepts from object-oriented programming languages and databases, hypermedia, CAD, (computer-aided design), and simulation. The core of the model consists of a very simple notion of active objects of which virtual time is an integral element. Objects are defined incrementally using cloning and delegation, and realize hypertextlike nodes and links with more expressive power than the usual passive links of hypertext. Virtual time provides the basis for a uniform approach to synchronization, versioning, and configuration control.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116200312","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48079
A. Hey, D. Pritchard, C. Whitby-Strevens
A method is described for designing secure and highly efficient parallel programs that can be written simply and straightforwardly for a wide range of applications. The method is based on the Occam programming language and a set of paradigms, or program structures, which can be used individually or in combination. The concurrent behavior of the paradigms is readily understood, and the effective performance and scalability on transputer networks is easily assessed. The paradigms admit the use of languages such as Fortran and C for programming sequential computation components. The discipline imposed by the use of paradigms avoids problems such as deadlock and makes load by balancing tractable, avoiding the overheads of a resource management operating system. Examples, developed under the ESPRIT Supermode Project, demonstrate how a relatively low-cost system can deliver sustained gigaflop-level performance.<>
{"title":"Multi-paradigm parallel programming","authors":"A. Hey, D. Pritchard, C. Whitby-Strevens","doi":"10.1109/HICSS.1989.48079","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48079","url":null,"abstract":"A method is described for designing secure and highly efficient parallel programs that can be written simply and straightforwardly for a wide range of applications. The method is based on the Occam programming language and a set of paradigms, or program structures, which can be used individually or in combination. The concurrent behavior of the paradigms is readily understood, and the effective performance and scalability on transputer networks is easily assessed. The paradigms admit the use of languages such as Fortran and C for programming sequential computation components. The discipline imposed by the use of paradigms avoids problems such as deadlock and makes load by balancing tractable, avoiding the overheads of a resource management operating system. Examples, developed under the ESPRIT Supermode Project, demonstrate how a relatively low-cost system can deliver sustained gigaflop-level performance.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127919926","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48037
L. Mark, H. D. Rombach
The authors describe research carried out to: (i) develop a software process and product specification language that allows all the information necessary to understand, control, and improve any given software engineering process; (ii) develop a meta-information-base schema that automatically generates an information-base structure given a software process and product specification; and (iii) develop a mapping between the software-engineering-oriented and information-base-oriented models. Their generator approach addresses the fact that software engineering changes not only from environment to environment, but also from project to project.<>
{"title":"Generating customized software engineering information bases from software process and product specifications","authors":"L. Mark, H. D. Rombach","doi":"10.1109/HICSS.1989.48037","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48037","url":null,"abstract":"The authors describe research carried out to: (i) develop a software process and product specification language that allows all the information necessary to understand, control, and improve any given software engineering process; (ii) develop a meta-information-base schema that automatically generates an information-base structure given a software process and product specification; and (iii) develop a mapping between the software-engineering-oriented and information-base-oriented models. Their generator approach addresses the fact that software engineering changes not only from environment to environment, but also from project to project.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128526273","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}
Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48025
M. Crosby, J. Stelovsky
Two empirical studies of the interaction between presentation medium and users' experience are reported. Subjects were presented with sets of algorithms that either showed their textual definition or demonstrated their behavior using graphics as an alternative presentation medium. Results of the first experiment showed an interaction between experience, presentation medium, and the algorithm itself. In particular, the presentation order plays a significant role. Textural presentations prior to graphical ones seem to provide the necessary framework for later assimilation of detailed information. A wide range of scan patterns was found. The findings suggest that textual and graphical presentation media differ in the way they facilitate understanding of algorithms. Furthermore, the great variety of viewing styles could be categorized according to the user's programming experience.<>
{"title":"The influence of user experience and presentation medium on strategies of viewing algorithms","authors":"M. Crosby, J. Stelovsky","doi":"10.1109/HICSS.1989.48025","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48025","url":null,"abstract":"Two empirical studies of the interaction between presentation medium and users' experience are reported. Subjects were presented with sets of algorithms that either showed their textual definition or demonstrated their behavior using graphics as an alternative presentation medium. Results of the first experiment showed an interaction between experience, presentation medium, and the algorithm itself. In particular, the presentation order plays a significant role. Textural presentations prior to graphical ones seem to provide the necessary framework for later assimilation of detailed information. A wide range of scan patterns was found. The findings suggest that textual and graphical presentation media differ in the way they facilitate understanding of algorithms. Furthermore, the great variety of viewing styles could be categorized according to the user's programming experience.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128811844","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：