• DocumentCode
    2981778
  • Title

    Sole error locating array and approximate error locating array

  • Author

    Wujie Zhou ; Deping Zhang

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
  • fYear
    2012
  • fDate
    22-24 June 2012
  • Firstpage
    480
  • Lastpage
    483
  • Abstract
    Combinatorial interaction testing (CIT) is a method to detect the fault interactions among the parameters or components in a system. However the most works in the field of combinatorial interaction testing focus on detecting interaction faults rather than locating them. (d, t)-locating arrays and (d, t)-detecting arrays were proposed by C. J. Colbourn and D. W. McClary to locate and detect the interaction fault. In the paper, we study the structure of the special fault locating array that is able to locate sole interaction fault among the parameters or components, namely (1, t)-detecting arrays, and then propose the concept and construction method of approximate error locating array based on the special error locating array. The AETG-like algorithms to generate these special arrays are provided.
  • Keywords
    combinatorial mathematics; program testing; software fault tolerance; AETG-Iike algorithms; CIT; approximate error locating array; combinatorial interaction testing; concept method; construction method; detecting arrays; fault interactions detection; fault locating array; sole error locating array; sole interaction fault location; Arrays; Reliability; Testing; AETG-like algorithm; approximate error locating array; combinatorial interaction testing; covering array; error locating array;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4673-2007-8
  • Type

    conf

  • DOI
    10.1109/ICSESS.2012.6269509
  • Filename
    6269509