Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65186
M. W. Du, S. C. Chang, Anita L. Chow
A syntax-directed translator has been implemented to translate Prolog programs from Arity dialect into Quintus dialect. A comparison of the features of the two dialects, the strategies used in writing the translator, and the implementation considerations are described. Experience gained by using the translator to port an Arity version of FAIRS, an information retrieval system, to a VAX Unix environment is presented.<>
{"title":"A2QDT: a syntax-directed Prolog dialect translator","authors":"M. W. Du, S. C. Chang, Anita L. Chow","doi":"10.1109/CMPSAC.1989.65186","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65186","url":null,"abstract":"A syntax-directed translator has been implemented to translate Prolog programs from Arity dialect into Quintus dialect. A comparison of the features of the two dialects, the strategies used in writing the translator, and the implementation considerations are described. Experience gained by using the translator to port an Arity version of FAIRS, an information retrieval system, to a VAX Unix environment is presented.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117182762","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-09-20DOI: 10.1109/CMPSAC.1989.65156
Jin-Cherng Lin, C. Chung
A major issue in structural program testing is how to select a minimal set of test paths to meet certain test requirements. The zero-one integer programming model, a generalized optimal path selection method for node (or statement) testing and branch testing criteria, is extended in such a way that it can be used for DD-path testing, TER/sub n/ measurement, and all types of local coverage test criteria. With slight modification, it can also be applied to all types of data-flow-oriented test criteria. The model can be used for program testing based on any coverage criterion of the structural testing approach. If a mixture of multiple test criteria is needed, the model is still workable. The model can be applied to program testing with various objective functions and can be extended to multiple goal objective function problems. Since the objective functions are independent from the constraints of test criteria, it is possible to have various combinations of optimization criteria and coverage requirements according to the specified test strategy. Characteristics of the zero-one integer programming model are discussed.<>
{"title":"Zero-one integer programming model in path selection problem of structural testing","authors":"Jin-Cherng Lin, C. Chung","doi":"10.1109/CMPSAC.1989.65156","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65156","url":null,"abstract":"A major issue in structural program testing is how to select a minimal set of test paths to meet certain test requirements. The zero-one integer programming model, a generalized optimal path selection method for node (or statement) testing and branch testing criteria, is extended in such a way that it can be used for DD-path testing, TER/sub n/ measurement, and all types of local coverage test criteria. With slight modification, it can also be applied to all types of data-flow-oriented test criteria. The model can be used for program testing based on any coverage criterion of the structural testing approach. If a mixture of multiple test criteria is needed, the model is still workable. The model can be applied to program testing with various objective functions and can be extended to multiple goal objective function problems. Since the objective functions are independent from the constraints of test criteria, it is possible to have various combinations of optimization criteria and coverage requirements according to the specified test strategy. Characteristics of the zero-one integer programming model are discussed.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121540630","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-09-20DOI: 10.1109/CMPSAC.1989.65134
T. Miyoshi, Yasuko Togashi, M. Azuma
An evaluation technology for software development environments based on a software quality evaluation process model was developed. This evaluation technology was applied to a software development environments project, FASET (formal approach to software environment technology), to evaluate prototype environments. The quality evaluation process model and its concept are presented, the technology for evaluating a software development environment is described, and the experimental process and results of the FASET project are shown.<>
{"title":"Evaluating software development environment quality","authors":"T. Miyoshi, Yasuko Togashi, M. Azuma","doi":"10.1109/CMPSAC.1989.65134","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65134","url":null,"abstract":"An evaluation technology for software development environments based on a software quality evaluation process model was developed. This evaluation technology was applied to a software development environments project, FASET (formal approach to software environment technology), to evaluate prototype environments. The quality evaluation process model and its concept are presented, the technology for evaluating a software development environment is described, and the experimental process and results of the FASET project are shown.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114263502","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-09-20DOI: 10.1109/CMPSAC.1989.65139
J. Gaffney
Definitions of software reliability are presented, and an overview of reliability is given. The system-software-availability relationship is also explored.<>
给出了软件可靠性的定义，并对可靠性进行了概述。本文还探讨了系统-软件-可用性的关系。
{"title":"On predicting software reliability","authors":"J. Gaffney","doi":"10.1109/CMPSAC.1989.65139","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65139","url":null,"abstract":"Definitions of software reliability are presented, and an overview of reliability is given. The system-software-availability relationship is also explored.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125499414","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-09-20DOI: 10.1109/CMPSAC.1989.65052
J. Tankoano, J. Derniame
An approach is presented to internal structure design of distributed systems in the field of process control. Starting from an IPN (interpreted Petri net) specifying the external behavior of a system, the approach (based on a set of decomposition rules) allows a systematic construction of structure specification, thus making unnecessary the consistency verification usually employed in top-down design methods. It is shown that the decomposition rules presented allow systematic construction of the internal structure of distributed systems. These rules free the designer from specifying intermodule cooperation and from verifying consistency between the external behavior and the internal structure specification.<>
{"title":"Structure design of distributed systems using interpreted Petri nets","authors":"J. Tankoano, J. Derniame","doi":"10.1109/CMPSAC.1989.65052","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65052","url":null,"abstract":"An approach is presented to internal structure design of distributed systems in the field of process control. Starting from an IPN (interpreted Petri net) specifying the external behavior of a system, the approach (based on a set of decomposition rules) allows a systematic construction of structure specification, thus making unnecessary the consistency verification usually employed in top-down design methods. It is shown that the decomposition rules presented allow systematic construction of the internal structure of distributed systems. These rules free the designer from specifying intermodule cooperation and from verifying consistency between the external behavior and the internal structure specification.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114580499","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-09-20DOI: 10.1109/CMPSAC.1989.65068
Michael Weiss
Ideas developed for vectorization can be applied to the problems encountered in compiling parallel languages. The issues that arise with data allocation and strip mining for SIMD architectures are discussed. Two simple examples illustrate the interplay between strip mining and interprocessor communication.<>
{"title":"Parallel languages, vectorization, and compilers","authors":"Michael Weiss","doi":"10.1109/CMPSAC.1989.65068","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65068","url":null,"abstract":"Ideas developed for vectorization can be applied to the problems encountered in compiling parallel languages. The issues that arise with data allocation and strip mining for SIMD architectures are discussed. Two simple examples illustrate the interplay between strip mining and interprocessor communication.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129529163","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-09-20DOI: 10.1109/CMPSAC.1989.65164
Tsu-Chang Lee, A. Peterson
A novel algorithm for dynamically adapting the size of neural networks is proposed. According to the measures to be defined, a neuron in the network will generate a new neuron when the variation of its weight vector is high (i.e. when it is not learned) and will be annihilated if it is not active for a long time. This algorithm is tested on a simple but popular neural network model, Self Organization Feature Map (SOFM), and implemented in software using a double linked list. Using this algorithm, one can initially put a set of seed neurons in the network and then let the network grow according to the training patterns. It is observed from the simulation results that the network will eventually grow to a configuration suitable to the class of problems characterized by the training patterns, i.e. the neural network synthesizes itself to fit the problem space.<>
{"title":"Implementing a self-development neural network using doubly linked lists","authors":"Tsu-Chang Lee, A. Peterson","doi":"10.1109/CMPSAC.1989.65164","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65164","url":null,"abstract":"A novel algorithm for dynamically adapting the size of neural networks is proposed. According to the measures to be defined, a neuron in the network will generate a new neuron when the variation of its weight vector is high (i.e. when it is not learned) and will be annihilated if it is not active for a long time. This algorithm is tested on a simple but popular neural network model, Self Organization Feature Map (SOFM), and implemented in software using a double linked list. Using this algorithm, one can initially put a set of seed neurons in the network and then let the network grow according to the training patterns. It is observed from the simulation results that the network will eventually grow to a configuration suitable to the class of problems characterized by the training patterns, i.e. the neural network synthesizes itself to fit the problem space.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133492311","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-09-20DOI: 10.1109/CMPSAC.1989.65062
O. Brewer, J. Dongarra, D. Sorensen
A graphics tool called BUILD that can be used to help automate the process of writing parallel FORTRAN programs for the SCHEDULE package is presented. The user can interactively build an execution graph that describes his or her algorithm and then have the tool generate the necessary calls to the SCHEDULE package. The tool and its use are described, and some examples that have been built using the tool are presented.<>
{"title":"A graphics tool to aid in the generation of parallel FORTRAN programs","authors":"O. Brewer, J. Dongarra, D. Sorensen","doi":"10.1109/CMPSAC.1989.65062","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65062","url":null,"abstract":"A graphics tool called BUILD that can be used to help automate the process of writing parallel FORTRAN programs for the SCHEDULE package is presented. The user can interactively build an execution graph that describes his or her algorithm and then have the tool generate the necessary calls to the SCHEDULE package. The tool and its use are described, and some examples that have been built using the tool are presented.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130264593","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-09-20DOI: 10.1109/CMPSAC.1989.65099
Christina Liebelt
Transaction programs by definition have to maintain all consistency constraints defined on a database. Although the overall operational consistency of a database rests on this crucial assumption, there are few design aids to support the design of consistent transaction programs. An approach is presented for verifying that the defined integrity constraints are not violated by a transaction program. Assuming that the database is in a consistent state before the transaction program starts, the database stays consistent after the execution of a correct transaction program. In this approach all computations and all modifications on the database are identified and represented with symbolic values. The symbolic representation of the output variables and database operations is used to verify the integrity constraints. Therefore, it is possible to support the application programmer in designing correct transaction programs.<>
{"title":"Designing consistency-preserving database transactions","authors":"Christina Liebelt","doi":"10.1109/CMPSAC.1989.65099","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65099","url":null,"abstract":"Transaction programs by definition have to maintain all consistency constraints defined on a database. Although the overall operational consistency of a database rests on this crucial assumption, there are few design aids to support the design of consistent transaction programs. An approach is presented for verifying that the defined integrity constraints are not violated by a transaction program. Assuming that the database is in a consistent state before the transaction program starts, the database stays consistent after the execution of a correct transaction program. In this approach all computations and all modifications on the database are identified and represented with symbolic values. The symbolic representation of the output variables and database operations is used to verify the integrity constraints. Therefore, it is possible to support the application programmer in designing correct transaction programs.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127188151","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-09-20DOI: 10.1109/CMPSAC.1989.65178
S. Yeh, Chuan-lin Wu, Hong-Da Sheng, C. Hung, R. Lee
An expert system for network management is designed and prototyped to do network troubleshooting automatically. The expert system employs management information provided by a monitoring mechanism of the network. The whole spectrum of the fault management information is analyzed. The management knowledge derived is categorized into five types: the physical property, the experience in the past, the heuristic rule of thumb, the predictable problems, and the deep knowledge. These knowledge types and related rules are divided into groups to improve reasoning speed. The expert system is composed of a problem manager, a problem analyzer, and many problem solvers. A prototyped expert system, using simulated faults, shows that the expert-system-based fault management system can automatically diagnose problems and take corrective actions.<>
{"title":"Expert system based automatic network fault management system","authors":"S. Yeh, Chuan-lin Wu, Hong-Da Sheng, C. Hung, R. Lee","doi":"10.1109/CMPSAC.1989.65178","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65178","url":null,"abstract":"An expert system for network management is designed and prototyped to do network troubleshooting automatically. The expert system employs management information provided by a monitoring mechanism of the network. The whole spectrum of the fault management information is analyzed. The management knowledge derived is categorized into five types: the physical property, the experience in the past, the heuristic rule of thumb, the predictable problems, and the deep knowledge. These knowledge types and related rules are divided into groups to improve reasoning speed. The expert system is composed of a problem manager, a problem analyzer, and many problem solvers. A prototyped expert system, using simulated faults, shows that the expert-system-based fault management system can automatically diagnose problems and take corrective actions.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116010981","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
扫码关注我们
求助内容：
应助结果提醒方式：