• DocumentCode
    3334030
  • Title

    Deriving compact test suites for telecommunication software using distance metrics

  • Author

    Kovács, Gábor ; Németh, Gábor Árpád ; Pap, Zoltán ; Subramaniam, Mahadevan

  • Author_Institution
    Dept. of Telecommun. & Media Inf., Budapest Univ. of Technol. & Econ., Budapest
  • fYear
    2008
  • fDate
    25-27 Sept. 2008
  • Firstpage
    394
  • Lastpage
    398
  • Abstract
    This paper proposes a string edit distance based test selection method to generate compact test sets for telecommunications software. Following the results of previous research, a trace in a test set is considered to be redundant if its edit distance from others is less than a given parameter. The algorithm first determines the minimum cardinality of the target test set in accordance with the provided parameter, then it selects the test set with the highest sum of internal edit distances. The selection problem is reduced to an assignment problem in bipartite graphs.
  • Keywords
    graph theory; telecommunication computing; telecommunication network management; bipartite graphs; distance metrics; string edit distance; telecommunication software; Automata; Automatic testing; Bipartite graph; Communication industry; Computer industry; Computer science; Informatics; Programming; Redundancy; Software testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software, Telecommunications and Computer Networks, 2008. SoftCOM 2008. 16th International Conference on
  • Conference_Location
    Split
  • Print_ISBN
    978-953-6114-97-9
  • Electronic_ISBN
    978-953-290-009-5
  • Type

    conf

  • DOI
    10.1109/SOFTCOM.2008.4669517
  • Filename
    4669517