• DocumentCode
    3002057
  • Title

    Refactoring Test Data Structures

  • Author

    Eros, L. ; Bozoki, F. ; Wu-Hen-Chang, A. ; Csopaki, Gy

  • Author_Institution
    Budapest Univ. of Technol. & Econ. of Telecommun. & Media Inf., Budapest
  • fYear
    2007
  • fDate
    13-15 June 2007
  • Firstpage
    123
  • Lastpage
    130
  • Abstract
    Testing is getting a more and more important phase of the development process. The sooner a problem is found in the product, the less expensive it is to correct it. Many tools have been developed for making the testing phase easier. In the beginning test sequences have a well-thought-out structure, but as the development goes on, they become less well-structured and redundant. Refactorisation [1] is a technique for decreasing this type of redundancy. In this article we are going to review a universal model which makes the refactorisation process easier. We´re also going to review a refactorisation algorithm that uses this data model.
  • Keywords
    data models; program testing; data model; development process; refactorisation technique; test data structure; Buildings; Data models; Data structures; Formal languages; Informatics; Java; Redundancy; System testing; Tree data structures; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Telecommunications, 2007. ConTel 2007. 9th International Conference on
  • Conference_Location
    Zagreb
  • Print_ISBN
    953-184-111-X
  • Electronic_ISBN
    953-184-111-X
  • Type

    conf

  • DOI
    10.1109/CONTEL.2007.381860
  • Filename
    4267486