Branch-Coverage Testability Transformation for Unstructured Programs

نویسندگان

  • Robert M. Hierons
  • Mark Harman
  • Chris Fox
چکیده

Generating test data 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 is concerned with preserving the test adequacy of sets of input data. This requires new equivalence relations, which, in turn, entails 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 is branch adequacy preserving.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divide-by-Zero Exception Raising via Branch Coverage

In this paper, we discuss how a search-based branch coverage approach can be used to design an effective test data generation approach, specifically targeting divide-by-zero exceptions. We first propose a novel testability transformation combining approach level and branch distance. We then use different search strategies, i.e., hill climbing, simulated annealing, and genetic algorithm, to eval...

متن کامل

How Testable are BDI Agents?: An Analysis of Branch Coverage (Extended Abstract)

In this paper we extend our understanding of the feasibility of testing BDI agent programs by analysing their testability with respect to the all edges test adequacy criterion, and comparing with previous work that considered the all paths criterion. Our findings extend the earlier analysis with respect to the all paths criterion to give a more nuanced understanding of the difficulty of testing...

متن کامل

Testability Transformation for Efficient Automated Test Data Search in the Presence of Nesting

The application of metaheuristic search techniques to the automatic generation of software test data has been shown to be an effective approach for a variety of testing criteria. However, for structural testing, the dependence of a target structure on nested decision statements can cause efficiency problems for the search, and failure in severe cases. This is because all information useful for ...

متن کامل

Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs

This paper studies the structural testing of Erlang applications. A program transformation is proposed that represents the program under test as a binary tree. The challenge of achieving structural coverage can thus be interpreted as a tree-search procedure. We have developed a testing-technique that takes advantage of this tree-structure, which we demonstrate with respect to a small case study...

متن کامل

A STAFAN-like functional testability measure for register-level circuits

STAFAN (Statistical Fault Analysis) is a well known testability analysis program which predicts the fault coverage of a digital circuit under the stuck-at fault model, without actually performing fault simulation. STAFAN offers speed advantage over other testability analysis programs such as SCOAP; further, it explicitly predicts the fault coverage for a given test set, unlike other testability...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. J.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2005