By Topic

2010 IEEE 21st International Symposium on Software Reliability Engineering

Date 1-4 Nov. 2010

Filter Results

Displaying Results 1 - 25 of 55
  • [Front cover]

    Publication Year: 2010, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (983 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2010, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (63 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2010, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2010, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (155 KB)
    Freely Available from IEEE
  • Message from General Chair and Program Committee Chair

    Publication Year: 2010, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (84 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2010, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2010, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Steering Committee

    Publication Year: 2010, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • Industry Committee

    Publication Year: 2010, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2010, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (65 KB)
    Freely Available from IEEE
  • Improving the Precision of Dependence-Based Defect Mining by Supervised Learning of Rule and Violation Graphs

    Publication Year: 2010, Page(s):1 - 10
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (673 KB) | HTML iconHTML

    Previous work has shown that application of graph mining techniques to system dependence graphs improves the precision of automatic defect discovery by revealing subgraphs corresponding to implicit programming rules and to rule violations. However, developers must still confirm, edit, or discard reported rules and violations, which is both costly and error-prone. In order to reduce developer effor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing the Number of Calls Dropped Due to Failures

    Publication Year: 2010, Page(s):11 - 20
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (515 KB) | HTML iconHTML

    Defects per million (DPM), defined as the number of calls out of a million dropped due to failures, is an important service (un)reliability measure for telecommunication systems. Most previous research derives the DPM from steady-state system availability model. In this paper, we develop a novel method for DPM computation which takes into consideration not only system availability, but also the im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Propagating Bug Fixes with Fast Subgraph Matching

    Publication Year: 2010, Page(s):21 - 30
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    We present a powerful and efficient approach to the problem of propagating a bug fix to all the locations in a code base to which it applies. Our approach represents bug and fix patterns as subgraphs of a system dependence graph, and it employs a fast, index-based subgraph matching algorithm to discover unfixed bug-pattern instances remaining in a code base. We have also developed a graphical tool... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multi-factor Software Reliability Model Based on Logistic Regression

    Publication Year: 2010, Page(s):31 - 40
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    This paper proposes a multi-factor software reliability model based on logistic regression and its effective statistical parameter estimation method. The proposed parameter estimation algorithm is composed of the algorithm used in the logistic regression and the EM (expectation-maximization) algorithm for discrete-time software reliability models. The multi-factor model deals with the metrics obse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assessing Asymmetric Fault-Tolerant Software

    Publication Year: 2010, Page(s):41 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    The most popular forms of fault tolerance against design faults use "asymmetric" architectures in which a "primary" part performs the computation and a "secondary" part is in charge of detecting errors and performing some kind of error processing and recovery. In contrast, the most studied forms of software fault tolerance are "symmetric" ones, e.g. N-version programming. The latter are often cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible, Any-Time Fault Tree Analysis with Component Logic Models

    Publication Year: 2010, Page(s):51 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1363 KB) | HTML iconHTML

    This article presents a novel approach to facilitating fault tree analysis during the development of software-controlled systems. Based on a component-oriented system model, it combines second-order probabilistic analysis and automatically generated default failure models with a level-of-detail concept to ensure early and continuous analysability of system failure behaviour with optimal effort, ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Errors on Space Software Requirements: A Field Study and Application Scenarios

    Publication Year: 2010, Page(s):61 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    This paper presents a field study on real errors found in space software requirements documents. The goal is to understand and characterize the most frequent types of requirement problems in this critical application domain. To classify the software requirement errors analyzed we initially used a well-known existing taxonomy that was later extended in order to allow a more thorough analysis. The r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Aging Analysis of the Linux Operating System

    Publication Year: 2010, Page(s):71 - 80
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (967 KB) | HTML iconHTML

    Software systems running continuously for a long time tend to show degrading performance and an increasing failure occurrence rate, due to error conditions that accrue over time and eventually lead the system to failure. This phenomenon is usually referred to as Software Aging. Several long-running mission and safety critical applications have been reported to experience catastrophic aging-related... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating the Use of Requirement Error Abstraction and Classification Method for Preventing Errors during Artifact Creation: A Feasibility Study

    Publication Year: 2010, Page(s):81 - 90
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (678 KB) | HTML iconHTML

    Defect prevention techniques can be used during the creation of software artifacts to help developers create high-quality artifacts. These artifacts should have fewer faults that must be removed during inspection and testing. The Requirement Error Taxonomy that we have developed helps focus developers' attention on common errors that can occur during requirements engineering. Our claim is that, by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • As-If Infinitely Ranged Integer Model

    Publication Year: 2010, Page(s):91 - 100
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    Integers represent a growing and underestimated source of vulnerabilities in C and C++ programs. This paper presents the As-if Infinitely Ranged (AIR) Integer model for eliminating vulnerabilities resulting from integer overflow, truncation, and unanticipated wrapping. The AIR Integer model either produces a value equivalent to that obtained using infinitely ranged integers or results in a runtime... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a Bayesian Approach in Modeling the Disclosure of Unique Security Faults in Open Source Projects

    Publication Year: 2010, Page(s):101 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB) | HTML iconHTML

    Software security has both an objective and a subjective component. A lot of the information available about that today is focused on the security vulnerabilities and their disclosure. It is less frequent that security breaches and failures rates are reported, even in open source projects. Disclosure of security problems can take several forms. A disclosure can be accompanied by a release of the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security Trend Analysis with CVE Topic Models

    Publication Year: 2010, Page(s):111 - 120
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    We study the vulnerability reports in the Common Vulnerability and Exposures (CVE) database by using topic models on their description texts to find prevalent vulnerability types and new trends semi-automatically. In our study of the 39,393 unique CVEs until the end of 2009, we identify the following trends, given here in the form of a weather forecast: PHP: declining, with occasional SQL injectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Mutation Test Case Generation via Dynamic Symbolic Execution

    Publication Year: 2010, Page(s):121 - 130
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    The automatic test case generation is the principal issue of the software testing activity. Dynamic symbolic execution appears to be a promising approach to this matter as it has been shown to be quite powerful in producing the sought tests. Despite its power, it has only been effectively applied to the entry level criteria of the structural criteria hierarchy such as branch testing. In this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint-Based Test Input Generation for Java Bytecode

    Publication Year: 2010, Page(s):131 - 140
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB) | HTML iconHTML

    In this paper, we introduce a constraint-based reasoning approach to automatically generate test input for Java bytecode programs. Our goal-oriented method aims at building an input state of the Java Virtual Machine (JVM) that can drive program execution towards a given location within the bytecode. An innovative aspect of the method is the definition of a constraint model for each bytecode that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.