Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering最新文献_第2页

Task decomposition testing and metrics for concurrent programs 并发程序的任务分解测试和度量

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558726

C. Chung, T. Shih, Ying-Hong Wang, Wei-Chuan Lin, Ying-Feng Kuo

{"title":"Task decomposition testing and metrics for concurrent programs","authors":"C. Chung, T. Shih, Ying-Hong Wang, Wei-Chuan Lin, Ying-Feng Kuo","doi":"10.1109/ISSRE.1996.558726","DOIUrl":"https://doi.org/10.1109/ISSRE.1996.558726","url":null,"abstract":"Software testing and metrics are two important approaches to assure the reliability and quality of software. The emergence of concurrent programming in recent years introduces new testing problems and difficulties that cannot be solved by testing techniques for traditional sequential programs. One of the difficult tasks is that concurrent programs can have many instances of execution for the same set of input data. Many concurrent program testing methodologies propose to solve controlled execution and determinism. There are few discussions of concurrent software testing from the inter-task viewpoints. Yet, the common characteristics of concurrent programming are explicit identification of the large grain parallel computation units (tasks), and the explicit inter-task communication via rendezvous-style mechanisms. In this paper, we focus on testing concurrent programs through task decomposition. We propose four testing criteria to test a concurrent program. The programmer can choose an appropriate testing strategy depending on the properties of the concurrent program. Associated with the strategies, four equations are provided to measure the complexity of concurrent programs.","PeriodicalId":441362,"journal":{"name":"Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132996470","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}

引用次数: 16

A replication technique based on a functional and attribute grammar computation model 一种基于功能和属性语法计算模型的复制技术

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558862

A. Cherif, Masato Suzuki, T. Katayama

引用次数: 2

Using the genetic algorithm to build optimal neural networks for fault-prone module detection 利用遗传算法构建最优神经网络进行易损模块检测

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558759

R. Hochman, T. Khoshgoftaar, E. B. Allen, J. Hudepohl

引用次数: 33

An empirical evaluation of maximum likelihood voting in failure correlation conditions 失效相关条件下最大似然投票的经验评价

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558890

K. Kim, M. Vouk, D. McAllister

{"title":"An empirical evaluation of maximum likelihood voting in failure correlation conditions","authors":"K. Kim, M. Vouk, D. McAllister","doi":"10.1109/ISSRE.1996.558890","DOIUrl":"https://doi.org/10.1109/ISSRE.1996.558890","url":null,"abstract":"The maximum likelihood voting (MLV) strategy was recently proposed as one of the most reliable voting methods. The strategy determines the most likely correct result based on the reliability history of each software version. However, the theoretical results were obtained under the assumption that inter-version failures are not correlated by common cause faults. We first discuss the issues that arise in practical implementation of MLV, and present an extended version of the MLV algorithm that uses component reliability estimates to break voting ties. We then empirically evaluate the implemented MLV strategy in a situation where the inter-version failures are highly correlated. Our results show that, although in real situations MLV carries no reliability guarantees, it tends to be statistically more reliable, even under high inter-version correlation conditions, than other voting strategies that we have examined. We also compare implemented MLV performance with that of Recovery Block and hybrid Consensus Recovery Block approaches. Our results show that MLV often outperforms Recovery Block and that it can successfully compete with more elaborate Consensus Recovery Block. To the best of our knowledge, this is the first empirical evaluation of the MLV strategy.","PeriodicalId":441362,"journal":{"name":"Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering","volume":"87 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133881186","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}

引用次数: 13

A conservative theory for long term reliability growth prediction 长期可靠性增长预测的保守理论

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558887

P. Bishop, R. Bloomfield

引用次数: 62

Residual fault density prediction using regression methods 残差故障密度的回归预测方法

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558706

J. A. Morgan, G. Knafl

引用次数: 10

Primary-shadow consistency issues in the DRB scheme and the recovery time bound DRB方案中的主阴影一致性问题和恢复时间限制

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558888

K. Kim, L. Bacellar, C. Subbaraman

{"title":"Primary-shadow consistency issues in the DRB scheme and the recovery time bound","authors":"K. Kim, L. Bacellar, C. Subbaraman","doi":"10.1109/ISSRE.1996.558888","DOIUrl":"https://doi.org/10.1109/ISSRE.1996.558888","url":null,"abstract":"The distributed recovery block (DRB) scheme is an approach for realizing both hardware and software fault tolerance in real time distributed and parallel computer systems. We point out that in order for the DRB scheme to yield a high fault coverage and a low recovery time bound, some important consistency requirements must be satisfied by the replicated application tasks in a DRB computing station. Newly identified approaches for meeting the consistency requirements, which involve, among other things, integration of network surveillance and reconfiguration (NSR) techniques with the DRB scheme, are presented. The paper then presents an analysis of the recovery time bound of the DRB scheme. The analysis is based on a modular structured concrete implementation model of the DRB scheme for local area network (LAN) based distributed computer systems, which is called the DRB/T LAN scheme and incorporates an NSR scheme and the newly identified consistency ensuring mechanisms. Finally, we consider approaches for applying the DRB scheme to new types of application computation segments that were not considered before and then discuss approaches for meeting the consistency requirements in such DRB stations. These approaches broaden the application range of the DRB scheme significantly.","PeriodicalId":441362,"journal":{"name":"Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122162245","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}

引用次数: 6

Designing reliable systems from reliable components using the context-dependent constraint concept 使用与上下文相关的约束概念从可靠组件设计可靠系统

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558738

Peter Molin

引用次数: 3

Software reliability engineering for client-server systems 客户机-服务器系统的软件可靠性工程

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558829

N. Schneidewind

{"title":"Software reliability engineering for client-server systems","authors":"N. Schneidewind","doi":"10.1109/ISSRE.1996.558829","DOIUrl":"https://doi.org/10.1109/ISSRE.1996.558829","url":null,"abstract":"Too often, when doing software reliability modeling and prediction, the assumption is made that the software involves either a single module or a single node. The reality in today's increasing use of multi-node client-server systems is that there are multiple software entities that execute on multiple nodes that must be modeled in a system context, if realistic reliability predictions and assessments are to be made. For example, if there are N/sub c/ clients and N/sub x/ servers in a client-server system, it is not necessarily the case that a software failure in any of the N/sub c/ clients or N/sub x/ servers will cause the system to fail. Thus, if such a system were to be modeled as a single entity, the predicted reliability would be much lower than the true reliability, because the prediction would not account for criticality and redundancy. The first factor accounts for the possibility that the survivability of some clients and servers will be more critical to continued system operation than others, while the second factor accounts for the possibility of using redundant nodes to allow for system recovery should a critical node fail. To address this problem, we must identify which nodes-clients and servers-are critical and which are not critical, as defined by whether these nodes are used for critical or non-critical functions, respectively.","PeriodicalId":441362,"journal":{"name":"Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129810363","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

Reliability and availability of a wide area network-based education system 基于广域网的教育系统的可靠性和可用性

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering Pub Date : 1996-10-30 DOI: 10.1109/ISSRE.1996.558815

P. Dixit, M. Vouk, D. Bitzer, Christopher Alix

引用次数: 7