Pub Date : 2013-12-19DOI: 10.1109/ISSREW.2013.6688922
Andreas Söderberg, Rolf Johansson
In this paper we discuss how to use a modified design methodology for contract based design (CBD) intended for development of software and component based systems by use of so called safety contracts. The primary purpose is to make a proposal on how to integrate safety contracts in a, for a tool, implementable way for automatic safety contract verification. This development technique is called safety contract based design (SCBD) in this paper. Focus is to discuss the similarities and differences between the actual contents in conventional CBD-contracts and safety contracts, and rules for how to verify agreements of safety contracts and how to ensure safety contract validity.
{"title":"Safety contract based design of software components","authors":"Andreas Söderberg, Rolf Johansson","doi":"10.1109/ISSREW.2013.6688922","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688922","url":null,"abstract":"In this paper we discuss how to use a modified design methodology for contract based design (CBD) intended for development of software and component based systems by use of so called safety contracts. The primary purpose is to make a proposal on how to integrate safety contracts in a, for a tool, implementable way for automatic safety contract verification. This development technique is called safety contract based design (SCBD) in this paper. Focus is to discuss the similarities and differences between the actual contents in conventional CBD-contracts and safety contracts, and rules for how to verify agreements of safety contracts and how to ensure safety contract validity.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660603","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688911
M. Hirai, Y. Yuasa, Y. Kinoshita
Accountability achievement is indispensable to dependability. When the acquirer entrusts the provider with a task, the provider owes not only the accomplishment of the task itself but also the accountability with respect to the accomplishment. We claim that there should be an explicitly described agreement with the scope of accountability and the procedure of the accounts for emergencies, in the same way as there should be an explicitly described agreement on system requirements as is widely accepted nowadays. This paper proposes a consensus building process for entrustments of tasks in system life cycles, and formalism for explicit description of accountability. Our consensus building process ensures that the acquirer of the system can obtain the required information from the provider whenever necessary. An entrustment of a task between the acquirer and the provider may occur recursively in various levels in system life cycles. We also discuss the accountability in the supply chain of entrustment. Our consensus building process and form for description of explicit accountability leads to a consistent system of accountability in the "DEOS Process," which has been proposed as an instance of system life cycle with the consideration of long term operation of open systems. As an example, a file server system is given which has been developed and is operating in practice according to our proposal.
{"title":"A chain of accountabilities in open systems based on assured entrustments","authors":"M. Hirai, Y. Yuasa, Y. Kinoshita","doi":"10.1109/ISSREW.2013.6688911","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688911","url":null,"abstract":"Accountability achievement is indispensable to dependability. When the acquirer entrusts the provider with a task, the provider owes not only the accomplishment of the task itself but also the accountability with respect to the accomplishment. We claim that there should be an explicitly described agreement with the scope of accountability and the procedure of the accounts for emergencies, in the same way as there should be an explicitly described agreement on system requirements as is widely accepted nowadays. This paper proposes a consensus building process for entrustments of tasks in system life cycles, and formalism for explicit description of accountability. Our consensus building process ensures that the acquirer of the system can obtain the required information from the provider whenever necessary. An entrustment of a task between the acquirer and the provider may occur recursively in various levels in system life cycles. We also discuss the accountability in the supply chain of entrustment. Our consensus building process and form for description of explicit accountability leads to a consistent system of accountability in the \"DEOS Process,\" which has been proposed as an instance of system life cycle with the consideration of long term operation of open systems. As an example, a file server system is given which has been developed and is operating in practice according to our proposal.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114736176","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688876
S. Kothari
Stealing secrets from a smartphone, damaging a nuclear reactor and bringing down a power grid are disasters easily within the reach of today's cyber attackers. A mobile phone, a car, a nuclear reactor, a missile, a power grid, in fact anything that contains sophisticated software can be a target for these attacks. Catastrophe is all but inevitable if cyber security measures fail to match the sophistication of saboteurs.
{"title":"Computational modeling to detect software sabotage: A discussion of technical challenges and a demonstration of innovative technology","authors":"S. Kothari","doi":"10.1109/ISSREW.2013.6688876","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688876","url":null,"abstract":"Stealing secrets from a smartphone, damaging a nuclear reactor and bringing down a power grid are disasters easily within the reach of today's cyber attackers. A mobile phone, a car, a nuclear reactor, a missile, a power grid, in fact anything that contains sophisticated software can be a target for these attacks. Catastrophe is all but inevitable if cyber security measures fail to match the sophistication of saboteurs.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124046882","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688854
N. Silva, M. Vieira
Electronic/embedded systems are more and more dependent and relying on software flexibility and properties. They can be found in all spheres of our lives at a macro and global scale, ranging from personal and entertainment devices, household appliances, all types of transportation systems, global communication systems, civilian and military systems, energy and banking systems, and so on. Given the importance of all these systems and the safety and security requirements that become associated, national and international regulators require appropriate certification of each characteristic of the referred ubiquitous systems. This abstract presents the initial ideas concerning a quantitative analysis and evaluation of the evidence set forward in safety cases that support and eventually lead to certification of embedded systems with large parts of software. A discussion about the current industrial practices, limitations and state of the art related to certification evidences is drafted, and ideas concerning how can evidences be improved in terms of completeness, coherency, correctness, coverage, etc, as well as how can a quantitative analysis of the certification process be derived, are introduced for discussion and feedback. Current practices are not perfect, not properly applied, or applied in very different ways, presenting limitations, flaws and simplifications that put jeopardize systems safety, this is why we intend to initiate this research work.
{"title":"Certification of embedded systems: Quantitative analysis and irrefutable evidences","authors":"N. Silva, M. Vieira","doi":"10.1109/ISSREW.2013.6688854","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688854","url":null,"abstract":"Electronic/embedded systems are more and more dependent and relying on software flexibility and properties. They can be found in all spheres of our lives at a macro and global scale, ranging from personal and entertainment devices, household appliances, all types of transportation systems, global communication systems, civilian and military systems, energy and banking systems, and so on. Given the importance of all these systems and the safety and security requirements that become associated, national and international regulators require appropriate certification of each characteristic of the referred ubiquitous systems. This abstract presents the initial ideas concerning a quantitative analysis and evaluation of the evidence set forward in safety cases that support and eventually lead to certification of embedded systems with large parts of software. A discussion about the current industrial practices, limitations and state of the art related to certification evidences is drafted, and ideas concerning how can evidences be improved in terms of completeness, coherency, correctness, coverage, etc, as well as how can a quantitative analysis of the certification process be derived, are introduced for discussion and feedback. Current practices are not perfect, not properly applied, or applied in very different ways, presenting limitations, flaws and simplifications that put jeopardize systems safety, this is why we intend to initiate this research work.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124323123","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688875
Arbi Ghazarian
A collection of slides from the author's conference presentation is given. The following topics are discussed: functional requirement; software defect; software specification; and software requirement.
本文给出了作者在会议上演讲的幻灯片集。讨论了以下主题:功能需求;软件缺陷;软件规范;以及软件需求。
{"title":"Detection of missing requirements using base requirements pairs","authors":"Arbi Ghazarian","doi":"10.1109/ISSREW.2013.6688875","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688875","url":null,"abstract":"A collection of slides from the author's conference presentation is given. The following topics are discussed: functional requirement; software defect; software specification; and software requirement.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115817045","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688848
Jianwen Xiang, F. Machida, Kumiko Tadano, Y. Maeno
In traditional imperfect fault coverage models, simply coverage models (CMs), the coverage (including identification and isolation) is typically limited to the faulty components regardless of their relevance. The relevance is typically defined in the context of perfect fault coverage, and a component is called irrelevant if its (covered) failure does not affect the system state, otherwise it is relevant. Although it is generally assumed that all components are initially relevant in these models, such an assumption does not consider the fact that an initially relevant component could become irrelevant afterwards due to the failures of other components, and we call it a non-persistent component. A system with only persistent components is called persistent, otherwise it is called non-persistent. For a non-persistent system, it is important to cover (identify and isolate) the non-persistent components in time whenever they become irrelevant, such that their future uncovered failures will not affect the system anymore. This paper formalizes the concept of persistence and analyzes its impact on reliability of the systems subjected to imperfect fault coverage. It is demonstrated that with the coverage of irrelevant components (in addition to the faulty components), the reliability of a non-persistent system can be (significantly) improved without increasing redundancy.
{"title":"Persistence of relevance: A missing issue in imperfect coverage models","authors":"Jianwen Xiang, F. Machida, Kumiko Tadano, Y. Maeno","doi":"10.1109/ISSREW.2013.6688848","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688848","url":null,"abstract":"In traditional imperfect fault coverage models, simply coverage models (CMs), the coverage (including identification and isolation) is typically limited to the faulty components regardless of their relevance. The relevance is typically defined in the context of perfect fault coverage, and a component is called irrelevant if its (covered) failure does not affect the system state, otherwise it is relevant. Although it is generally assumed that all components are initially relevant in these models, such an assumption does not consider the fact that an initially relevant component could become irrelevant afterwards due to the failures of other components, and we call it a non-persistent component. A system with only persistent components is called persistent, otherwise it is called non-persistent. For a non-persistent system, it is important to cover (identify and isolate) the non-persistent components in time whenever they become irrelevant, such that their future uncovered failures will not affect the system anymore. This paper formalizes the concept of persistence and analyzes its impact on reliability of the systems subjected to imperfect fault coverage. It is demonstrated that with the coverage of irrelevant components (in addition to the faulty components), the reliability of a non-persistent system can be (significantly) improved without increasing redundancy.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128228351","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688897
Zhen Dong, M. Ghanavati, A. Andrzejak
Software configuration settings are an effective way to customize applications. However, inconsistencies or mistakes in option values can result in a system crash and need huge time and effort to diagnose. We present a technique to identify the root causes of configuration errors. It uses static program analysis to link the misconfiguration of an application to a specific configuration option. Our technique has two prominent characteristics compared to existing approaches: it relies only on static analysis, and it does not need profiles of the application with correct configuration. Based on the proposed techniques, we developed a tool called ConfDebugger. We evaluated its effectiveness on 8 configuration errors in the Java program JChord. ConfDebugger successfully diagnosed 7 out of 8 errors. For 5 of them, root cause was exactly pinpointed without a false positive, and in total, the average number of false positives was only 0.5. This is better than two state-of-the-art methods, with average numbers of false positives of 1.7 and 5.7, respectively.
{"title":"Automated diagnosis of software misconfigurations based on static analysis","authors":"Zhen Dong, M. Ghanavati, A. Andrzejak","doi":"10.1109/ISSREW.2013.6688897","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688897","url":null,"abstract":"Software configuration settings are an effective way to customize applications. However, inconsistencies or mistakes in option values can result in a system crash and need huge time and effort to diagnose. We present a technique to identify the root causes of configuration errors. It uses static program analysis to link the misconfiguration of an application to a specific configuration option. Our technique has two prominent characteristics compared to existing approaches: it relies only on static analysis, and it does not need profiles of the application with correct configuration. Based on the proposed techniques, we developed a tool called ConfDebugger. We evaluated its effectiveness on 8 configuration errors in the Java program JChord. ConfDebugger successfully diagnosed 7 out of 8 errors. For 5 of them, root cause was exactly pinpointed without a false positive, and in total, the average number of false positives was only 0.5. This is better than two state-of-the-art methods, with average numbers of false positives of 1.7 and 5.7, respectively.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133720241","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688923
Nuno Antunes, F. Brancati, A. Ceccarelli, A. Bondavalli, M. Vieira
One of the biggest verification and validation challenges is the definition of approaches and tools to support system assessment while minimizing costs and delivery time. This includes the integration of OTS software components in critical systems that must undergo proper certification or approval processes. In the particular case of testing, due to the differences and peculiarities of components, developers often build ad-hoc and poorly-reusable testing tools, which results in increased time and costs. This paper introduces a framework for testing and monitoring of critical OTS applications and services. The framework includes i) a box that is instrumented for monitoring OS and application level variables, ii) an adaptable toolset for testing the target components, and iii) tools for data storing, retrieval and analyzes. A prototype of the framework is under development, and future testing scenarios are designed to show the applicability and effectiveness of the framework.
{"title":"A monitoring and testing framework for critical off-the-shelf applications and services","authors":"Nuno Antunes, F. Brancati, A. Ceccarelli, A. Bondavalli, M. Vieira","doi":"10.1109/ISSREW.2013.6688923","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688923","url":null,"abstract":"One of the biggest verification and validation challenges is the definition of approaches and tools to support system assessment while minimizing costs and delivery time. This includes the integration of OTS software components in critical systems that must undergo proper certification or approval processes. In the particular case of testing, due to the differences and peculiarities of components, developers often build ad-hoc and poorly-reusable testing tools, which results in increased time and costs. This paper introduces a framework for testing and monitoring of critical OTS applications and services. The framework includes i) a box that is instrumented for monitoring OS and application level variables, ii) an adaptable toolset for testing the target components, and iii) tools for data storing, retrieval and analyzes. A prototype of the framework is under development, and future testing scenarios are designed to show the applicability and effectiveness of the framework.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130270144","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688847
Ziying Dai, Xiaoguang Mao, Liqian Chen, Yan Lei, Yi Zhang
In contemporary software development practice, programmers reuse components by invoking their APIs to construct large systems. These APIs often involve constraints on the temporal order of method calls. For the example of the file usage, a programmer should first open a file, then read and/or write its content, and at last close it. Trying to read a closed file will cause exceptions to be thrown. Such constraints are often represented as a finite state machine (FSM) with a set of related events (typically method calls) as its alphabet. A set of events are related if interactions among them possibly obey some meaningful temporal specifications. In recent years, various specification mining techniques have been developed to automatically mine API specifications from API client programs [1]. A typical API specification miner conceptually has three steps. First, it decide which events are related. Second, different interactions among related events (which are sub-traces and sample strings of the specification FSM) are extracted either from source code of client programs or from their execution traces. Third, extracted interactions are passed to customized or off-the-shelf FSM learners which generalize these sample sub-traces to recover the specification FSM.
{"title":"Finding related events for specification mining","authors":"Ziying Dai, Xiaoguang Mao, Liqian Chen, Yan Lei, Yi Zhang","doi":"10.1109/ISSREW.2013.6688847","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688847","url":null,"abstract":"In contemporary software development practice, programmers reuse components by invoking their APIs to construct large systems. These APIs often involve constraints on the temporal order of method calls. For the example of the file usage, a programmer should first open a file, then read and/or write its content, and at last close it. Trying to read a closed file will cause exceptions to be thrown. Such constraints are often represented as a finite state machine (FSM) with a set of related events (typically method calls) as its alphabet. A set of events are related if interactions among them possibly obey some meaningful temporal specifications. In recent years, various specification mining techniques have been developed to automatically mine API specifications from API client programs [1]. A typical API specification miner conceptually has three steps. First, it decide which events are related. Second, different interactions among related events (which are sub-traces and sample strings of the specification FSM) are extracted either from source code of client programs or from their execution traces. Third, extracted interactions are passed to customized or off-the-shelf FSM learners which generalize these sample sub-traces to recover the specification FSM.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127789875","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 : 2013-12-19DOI: 10.1109/ISSREW.2013.6688851
T. Wandji, S. Sarkani, T. Eveleigh, T. Holzer, P. Keiller
Software failure remains an important cause of reported system outage. Yet, developing reliable software is still not well understood by the programmer, the Software Engineer and the Program manager. Software reliability growth models (SRGMs) provide a framework to analyze software failures by using past failure data to predict the reliability of the software. Most models that have been used have limitations in predicting accurately. There is a need to conduct research aimed at improving the performance of these models. To accurately predict reliability, the model's parameters should be estimated in such a way that the mathematical function of the model fits with the failure data. While the majority of previous software reliability studies have used classical methods to estimate model's parameters, a few other studies have used a Bayesian approach. Bayesian approaches allow the incorporation of prior information into models and they have been claimed to be more successful than classical approaches in certain situations. Our research goal is to investigate if the use of Bayesian methods improves the predictability of SRGMs by conducting a direct comparative analysis of Bayesian and classical approaches for software reliability assessment.
{"title":"Comparative analysis of Bayesian and classical approaches for software reliability measurement","authors":"T. Wandji, S. Sarkani, T. Eveleigh, T. Holzer, P. Keiller","doi":"10.1109/ISSREW.2013.6688851","DOIUrl":"https://doi.org/10.1109/ISSREW.2013.6688851","url":null,"abstract":"Software failure remains an important cause of reported system outage. Yet, developing reliable software is still not well understood by the programmer, the Software Engineer and the Program manager. Software reliability growth models (SRGMs) provide a framework to analyze software failures by using past failure data to predict the reliability of the software. Most models that have been used have limitations in predicting accurately. There is a need to conduct research aimed at improving the performance of these models. To accurately predict reliability, the model's parameters should be estimated in such a way that the mathematical function of the model fits with the failure data. While the majority of previous software reliability studies have used classical methods to estimate model's parameters, a few other studies have used a Bayesian approach. Bayesian approaches allow the incorporation of prior information into models and they have been claimed to be more successful than classical approaches in certain situations. Our research goal is to investigate if the use of Bayesian methods improves the predictability of SRGMs by conducting a direct comparative analysis of Bayesian and classical approaches for software reliability assessment.","PeriodicalId":332420,"journal":{"name":"2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116976056","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
扫码关注我们
求助内容：
应助结果提醒方式：