Pub Date : 1989-01-03DOI: 10.1109/HICSS.1989.48011
K. Heisler, W. Tsai, C. Ramamoorthy
The protospec unifies the concepts of requirements specification and prototype into a single software engineering process. An example of the use of the protospec concept for requirements specification within expert systems development domain is presented. The requirements specification resulting from this example is evaluated from both a user and a software engineering point of view. The result is compared to results for three other specification approaches.<>
{"title":"Integrating the role of requirements specification into the process of prototyping: the protospec","authors":"K. Heisler, W. Tsai, C. Ramamoorthy","doi":"10.1109/HICSS.1989.48011","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48011","url":null,"abstract":"The protospec unifies the concepts of requirements specification and prototype into a single software engineering process. An example of the use of the protospec concept for requirements specification within expert systems development domain is presented. The requirements specification resulting from this example is evaluated from both a user and a software engineering point of view. The result is compared to results for three other specification approaches.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"17 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":"115007376","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.48102
R. Wallace, S. Zhou
Presents a measurement study of a 10-Mb/s Ethernet network that supports about 100 hosts. Over 15-min intervals the authors observed up to 50% network utilization the bulk of which was due to remote paging and process swapping. The sizes of packets roughly follow a bimodal distribution. It is concluded that faster local networks will soon be necessary for moderate-size systems. The measurement data presented should be useful in the design and management of distributed systems.<>
{"title":"Network performance in a workstation environment","authors":"R. Wallace, S. Zhou","doi":"10.1109/HICSS.1989.48102","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48102","url":null,"abstract":"Presents a measurement study of a 10-Mb/s Ethernet network that supports about 100 hosts. Over 15-min intervals the authors observed up to 50% network utilization the bulk of which was due to remote paging and process swapping. The sizes of packets roughly follow a bimodal distribution. It is concluded that faster local networks will soon be necessary for moderate-size systems. The measurement data presented should be useful in the design and management of distributed systems.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"29 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":"116668835","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.48035
J. Barnett, D. Batory
Two seemingly distinct features of next-generation database management systems (DBMSs): long fields and nested relations. A long field contains an uninterpreted sequence of bytes of potentially enormous length. A nested relation is a relation that has relation-valued attributes; the nesting of relations can be arbitrarily deep. By elevating the semantics of long fields from a sequence of bytes to a sequence of instances of a (potentially complex) data type, the mechanisms for storing and retrieving nested relations and long fields are equated. An implementation of these ideas in the context of the GENESIS extensible DBMS is described.<>
{"title":"A uniform mechanism to support long fields and nested relations in database management systems","authors":"J. Barnett, D. Batory","doi":"10.1109/HICSS.1989.48035","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48035","url":null,"abstract":"Two seemingly distinct features of next-generation database management systems (DBMSs): long fields and nested relations. A long field contains an uninterpreted sequence of bytes of potentially enormous length. A nested relation is a relation that has relation-valued attributes; the nesting of relations can be arbitrarily deep. By elevating the semantics of long fields from a sequence of bytes to a sequence of instances of a (potentially complex) data type, the mechanisms for storing and retrieving nested relations and long fields are equated. An implementation of these ideas in the context of the GENESIS extensible DBMS is described.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"74 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":"125919399","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.48059
R. Cooper
The use of persistent programming languages to construct tools for maintaining the complex modular structure of large-scale application programs transforms the problem into a database maintenance problem. The application construction environment can be considered to be a database of software libraries, and standard database techniques can be used to handle the modules. The persistent language PS-Algol provides a good basis for manipulating such libraries, as it has the appropriate graphics facilities, first-class procedures, delayed binding, delayed type-checking, strong type-checking and a compiler callable at run-time. It is shown how these features help by concentrating on two issues: module version management and the control over the binding together of two modules. Some simple facilities for managing a software database are outlined, and implementation techniques equally applicable to more sophisticated systems are described.<>
{"title":"Persistent languages facilitate the implementation of software version management","authors":"R. Cooper","doi":"10.1109/HICSS.1989.48059","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48059","url":null,"abstract":"The use of persistent programming languages to construct tools for maintaining the complex modular structure of large-scale application programs transforms the problem into a database maintenance problem. The application construction environment can be considered to be a database of software libraries, and standard database techniques can be used to handle the modules. The persistent language PS-Algol provides a good basis for manipulating such libraries, as it has the appropriate graphics facilities, first-class procedures, delayed binding, delayed type-checking, strong type-checking and a compiler callable at run-time. It is shown how these features help by concentrating on two issues: module version management and the control over the binding together of two modules. Some simple facilities for managing a software database are outlined, and implementation techniques equally applicable to more sophisticated systems are described.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"34 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":"126047607","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.47999
S. Meldal
Pointer ('reference' or 'access') types are extremely useful in programming, but are usually considered rather intractable in the context of formal verification. The author deals with this problem using the concept of collections and access types. He gives two examples of how this can be done. One approach, using the axiomatic method of J.V. Guttag and V. Horning (1978), is too specific, resulting in distinct semantics of program constructs that would be considered equivalent in most programming languages. The problem is addressed in a second axiomatization method, which reduces the expressiveness of the annotation language by reducing the number of operators on access values. A reinterpretation of the allocation operator in the programming language then gives the desired proof strength, but with a higher level of abstraction than in the standard formalization. Verification of a package defining a set type is given as an example.<>
{"title":"An abstract axiomatization of pointer types","authors":"S. Meldal","doi":"10.1109/HICSS.1989.47999","DOIUrl":"https://doi.org/10.1109/HICSS.1989.47999","url":null,"abstract":"Pointer ('reference' or 'access') types are extremely useful in programming, but are usually considered rather intractable in the context of formal verification. The author deals with this problem using the concept of collections and access types. He gives two examples of how this can be done. One approach, using the axiomatic method of J.V. Guttag and V. Horning (1978), is too specific, resulting in distinct semantics of program constructs that would be considered equivalent in most programming languages. The problem is addressed in a second axiomatization method, which reduces the expressiveness of the annotation language by reducing the number of operators on access values. A reinterpretation of the allocation operator in the programming language then gives the desired proof strength, but with a higher level of abstraction than in the standard formalization. Verification of a package defining a set type is given as an example.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"12 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":"123451040","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.48114
D. S. Guindi, W.B. Ligong, W. M. Mccracken, S. Rugaber
Discusses the impact of the verification and validation (V&V) of reusable components and how verification and validation complexity can increase with reusable components. It is suggested that with the increase in complexity of V&V comes an associated decrease in expected productivity associated with reuse. Techniques for detecting errors in traditional V&V are examined, and constraint-based analysis is used to support testing of V&V.<>
{"title":"The impact of verification and validation of reusable components on software productivity","authors":"D. S. Guindi, W.B. Ligong, W. M. Mccracken, S. Rugaber","doi":"10.1109/HICSS.1989.48114","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48114","url":null,"abstract":"Discusses the impact of the verification and validation (V&V) of reusable components and how verification and validation complexity can increase with reusable components. It is suggested that with the increase in complexity of V&V comes an associated decrease in expected productivity associated with reuse. Techniques for detecting errors in traditional V&V are examined, and constraint-based analysis is used to support testing of V&V.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"37 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114047053","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.48093
Y. Shibata, J. H. Irven
The end-to-end performance of a general multimedia information retrieval service, operating across a local area network (LAN) using the TCP/IP packet protocols, is evaluated for various message sizes representative of full-color and gray-scale images, and a typical text article. The hardware and software component of the source and user terminals and the total number of users requesting service at one time are taken into account. Several parameters of each component are precisely analyzed using measurements and a decomposition method; these are used in a queuing model for computer simulation. The simulation model is tuned and verified by comparing its results with measurements taken on a laboratory prototype. Then, by varying component parameters in the model and observing the effect on the overall performance, the effects of many critical parameters can be quantified. The model is also used to predict the performance of future systems.<>
{"title":"The end-to-end performance of multimedia information services: data analysis and simulation","authors":"Y. Shibata, J. H. Irven","doi":"10.1109/HICSS.1989.48093","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48093","url":null,"abstract":"The end-to-end performance of a general multimedia information retrieval service, operating across a local area network (LAN) using the TCP/IP packet protocols, is evaluated for various message sizes representative of full-color and gray-scale images, and a typical text article. The hardware and software component of the source and user terminals and the total number of users requesting service at one time are taken into account. Several parameters of each component are precisely analyzed using measurements and a decomposition method; these are used in a queuing model for computer simulation. The simulation model is tuned and verified by comparing its results with measurements taken on a laboratory prototype. Then, by varying component parameters in the model and observing the effect on the overall performance, the effects of many critical parameters can be quantified. The model is also used to predict the performance of future systems.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"50 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":"129621792","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.48112
R. J. Norman, J. Nunamaker
An empirical study of computer-aided software-engineering (CASE) technology productivity perceptions of information systems professionals. In a PC-based survey, fifteen CASE technological functions were compared along with two behavioral functions using the method of paired comparison. A rank ordering of the results revealed that data-flow diagramming and the data dictionary maintenance technological functions were perceived to most improve the respondent's productivity over comparable manual methods. Two behavioral functions, communication with other team members and adherence to the enterprise's information systems development standards, were regarded as providing significantly less productivity improvement compared to 47.75% of the other stimuli or significantly more productivity improvement compared to 47.75% of the other stimuli, respectively is described.<>
{"title":"Integrated development environments: technological and behavioral productivity perceptions","authors":"R. J. Norman, J. Nunamaker","doi":"10.1109/HICSS.1989.48112","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48112","url":null,"abstract":"An empirical study of computer-aided software-engineering (CASE) technology productivity perceptions of information systems professionals. In a PC-based survey, fifteen CASE technological functions were compared along with two behavioral functions using the method of paired comparison. A rank ordering of the results revealed that data-flow diagramming and the data dictionary maintenance technological functions were perceived to most improve the respondent's productivity over comparable manual methods. Two behavioral functions, communication with other team members and adherence to the enterprise's information systems development standards, were regarded as providing significantly less productivity improvement compared to 47.75% of the other stimuli or significantly more productivity improvement compared to 47.75% of the other stimuli, respectively is described.<<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":"121160433","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.48023
D. Hudson, M. E. Cohen
Three different types of user interface in EMERGE, a medical expert system for analysis of chest pain in the emergency room, are described. They are a question-driven mode, in which the system asks the user to respond with y(es), n(o) or? (no information), or with a degree of presence of symptoms; a data-driven mode in which the user enters free-format English phrases; and a menu-driven mode in which the user chooses selections from a list by number. These interfaces are discussed in terms of their implementation, advantages and disadvantages, and the perception the end-user has of the system through the use of each interface. The methods by which the system communicates its results to the user are discussed, including presentation of consultation results, explanation capabilities and establishment of permanent patient files.<>
{"title":"Human-computer interaction in a medical decision support system","authors":"D. Hudson, M. E. Cohen","doi":"10.1109/HICSS.1989.48023","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48023","url":null,"abstract":"Three different types of user interface in EMERGE, a medical expert system for analysis of chest pain in the emergency room, are described. They are a question-driven mode, in which the system asks the user to respond with y(es), n(o) or? (no information), or with a degree of presence of symptoms; a data-driven mode in which the user enters free-format English phrases; and a menu-driven mode in which the user chooses selections from a list by number. These interfaces are discussed in terms of their implementation, advantages and disadvantages, and the perception the end-user has of the system through the use of each interface. The methods by which the system communicates its results to the user are discussed, including presentation of consultation results, explanation capabilities and establishment of permanent patient files.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"17 1 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":"130272959","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.48048
C. Burdorf, J. Fitch, J. Marti, J. Padget
The authors have examined existing profiling tools, which generally have crude interfaces, are clumsy to use, and monitor only accumulated CPU time and function calls, and have concluded that they are inadequate for profiling a large-scale multiprocessing system, even if they are adequate for manual analysis of a single processor system. They have developed a tool that collects the following information: where CPU time is expended, quality and quantity data passed between functions, how much global data is referenced and modified, and how these characteristics differ among processors on the network. To simplify data inspection the profiler has a mouse-driven graphical interface. The authors describe the design of the profiler and give examples of its utilization.<>
{"title":"A multiprocessor execution profiler","authors":"C. Burdorf, J. Fitch, J. Marti, J. Padget","doi":"10.1109/HICSS.1989.48048","DOIUrl":"https://doi.org/10.1109/HICSS.1989.48048","url":null,"abstract":"The authors have examined existing profiling tools, which generally have crude interfaces, are clumsy to use, and monitor only accumulated CPU time and function calls, and have concluded that they are inadequate for profiling a large-scale multiprocessing system, even if they are adequate for manual analysis of a single processor system. They have developed a tool that collects the following information: where CPU time is expended, quality and quantity data passed between functions, how much global data is referenced and modified, and how these characteristics differ among processors on the network. To simplify data inspection the profiler has a mouse-driven graphical interface. The authors describe the design of the profiler and give examples of its utilization.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"34 4 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":"133832316","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
扫码关注我们
求助内容：
应助结果提醒方式：