[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference最新文献

筛选
英文 中文
Construction of file management systems from software components 从软件组件构建文件管理系统
D. Batory, J. Barnett, J. Roy, B. C. Twichell, J. Garza
{"title":"Construction of file management systems from software components","authors":"D. Batory, J. Barnett, J. Roy, B. C. Twichell, J. Garza","doi":"10.1109/CMPSAC.1989.65108","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65108","url":null,"abstract":"Domain analysis, a classical approach to the indentification of reusable software modules, relies on in-depth studies of existing systems, published algorithms, and structures to discern generic architectures for large classes of systems. An architecture is a template in which building-block modules can be plugged. Interfaces are standardized to make blocks interchangeable. The authors explain how domain analysis has led them to a building-blocks technology for file management systems (FMSs), and they describe their most recent prototype, an FMS synthesizer. The synthesizer enables a customized FMS to be assembled from prewritten components in minutes at virtually no cost.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"38 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":"121825820","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}
引用次数: 14
On the definition and maintenance of database views with time-varying domains 时变域数据库视图的定义与维护
M. Bassiouni, M. Llewellyn
{"title":"On the definition and maintenance of database views with time-varying domains","authors":"M. Bassiouni, M. Llewellyn","doi":"10.1109/CMPSAC.1989.65086","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65086","url":null,"abstract":"An approach and a mechanism for the definition and maintenance of views within temporal database environments are outlined. The view definition language makes use of extending Boolean and comparison operators by allowing their operands to be sets of intervals. A mechanism for maintaining temporal views is presented, and it is shown that temporal database views have far fewer maintenance problems than their standard relational counterparts.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"174 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":"123056970","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}
引用次数: 0
Automated protocol modeling and verification combining an entity-based specification language and Petri nets 自动协议建模和验证结合了基于实体的规范语言和Petri网
S. Shatz, Toshinori Suzuki, T. Murata
{"title":"Automated protocol modeling and verification combining an entity-based specification language and Petri nets","authors":"S. Shatz, Toshinori Suzuki, T. Murata","doi":"10.1109/CMPSAC.1989.65151","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65151","url":null,"abstract":"An approach for automated modeling and verification of communication protocols is presented. A language that specifies input/output behavior of protocol entities is introduced as the starting point, and some verification of the specifications is discussed. Further verification is aided by translation of the specifications to a timed Petri net model.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"42 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":"123128124","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}
引用次数: 2
Quality feedback in software development management-methodology and practical application 软件开发管理方法和实际应用中的质量反馈
Mamoru Sugahara, Akira Ohmori, Masahiro Tohyama, H. Ikegame, Tetsuya Takase
{"title":"Quality feedback in software development management-methodology and practical application","authors":"Mamoru Sugahara, Akira Ohmori, Masahiro Tohyama, H. Ikegame, Tetsuya Takase","doi":"10.1109/CMPSAC.1989.65133","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65133","url":null,"abstract":"Quality feedback (QFB) is a way to upgrade the quality of feedback between check and action in the plan-do-check-action (PDCA) cycle, especially the quality of feedback closely associated with the improvement of the software development process. To perform QFB, the authors have developed a methodology that includes a model for evaluating software development in phases and a series of methods spanning from data collection and evaluation to the feedback of findings. The application of the QFB methodology to software development projects is described.<<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":"121356261","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}
引用次数: 0
Parallel protocol verification using the two-phase algorithm 使用两阶段算法的并行协议验证
M. Yuang, A. Kershenbaum
{"title":"Parallel protocol verification using the two-phase algorithm","authors":"M. Yuang, A. Kershenbaum","doi":"10.1109/CMPSAC.1989.65080","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65080","url":null,"abstract":"A parallel protocol verification algorithm, called the two-phase algorithm, is proposed in an attempt to provide a maximum of verification with a minimum of state space. Rather than compose all communicating finite-state machines (FSMs) into one large global reachability tree, the two-phase algorithm constructs a local expanded tree for each FSM augmented with external information. The first phase of the algorithm performs the expanded tree construction and the second phase performs error detection based on the constructed expanded trees. By separating verification into two phases, the algorithm allows verification for all FSMs to be executed in parallel. The algorithm thus requires a shorter run-time. Moreover, by introducing a new method for the construction of the expanded trees, the algorithm requires fewer explored states. The algorithm can verify protocols with any number of processes. Verification for protocols with more than two processes is illustrated.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"16 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":"126437238","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}
引用次数: 3
Software testing for critical applications: a position paper 关键应用程序的软件测试:立场文件
R. DeMillo
{"title":"Software testing for critical applications: a position paper","authors":"R. DeMillo","doi":"10.1109/CMPSAC.1989.65138","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65138","url":null,"abstract":"Summary form only given. The management of test and evaluation programs for life-critical software, particularly within the US Department of Defense, is largely fragmented and ineffective. As a result, software remains a significant and uncontrolled risk element in major systems. Some problems yet to be adequately addressed are identified.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"53 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":"129492634","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}
引用次数: 0
A2QDT: a syntax-directed Prolog dialect translator A2QDT:一个语法导向的Prolog方言翻译器
M. W. Du, S. C. Chang, Anita L. Chow
{"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}
引用次数: 0
Zero-one integer programming model in path selection problem of structural testing 结构测试路径选择问题中的0 - 1整数规划模型
Jin-Cherng Lin, C. Chung
{"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}
引用次数: 7
A knowledge base for code reuse by similarity 基于相似性的代码重用知识库
Bonnie K. MacKellar, F. Maryanski
{"title":"A knowledge base for code reuse by similarity","authors":"Bonnie K. MacKellar, F. Maryanski","doi":"10.1109/CMPSAC.1989.65158","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65158","url":null,"abstract":"A description is given of WharfRat, a knowledge base of data type implementations which employs case-based reasoning as its primary retrieval mechanism. Given a description of an abstract data type, it retrieves the most similar data type implementation in the knowledge base. The focus of the study is the process by which two case descriptions are compared. Similarity between data types is modeled by a fuzzy relation. A set of similarity matching rules has been developed and implemented. The system employs a general, graph-based data model in which object types are organized in a specialization network. Abstract data representations are built using the constructs of the general data model. This system is the first step toward developing a complete programming-by-similarity system.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"70 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":"123882445","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}
引用次数: 7
Structure design of distributed systems using interpreted Petri nets 基于解释Petri网的分布式系统结构设计
J. Tankoano, J. Derniame
{"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}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书