Brunel University Research Archive (BURA) >
Research Areas >
Information Systems and Computing >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/346

Title: Branch-coverage testability transformation for unstructured programs
Authors: Hierons, RM
Harman, M
Fox, CJ
Keywords: Branch coverage
Transformation
Testability
Exit statements
Publication Date: 2005
Citation: The Computer Journal, 48(4):421-436, 2005
Abstract: Test data generation by hand is a tedious, expensive and error-prone activity, yet testing is a vital part of the development process. Several techniques have been proposed to automate the generation of test data, but all of these are hindered by the presence of unstructured control flow. This paper addresses the problem using testability transformation. Testability transformation does not preserve the traditional meaning of the program, rather it deals with preserving test-adequate sets of input data. This requires new equivalence relations which, in turn, entail novel proof obligations. The paper illustrates this using the branch coverage adequacy criterion and develops a branch adequacy equivalence relation and a testability transformation for restructuring. It then presents a proof that the transformation preserves branch adequacy.
URI: http://dx.doi.org/10.1093/comjnl/bxh093
http://comjnl.oxfordjournals.org/cgi/content/abstract/48/4/421
http://bura.brunel.ac.uk/handle/2438/346
Appears in Collections:B-SERC Research Papers
Information Systems and Computing
School of Information Systems, Computing and Mathematics Research Papers

Files in This Item:

File Description SizeFormat
Fulltext.pdf345.39 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan