Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139413
K. Katsuyama, T. Nakakawaji, F. Sato, T. Mizuno
The testing environment FOREST (formal environment for systematic testing), which uses formal description techniques systematically, has been developed. FOREST generates the TTCN format test sequence from the specification described in SDL. Furthermore, FOREST generates the test data from the protocol data definition described in ASN.1. By using the FOREST system, the test specification and test execution and test report description are achieved systematically. Therefore, the cost of the testing phase of OSI upper layer software development is reduced. In particular, the facility for test sequence generation of FOREST realizes high coverage with a reasonable cost. The facility can efficiently check protocol specifications. The effectiveness of the approach is demonstrated by an application to the test design for the CCR protocol.<>
{"title":"FOREST: a systematic testing environment based on standardized formal description techniques","authors":"K. Katsuyama, T. Nakakawaji, F. Sato, T. Mizuno","doi":"10.1109/CMPSAC.1990.139413","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139413","url":null,"abstract":"The testing environment FOREST (formal environment for systematic testing), which uses formal description techniques systematically, has been developed. FOREST generates the TTCN format test sequence from the specification described in SDL. Furthermore, FOREST generates the test data from the protocol data definition described in ASN.1. By using the FOREST system, the test specification and test execution and test report description are achieved systematically. Therefore, the cost of the testing phase of OSI upper layer software development is reduced. In particular, the facility for test sequence generation of FOREST realizes high coverage with a reasonable cost. The facility can efficiently check protocol specifications. The effectiveness of the approach is demonstrated by an application to the test design for the CCR protocol.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129382238","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139347
Tan Sian Lip, C. H. Seng
The authors describe the design of AuditPro, an integrated collection of tools for supporting auditors performing internal control evaluation. Among the tools are a graphical document-flowchart editor, a graphical organization chart editor, an 'outliner-type' internal control questionnaire, and an expert system. The unique features of this system are that the knowledge-based component of the system is embedded within the internal control questionnaire; that the system is able to make inferences about the internal control system through direct analysis of the diagrams drawn using the graphical editors; and that the knowledge-representation is designed specifically to support internal control evaluation. AuditPro provides a natural framework for dialogue between domain experts and knowledge engineers. The system builds internal models of the internal control systems under evaluation through the diagraming tools so that some audit-concerns captured in knowledge bases can be answered by directly querying the internal models instead of the user. The 'outliner' user-interface gives users the initiative to browse and answer in whatever order is convenient at the time of use.<>
{"title":"AuditPro-integrating knowledge-based technology with diagramming tools for auditors","authors":"Tan Sian Lip, C. H. Seng","doi":"10.1109/CMPSAC.1990.139347","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139347","url":null,"abstract":"The authors describe the design of AuditPro, an integrated collection of tools for supporting auditors performing internal control evaluation. Among the tools are a graphical document-flowchart editor, a graphical organization chart editor, an 'outliner-type' internal control questionnaire, and an expert system. The unique features of this system are that the knowledge-based component of the system is embedded within the internal control questionnaire; that the system is able to make inferences about the internal control system through direct analysis of the diagrams drawn using the graphical editors; and that the knowledge-representation is designed specifically to support internal control evaluation. AuditPro provides a natural framework for dialogue between domain experts and knowledge engineers. The system builds internal models of the internal control systems under evaluation through the diagraming tools so that some audit-concerns captured in knowledge bases can be answered by directly querying the internal models instead of the user. The 'outliner' user-interface gives users the initiative to browse and answer in whatever order is convenient at the time of use.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128611513","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139316
Joseph P. Cavano, R. Duncan
A panel session organized to project what changes might occur in the near future to make parallel computers easier to program and use and to explore how such computers could benefit many application areas is reported. The following questions are discussed: (1) what type of applications will benefit on a widespread basis from improved performance; (1) whether serial and parallel programming will be integrated for greater reusability and portability; and (3) whether parallel computers will replace serial computers and, if so, what is needed so that concurrency can be handled more easily.<>
{"title":"Parallel processing in the 1990's: the promise and the pitfalls (Panel Session)","authors":"Joseph P. Cavano, R. Duncan","doi":"10.1109/CMPSAC.1990.139316","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139316","url":null,"abstract":"A panel session organized to project what changes might occur in the near future to make parallel computers easier to program and use and to explore how such computers could benefit many application areas is reported. The following questions are discussed: (1) what type of applications will benefit on a widespread basis from improved performance; (1) whether serial and parallel programming will be integrated for greater reusability and portability; and (3) whether parallel computers will replace serial computers and, if so, what is needed so that concurrency can be handled more easily.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126027065","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139329
Kathleen A. Jordan, A. J. Zawilski
The authors discuss the design and planning of a capability for the prototyping of visual metaphors and functions related to the patent examination process. This work was in support of the Automated Patent System project of the United States Patent and Trademark Office (PTO). Prototyping was intended as a means for defining and clarifying user requirements. The authors defined and tailored a prototyping methodology which was compatible with the current PTO system life cycle. Within this methodology, they established firm guidelines for reporting results and for assigning roles and responsibilities. They selected an area for prototyping based on the technical characteristics of the APS, and from this area, they generated several ideas for likely prototypes. Theses ideas served as a basis for defining the prototyping capability requirements, and a facility configuration was derived from these requirements.<>
{"title":"Specification of a rapid prototyping capability for the automated patent system","authors":"Kathleen A. Jordan, A. J. Zawilski","doi":"10.1109/CMPSAC.1990.139329","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139329","url":null,"abstract":"The authors discuss the design and planning of a capability for the prototyping of visual metaphors and functions related to the patent examination process. This work was in support of the Automated Patent System project of the United States Patent and Trademark Office (PTO). Prototyping was intended as a means for defining and clarifying user requirements. The authors defined and tailored a prototyping methodology which was compatible with the current PTO system life cycle. Within this methodology, they established firm guidelines for reporting results and for assigning roles and responsibilities. They selected an area for prototyping based on the technical characteristics of the APS, and from this area, they generated several ideas for likely prototypes. Theses ideas served as a basis for defining the prototyping capability requirements, and a facility configuration was derived from these requirements.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134255380","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139377
M. Aoyama
The author proposes a development process model: distributed concurrent development. The model has originated from various experiences in the development of large-scale switching software systems. Critical issues in the distributed concurrent development are discussed based on a process programming concept: observations on analogies between the modeling of distributed concurrent development and the disciplines of distributed concurrent software systems. A formalization of software development processes with an object-oriented approach is then proposed. Two process description languages and two behavior description languages are proposed which make it possible to represent the structure and dynamic behavior of development processes, respectively. The author also proposes a process-design process which is unique in that one can design and evaluate a development process before one initiates development activities. The entire process for developing a family of switching software systems has been defined with the description languages.<>
{"title":"Distributed concurrent development of software systems: an object-oriented process model","authors":"M. Aoyama","doi":"10.1109/CMPSAC.1990.139377","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139377","url":null,"abstract":"The author proposes a development process model: distributed concurrent development. The model has originated from various experiences in the development of large-scale switching software systems. Critical issues in the distributed concurrent development are discussed based on a process programming concept: observations on analogies between the modeling of distributed concurrent development and the disciplines of distributed concurrent software systems. A formalization of software development processes with an object-oriented approach is then proposed. Two process description languages and two behavior description languages are proposed which make it possible to represent the structure and dynamic behavior of development processes, respectively. The author also proposes a process-design process which is unique in that one can design and evaluate a development process before one initiates development activities. The entire process for developing a family of switching software systems has been defined with the description languages.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132326113","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139434
J. Collofello, Terry Fisher, Mary Rees
The authors present a testing methodology framework which attempts to provide guidance in testing technique selection and application. The framework defines several testing levels with complementary technique groups defined for each level. Each testing technique group is a collection of testing techniques with a common objective and emphasis. In addition, several categories of testing metrics are defined which can be utilized to increase testing effectiveness. The proposed testing methodology framework was initially developed to satisfy the diverse project needs of one organization. The methodology framework, however, is expandable and can be customized to meet the needs of other organizations and updated to reflect technology improvements in the testing area.<>
{"title":"A testing methodology framework","authors":"J. Collofello, Terry Fisher, Mary Rees","doi":"10.1109/CMPSAC.1990.139434","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139434","url":null,"abstract":"The authors present a testing methodology framework which attempts to provide guidance in testing technique selection and application. The framework defines several testing levels with complementary technique groups defined for each level. Each testing technique group is a collection of testing techniques with a common objective and emphasis. In addition, several categories of testing metrics are defined which can be utilized to increase testing effectiveness. The proposed testing methodology framework was initially developed to satisfy the diverse project needs of one organization. The methodology framework, however, is expandable and can be customized to meet the needs of other organizations and updated to reflect technology improvements in the testing area.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115602788","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139435
S. Su, Shirish Puranik, H. Lam
The authors present two heuristic algorithms for determining traversal paths in a semantic network which models an object-oriented database. The first algorithm is an extension of Dijkstra's shortest path algorithm, and it identifies the most likely interpretation of an incomplete specified query. The second algorithm finds all possible interpretations of the query and ranks them in order of likely interpretations. Cost assignment for different paths is based on a set of heuristic rules which allows costs to be dynamically determined during a path traversal. The algorithms have been implemented and are in use in a graphics interface developed for an object-oriented knowledge base management system.<>
{"title":"Heuristic algorithms for path determination in a semantic network","authors":"S. Su, Shirish Puranik, H. Lam","doi":"10.1109/CMPSAC.1990.139435","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139435","url":null,"abstract":"The authors present two heuristic algorithms for determining traversal paths in a semantic network which models an object-oriented database. The first algorithm is an extension of Dijkstra's shortest path algorithm, and it identifies the most likely interpretation of an incomplete specified query. The second algorithm finds all possible interpretations of the query and ranks them in order of likely interpretations. Cost assignment for different paths is based on a set of heuristic rules which allows costs to be dynamically determined during a path traversal. The algorithms have been implemented and are in use in a graphics interface developed for an object-oriented knowledge base management system.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114719799","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139384
R. Yazdani, M. Zargham
A technique for routing gridless channels is presented. This technique can handle channels of two or more layers without restricting layers to vertical or horizontal direction. Also, it considers all the important routing metrics simultaneously. Since this technique is based on the design rules, it is also capable of handling grid-based channels. The algorithm has been implemented in C on Sequent Balance 8000, which uses the UNIX operating system. The algorithm was run on several examples of gridless and grid-based channels with two or more layers, and for all of them it achieved good results. Besides its capability of routing both types of channels, having no restriction on the direction of each layer was important in achieving a more efficient solution for a channel. On both layout designs, this feature helped minimize the channel with the wire length, and the number of contacts.<>
{"title":"A gridless multilayer channel router","authors":"R. Yazdani, M. Zargham","doi":"10.1109/CMPSAC.1990.139384","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139384","url":null,"abstract":"A technique for routing gridless channels is presented. This technique can handle channels of two or more layers without restricting layers to vertical or horizontal direction. Also, it considers all the important routing metrics simultaneously. Since this technique is based on the design rules, it is also capable of handling grid-based channels. The algorithm has been implemented in C on Sequent Balance 8000, which uses the UNIX operating system. The algorithm was run on several examples of gridless and grid-based channels with two or more layers, and for all of them it achieved good results. Besides its capability of routing both types of channels, having no restriction on the direction of each layer was important in achieving a more efficient solution for a channel. On both layout designs, this feature helped minimize the channel with the wire length, and the number of contacts.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117257139","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139344
Fang-Yie Leu, Chien-Chiao Yang
The authors describe an effective rule-base inspection method that checks rule-base consistency and completeness by using an algorithmic approach. A knowledge base in this method is represented by a finite state diagram called a context transition diagram. Through this diagram, some errors and anomalies of the rule base can be clearly illustrated and identified. The characteristics of states representing such errors and anomalies in the state diagram are investigated, and the algorithms for effectively identifying those defects are introduced.<>
{"title":"Rule base inspection using algorithmic approach for data-access oriented knowledge-based systems","authors":"Fang-Yie Leu, Chien-Chiao Yang","doi":"10.1109/CMPSAC.1990.139344","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139344","url":null,"abstract":"The authors describe an effective rule-base inspection method that checks rule-base consistency and completeness by using an algorithmic approach. A knowledge base in this method is represented by a finite state diagram called a context transition diagram. Through this diagram, some errors and anomalies of the rule base can be clearly illustrated and identified. The characteristics of states representing such errors and anomalies in the state diagram are investigated, and the algorithms for effectively identifying those defects are introduced.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122068963","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139353
A. Tayyab, J. G. Kuhl
Heterogeneous parallelism includes all forms of inter-instruction parallelism. This may include both explicitly coded and compiler generated forms. It is argued that support mechanisms are needed to efficiently manage heterogeneous subcomputations at run-time, and that the important issues in the design and implementation of these mechanisms are different from those previously studied for support of loop-level parallelism. An empirical study of an actual application is presented. The study was based on variational recursive dynamics simulation of a typical four wheel vehicle. The results of the empirical study indicate that the choice of an appropriate run-time parallel processing support mechanism can have a dramatic impact upon the ability to successfully extract heterogeneous parallelism for programs. In particular, the efficiency (lack of overhead) of the support mechanisms becomes critically important as the granularity of subcomputations becomes relatively fine. The use of simple, syntactically closed constructs is suggested.<>
{"title":"Management of heterogeneous parallelism on shared memory multiprocessors","authors":"A. Tayyab, J. G. Kuhl","doi":"10.1109/CMPSAC.1990.139353","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139353","url":null,"abstract":"Heterogeneous parallelism includes all forms of inter-instruction parallelism. This may include both explicitly coded and compiler generated forms. It is argued that support mechanisms are needed to efficiently manage heterogeneous subcomputations at run-time, and that the important issues in the design and implementation of these mechanisms are different from those previously studied for support of loop-level parallelism. An empirical study of an actual application is presented. The study was based on variational recursive dynamics simulation of a typical four wheel vehicle. The results of the empirical study indicate that the choice of an appropriate run-time parallel processing support mechanism can have a dramatic impact upon the ability to successfully extract heterogeneous parallelism for programs. In particular, the efficiency (lack of overhead) of the support mechanisms becomes critically important as the granularity of subcomputations becomes relatively fine. The use of simple, syntactically closed constructs is suggested.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680540","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
扫码关注我们
求助内容：
应助结果提醒方式：