Navegar

Colección

Datos Estadísticas

Artículo

La versión final de este artículo es de uso interno de la institución.
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

A test coverage criterion defines a set Ec of entities of the program flowgraph and requires that every entity in this set is covered under some test case. Coverage criteria are also used to measure the adequacy of the executed test cases. In this paper, we introduce the notion of spanning sets of entitles for coverage testing. A spanning set is a minimum subset of E c, such that a test suite covering the entities in this subset is guaranteed to cover every entity in Ec. When the coverage of an entity always guarantees the coverage of another entity, the former is said to subsume the latter. Based on the subsumption relation between entities, we provide a generic algorithm to find spanning sets for control flow and data flow-based test coverage criteria. We suggest several useful applications of spanning sets: They help reduce and estimate the number of test cases needed to satisfy coverage criteria. We also empirically investigate how the use of spanning sets affects the fault detection effectiveness.

Registro:

Documento: Artículo
Título:Using Spanning Sets for Coverage Testing
Autor:Marré, M.; Bertolino, A.
Filiación:Departamento de Computacion, FCEyN, Universidad de Buenos Aires, Argentina
Ist. Sci./Tecnol. Info. A. Faedo, Area della Ricerca CNR di Pisa, 56100 Pisa, Italy
Palabras clave:Control flow; Coverage criteria; Data flow; Ddgraph; Spanning sets; Subsumption; Data flow analysis; Fault tolerant computer systems; Flowcharting; Heuristic methods; Optimal systems; Random processes; Set theory; Fault detection; Spanning sets; Software engineering
Año:2003
Volumen:29
Número:11
Página de inicio:974
Página de fin:984
DOI: http://dx.doi.org/10.1109/TSE.2003.1245299
Título revista:IEEE Transactions on Software Engineering
Título revista abreviado:IEEE Trans Software Eng
ISSN:00985589
CODEN:IESED
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00985589_v29_n11_p974_Marre

Referencias:

  • Agrawal, H., Dominators, Super Blocks, and Program Coverage (1994) Proc. Principles of Programming Languages (POPL '94), pp. 25-34. , Jan
  • Aho, A.V., Hopcroft, J.E., Ullman, J.D., (1974) The Design and Analysis of Computer Algorithms, , Addison-Wesley
  • (2003) Aristotle Analysis System Download, , http://www.cc.gatech.edu/aristotle/Tools/dist.html
  • Beck, K., (2002) Test Driven Development: By Example, , Addison-Wesley
  • Beizer, B., (1990) Software Testing Techniques, Second Edition, , New York: Van Nostrand Reinhold
  • Bertolino, A., Unconstrained Edges and Their Application to Branch Analysis and Testing of Programs (1993) The J. Systems and Software, 20 (2), pp. 125-133. , Feb
  • Bertolino, A., Marré, M., Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs (1994) IEEE Trans. Software Eng., 20 (12), pp. 885-899. , Dec
  • Bertolino, A., Marré, M., A General Path Generation Algorithm for Coverage Testing (1997) Proc. Int'l Quality Week, , May
  • Bertolino, A., Marré, M., How Many Paths Are Needed for Branch Testing? (1996) The J. Systems and Software, 35 (2), pp. 95-106. , Nov
  • Bertolino, A., Mirandola, R., Peciola, E., A Case Study in Branch Testing Automation (1997) The J. Systems and Software, 38 (1), pp. 47-59. , July
  • Chusho, T., Test Data Selection and Quality Estimation Based on the Concept of Essential Branches for Path Testing (1987) IEEE Trans. Software Eng., 13 (5), pp. 509-517. , May
  • Frankl, P.G., Weyuker, E.J., An Applicable Family of Data Flow Testing Criteria (1988) IEEE Trans. Software Eng., 14 (10), pp. 1483-1498. , Oct
  • Gupta, R., Soffa, M.L., Employing Static Information in the Generation of Test Cases (1993) Software Testing, Verification and Reliability, 3 (1), pp. 29-48
  • Harrold, M.J., Gupta, R., Soffa, M.L., Methodology for Controlling the Size of a Test Suite (1993) ACM Trans. Software Eng. and Methodology, 2 (3), pp. 270-285. , July
  • Hecht, M.S., (1977) Flow Analysis of Computer Programs, , New York: North Holland
  • Hutchins, M., Foster, H., Goradia, T., Ostrand, T., Experiments on the Effectiveness of Dataflow- and Controlflow-Based Test Adequacy Criteria (1994) Proc. 16th Int'l Conf. Software Eng. (ICSE 16), pp. 191-200
  • Lengauer, T., Tarjan, R.E., A Fast Algorithm for Finding nominators in a Flowgraph (1979) ACM Trans. Programming Languages and Systems, 1 (1), pp. 121-141
  • Marré, M., (1997) Program Flow Analysis for Reducing and Estimating the Cost of Test Coverage Criteria, , PhD Thesis, Dept. Computer Science, FCEyN, Univ. de Buenos Aires
  • Marré, M., Bertolino, A., Unconstrained Duas and Their Use in Achieving All-uses Coverage (1996) ACM Proc. Int'l Symp. Software Testing and Analysis (ISSTA 96), pp. 147-157. , Jan
  • Marré, M., Bertolino, A., Reducing and Estimating the Cost of Test Coverage Criteria (1996) Proc. 18th Int'l Conf. Software Eng. (ICSE 18), pp. 486-494. , Mar
  • Rapps, S., Weyuker, E.J., Selecting Software Test Data Using Data Flow Information (1985) IEEE Trans. Software Eng., 11 (4), pp. 367-375. , Apr
  • Rothermel, G., Harrold, M.J., Ostrin, J., Hong, C., Empirical Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites (1998) Proc. Int'l Conf. Software Maintenance, pp. 34-43. , Nov
  • Wong, W.E., (1993) On Mutation and Data Flow, A Thesis, , PhD Thesis, SERC-TR-149-P, Software Eng. Research Center, Purdue Univ., Dec
  • Wong, W.E., Horgan, J.R., London, S., Mathur, A.P., Effect of Test Set Minimization on Fault Detection Effectiveness (1995) Proc. 17th Int'l Conf. Software Eng. (ICSE 17), pp. 41-50. , Apr
  • Wonnacott, T.H., Wonnacott, R.J., (1990) Introductory Statistics, Fifth Ed., , Wiley

Citas:

---------- APA ----------
Marré, M. & Bertolino, A. (2003) . Using Spanning Sets for Coverage Testing. IEEE Transactions on Software Engineering, 29(11), 974-984.
http://dx.doi.org/10.1109/TSE.2003.1245299
---------- CHICAGO ----------
Marré, M., Bertolino, A. "Using Spanning Sets for Coverage Testing" . IEEE Transactions on Software Engineering 29, no. 11 (2003) : 974-984.
http://dx.doi.org/10.1109/TSE.2003.1245299
---------- MLA ----------
Marré, M., Bertolino, A. "Using Spanning Sets for Coverage Testing" . IEEE Transactions on Software Engineering, vol. 29, no. 11, 2003, pp. 974-984.
http://dx.doi.org/10.1109/TSE.2003.1245299
---------- VANCOUVER ----------
Marré, M., Bertolino, A. Using Spanning Sets for Coverage Testing. IEEE Trans Software Eng. 2003;29(11):974-984.
http://dx.doi.org/10.1109/TSE.2003.1245299