Testability transformation - program transformation to improve testability

M. Harman, A. Baresel, D. Binkley, R. M. Hierons, L. Hu, B. Korel, P. McMinn, M. Roper

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

16 Citations (Scopus)

Abstract

Testability transformation is a new form of program transformation in which the goal is not to preserve the standard semantics of the program, but to preserve test sets that are adequate with respect to some chosen test adequacy criterion. The goal is to improve the testing process by transforming a program to one that is more amenable to testing while remaining within the same equivalence class of programs defined by the adequacy criterion. The approach to testing and the adequacy criterion are parameters to the overall approach. The transformations required are typically neither more abstract nor are they more concrete than standard “meaning preserving transformations”. This leads to interesting theoretical questions. but also has interesting practical implications. This chapter provides an introduction to testability transformation and a brief survey of existing results.
LanguageEnglish
Title of host publicationFormal Methods and Testing
Subtitle of host publicationAn Outcome of the FORTEST Network, Revised Selected Papers
EditorsRobert M. Hierons, Jonathan P. Bowen, Mark Harman
PublisherSpringer
Pages320-344
Number of pages25
ISBN (Print)978-3-540-78916-1
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume4949
ISSN (Print)0302-9743

Fingerprint

Testing
Equivalence classes
Semantics
Concretes

Keywords

  • testing
  • testability
  • programming

Cite this

Harman, M., Baresel, A., Binkley, D., Hierons, R. M., Hu, L., Korel, B., ... Roper, M. (2008). Testability transformation - program transformation to improve testability. In R. M. Hierons, J. P. Bowen, & M. Harman (Eds.), Formal Methods and Testing: An Outcome of the FORTEST Network, Revised Selected Papers (pp. 320-344). (Lecture Notes in Computer Science; Vol. 4949). Springer. https://doi.org/10.1007/978-3-540-78917-8_11
Harman, M. ; Baresel, A. ; Binkley, D. ; Hierons, R. M. ; Hu, L. ; Korel, B. ; McMinn, P. ; Roper, M. / Testability transformation - program transformation to improve testability. Formal Methods and Testing: An Outcome of the FORTEST Network, Revised Selected Papers. editor / Robert M. Hierons ; Jonathan P. Bowen ; Mark Harman. Springer, 2008. pp. 320-344 (Lecture Notes in Computer Science).
@inproceedings{4dd6449807f3400893ee41c14f283373,
title = "Testability transformation - program transformation to improve testability",
abstract = "Testability transformation is a new form of program transformation in which the goal is not to preserve the standard semantics of the program, but to preserve test sets that are adequate with respect to some chosen test adequacy criterion. The goal is to improve the testing process by transforming a program to one that is more amenable to testing while remaining within the same equivalence class of programs defined by the adequacy criterion. The approach to testing and the adequacy criterion are parameters to the overall approach. The transformations required are typically neither more abstract nor are they more concrete than standard “meaning preserving transformations”. This leads to interesting theoretical questions. but also has interesting practical implications. This chapter provides an introduction to testability transformation and a brief survey of existing results.",
keywords = "testing , testability, programming",
author = "M. Harman and A. Baresel and D. Binkley and Hierons, {R. M.} and L. Hu and B. Korel and P. McMinn and M. Roper",
year = "2008",
doi = "10.1007/978-3-540-78917-8_11",
language = "English",
isbn = "978-3-540-78916-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "320--344",
editor = "Hierons, {Robert M.} and Bowen, {Jonathan P.} and Mark Harman",
booktitle = "Formal Methods and Testing",

}

Harman, M, Baresel, A, Binkley, D, Hierons, RM, Hu, L, Korel, B, McMinn, P & Roper, M 2008, Testability transformation - program transformation to improve testability. in RM Hierons, JP Bowen & M Harman (eds), Formal Methods and Testing: An Outcome of the FORTEST Network, Revised Selected Papers. Lecture Notes in Computer Science, vol. 4949, Springer, pp. 320-344. https://doi.org/10.1007/978-3-540-78917-8_11

Testability transformation - program transformation to improve testability. / Harman, M.; Baresel, A.; Binkley, D.; Hierons, R. M.; Hu, L.; Korel, B.; McMinn, P.; Roper, M.

Formal Methods and Testing: An Outcome of the FORTEST Network, Revised Selected Papers. ed. / Robert M. Hierons; Jonathan P. Bowen; Mark Harman. Springer, 2008. p. 320-344 (Lecture Notes in Computer Science; Vol. 4949).

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Testability transformation - program transformation to improve testability

AU - Harman, M.

AU - Baresel, A.

AU - Binkley, D.

AU - Hierons, R. M.

AU - Hu, L.

AU - Korel, B.

AU - McMinn, P.

AU - Roper, M.

PY - 2008

Y1 - 2008

N2 - Testability transformation is a new form of program transformation in which the goal is not to preserve the standard semantics of the program, but to preserve test sets that are adequate with respect to some chosen test adequacy criterion. The goal is to improve the testing process by transforming a program to one that is more amenable to testing while remaining within the same equivalence class of programs defined by the adequacy criterion. The approach to testing and the adequacy criterion are parameters to the overall approach. The transformations required are typically neither more abstract nor are they more concrete than standard “meaning preserving transformations”. This leads to interesting theoretical questions. but also has interesting practical implications. This chapter provides an introduction to testability transformation and a brief survey of existing results.

AB - Testability transformation is a new form of program transformation in which the goal is not to preserve the standard semantics of the program, but to preserve test sets that are adequate with respect to some chosen test adequacy criterion. The goal is to improve the testing process by transforming a program to one that is more amenable to testing while remaining within the same equivalence class of programs defined by the adequacy criterion. The approach to testing and the adequacy criterion are parameters to the overall approach. The transformations required are typically neither more abstract nor are they more concrete than standard “meaning preserving transformations”. This leads to interesting theoretical questions. but also has interesting practical implications. This chapter provides an introduction to testability transformation and a brief survey of existing results.

KW - testing

KW - testability

KW - programming

U2 - 10.1007/978-3-540-78917-8_11

DO - 10.1007/978-3-540-78917-8_11

M3 - Conference contribution book

SN - 978-3-540-78916-1

T3 - Lecture Notes in Computer Science

SP - 320

EP - 344

BT - Formal Methods and Testing

A2 - Hierons, Robert M.

A2 - Bowen, Jonathan P.

A2 - Harman, Mark

PB - Springer

ER -

Harman M, Baresel A, Binkley D, Hierons RM, Hu L, Korel B et al. Testability transformation - program transformation to improve testability. In Hierons RM, Bowen JP, Harman M, editors, Formal Methods and Testing: An Outcome of the FORTEST Network, Revised Selected Papers. Springer. 2008. p. 320-344. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-540-78917-8_11