13th International Symposium on Software Reliability Engineering, 2002. Proceedings.最新文献

A framework for live software upgrade 用于实时软件升级的框架

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173236

Lizhou Yu, G. Shoja, H. Müller, A. Srinivasan

{"title":"A framework for live software upgrade","authors":"Lizhou Yu, G. Shoja, H. Müller, A. Srinivasan","doi":"10.1109/ISSRE.2002.1173236","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173236","url":null,"abstract":"The demand for continuous service in mission- and safety-critical software applications is increasing. For these applications, it is unacceptable to shutdown and restart the system during software upgrade. This paper examines issues relating to on-line upgrades for mission- and safety-critical software applications. We believe that a dynamic architecture and communication model provides an excellent foundation for runtime software evolution. To solve the problems mentioned above, we designed and implemented a framework, which addresses four main areas: dynamic architecture and communication model, reconfiguration management, the upgrade protocol, and the upgrade technique. The framework can be used for online upgrading of multi-task software applications, which provide multiple mission-critical services. In the framework discussed in the paper, the ability to make runtime modifications is considered at the software architecture-level. The dynamic architecture and communication model makes it possible for software applications to add, remove, and hot swap modules on the fly. The transition scenario is specified by the upgrade protocol. The framework also provides the mechanism for maintaining state consistency. In order to ensure a reliable upgrade, a two-phase commit protocol is utilized to implement the atomic upgrade transactions. In addition, a command line interface facilitates the reconfiguration management. A simulation study of the proposed framework was carried out for live software upgrade of several practical applications. The results of the simulation are also presented.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129152228","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}

引用次数: 12

Emulation of software faults by educated mutations at machine-code level 在机器代码级别上通过受教育的突变来模拟软件故障

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173283

J. Durães, H. Madeira

引用次数: 40

Modeling and analysis of software rejuvenation in cable modem termination systems 电缆调制解调器终端系统中软件再生的建模与分析

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173239

Yun Liu, Kishor S. Trivedi, Yue Ma, James J. Han, H. Levendel

引用次数: 36

A vector Markov model for structural coverage growth and the number of failure occurrences 结构覆盖增长和失效次数的向量马尔可夫模型

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173276

Michael Grottke

{"title":"A vector Markov model for structural coverage growth and the number of failure occurrences","authors":"Michael Grottke","doi":"10.1109/ISSRE.2002.1173276","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173276","url":null,"abstract":"Most software reliability growth models specify the expected number of failures experienced as a function of testing effort or calendar time. However, there are approaches to model the development of intermediate factors driving failure occurrences. This paper starts out with presenting a model framework consisting of four consecutive relationships. It is shown that a differential equation representing this framework is a generalization of several finite failures category models. The relationships between the number of test cases executed and expected structural coverage, and between expected structural coverage and the expected number of failure occurrences are then explored further. A vector Markov model allowing for partial redundancy in sampling code constructs is developed. The model bridges the gap between setups related to operational testing and systematic testing, respectively. Two extensions of the partial redundancy model considering the development of the number of failure occurrences are discussed. The paper concludes with showing that the extended models fit into the structure of the differential equation presented at the beginning, which permits further interpretation.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736438","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}

引用次数: 12

A case study using the round-trip strategy for state-based class testing 使用基于状态的类测试的往返策略的案例研究

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173268

G. Antoniol, L. Briand, M. D. Penta, Y. Labiche

{"title":"A case study using the round-trip strategy for state-based class testing","authors":"G. Antoniol, L. Briand, M. D. Penta, Y. Labiche","doi":"10.1109/ISSRE.2002.1173268","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173268","url":null,"abstract":"A number of strategies have been proposed for state-based class testing. An important proposal made by Chow (1978), that was subsequently adapted by Binder (1999), consists in deriving test sequences covering all round-trip paths in a finite state machine (FSMs). Based on a number of (rather strong) assumptions, and for traditional FSMs, it can be demonstrated that all operation and transfer errors in the implementation can be uncovered. Through experimentation, this paper investigates this strategy when used in the context of UML statecharts. Based on a set of mutation operators proposed for object-oriented code we seed a significant number of faults in an implementation of a specific container class. We then investigate the effectiveness of four test teams at uncovering faults, based on the round-trip path strategy, and analyze the faults that seem to be difficult to detect. Our main conclusion is that the round-trip path strategy is reasonably effective at detecting faults (87% average as opposed to 69% for size-equivalent, random test cases) but that a significant number of faults can only exhibit a high detection probability by augmenting the round-trip strategy with a traditional black-box strategy such as category-partition testing. This increases the number of test cases to run -and therefore the cost of testing- and a cost-benefit analysis weighting the increase of testing effort and the likely gain in fault detection is necessary.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134269688","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}

引用次数: 58

Mutation of Java objects Java对象的变异

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173285

R. Alexander, J. Bieman, Sudipto Ghosh, Bixia Ji

{"title":"Mutation of Java objects","authors":"R. Alexander, J. Bieman, Sudipto Ghosh, Bixia Ji","doi":"10.1109/ISSRE.2002.1173285","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173285","url":null,"abstract":"Fault insertion based techniques have been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating mutation-adequate test sets that distinguish the mutant from the original program. Software testability is measured by calculating the probability that a program will fail on the next test input coming from a predefined input distribution, given that the software includes a fault. Inserted faults must represent plausible errors. It is relatively easy to apply standard transformations to mutate scalar values such as integers, floats, and character data, because their semantics are well understood. Mutating objects that are instances of user defined types is more difficult. There is no obvious way to modify such objects in a manner consistent with realistic faults, without writing custom mutation methods for each object class. We propose a new object mutation approach along with a set of mutation operators and support tools for inserting faults into objects that instantiate items from common Java libraries heavily used in commercial software as well as user defined classes. Preliminary evaluation of our technique shows that it should be effective for evaluating real-world software testing suites.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128956445","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}

引用次数: 65

Inter-class mutation operators for Java Java的类间变异操作符

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173287

Yu-Seung Ma, Yong-Rae Kwon, Jeff Offutt

{"title":"Inter-class mutation operators for Java","authors":"Yu-Seung Ma, Yong-Rae Kwon, Jeff Offutt","doi":"10.1109/ISSRE.2002.1173287","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173287","url":null,"abstract":"The effectiveness of mutation testing depends heavily on the types of faults that the mutation operators are designed to represent. Therefore, the quality of the mutation operators is key to mutation testing. Mutation testing has traditionally been applied to procedural-based languages, and mutation operators have been developed to support most of their language features. Object-oriented programming languages contain new language features, most notably inheritance, polymorphism, and dynamic binding. Not surprisingly; these language features allow new kinds of faults, some of which are not modeled by traditional mutation operators. Although mutation operators for OO languages have previously been suggested, our work in OO faults indicate that the previous operators are insufficient to test these OO language features, particularly at the class testing level. This paper introduces a new set of class mutation operators for the OO language Java. These operators are based on specific OO faults and can be used to detect faults involving inheritance, polymorphism, and dynamic binding, thus are useful for inter-class testing. An initial Java mutation tool has recently been completed, and a more powerful version is currently under construction.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131789222","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}

引用次数: 241

Improving usefulness of software quality classification models based on Boolean discriminant functions 提高基于布尔判别函数的软件质量分类模型的有效性

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173256

T. Khoshgoftaar

{"title":"Improving usefulness of software quality classification models based on Boolean discriminant functions","authors":"T. Khoshgoftaar","doi":"10.1109/ISSRE.2002.1173256","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173256","url":null,"abstract":"BDF (Boolean discriminant functions) are an attractive technique for software quality estimation. Software quality classification models based on BDF provide stringent rules for classifying not fault-prone modules (nfp), thereby predicting a large number of modules as fp. Such models are practically not useful from software quality assurance and software management points of view. This is because, given the large number of modules predicted as fp, project management will face a difficult task of deploying, cost-effectively, the always-limited reliability improvement resources to all the fp modules. This paper proposes the use of generalized Boolean discriminant functions (GBDF) as a solution for improving the practical and managerial usefulness of classification models based on BDF. In addition, the use of GBDF avoids the need to build complex hybrid classification models in order to improve usefulness of models based on BDF. A case study of a full-scale industrial software system is presented to illustrate the promising results obtained from using the proposed classification technique using GBDF.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122140617","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}

引用次数: 28

Fault contribution trees for product families 产品族的故障贡献树

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173258

Dingding Lu, R. Lutz

{"title":"Fault contribution trees for product families","authors":"Dingding Lu, R. Lutz","doi":"10.1109/ISSRE.2002.1173258","DOIUrl":"https://doi.org/10.1109/ISSRE.2002.1173258","url":null,"abstract":"Software fault tree analysis (SFTA) provides a structured way to reason about the safety or reliability of a software system. As such, SFTA is widely used in mission-critical applications to investigate contributing causes to possible hazards or failures. In this paper we propose an approach similar to SFTA for product families. The contribution of the paper is to define a top-down, tree-based analysis technique, the fault contribution tree analysis (FCTA), that operates on the results of a product-family domain analysis and to describe a method by which the FCTA of a product family can serve as a reusable asset in the building of new members of the family. Specifically, we describe both the construction of the fault contribution tree for a product family (domain engineering) and the reuse of the appropriately pruned fault contribution tree for the analysis of a new member of the product family (application engineering). The paper describes several challenges to this approach, including evolution of the product family, handling of subfamilies, and distinguishing the limits of safe reuse of the FCTA, and suggests partial solutions to these issues as well as directions for future work. The paper illustrates the techniques with examples from applications to two product families.","PeriodicalId":159160,"journal":{"name":"13th International Symposium on Software Reliability Engineering, 2002. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134206399","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}

引用次数: 26

A reliability estimator for model based software testing 一种基于模型的软件测试可靠性估计方法

13th International Symposium on Software Reliability Engineering, 2002. Proceedings. Pub Date : 2002-11-12 DOI: 10.1109/ISSRE.2002.1173212

Kirk Sayre, J. Poore

引用次数: 17