Navegar

Colección

Datos Estadísticas

Conferencia

Marré, M.; Bertolino, A.; Tracz W.; Zeil S.J.; ACM Special Interest Group on Software Engineering (SIGSOFT) "Unconstrained duals and their use in achieving all-uses coverage" (1996) 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996:147-157
Estamos trabajando para incorporar este artículo al repositorio
Consulte el artículo en la página del editor

Abstract:

Testing takes a considerable amount of the time and resources spent on producing software. It would therefore be useful to have ways 1) to reduce the cost of testing and 2) to estimate this cost. In particular, the number of tests to be executed is an important and useful attribute of the entity "testing effort". All-uses coverage is a data flow testing strategy widely researched in recent years. In this paper we present spanning sets of duas for the all-uses coverage criterion. A spanning set of duas is a minimum set of duas (definition-use associations) such that a set of test paths covering them covers every dua in the program. We give a method to find a spanning set of duas using the relation of subsumption between duas. Intuitively, there exists a natural ordering between the duas in a program: some duas are covered more easily than others, since coverage of the former is automatically guaranteed whenever the latter are covered. Those duas that are the most difficult to be covered according to this ordering are called unconstrained. A spanning set of duas is composed of unconstrained duas. Our results are useful for reducing the cost of testing, since the generation of test paths can be targeted to cover the smaller spanning set of duas, rather than all those in a program. On the other hand, assuming that a different path is taken to cover each dua in a spanning set, the cardinality of spanning sets can be used to estimate the cost of testing. Other interesting uses of spanning sets of duas are also discussed. © 1996 ACM.

Registro:

Documento: Conferencia
Título:Unconstrained duals and their use in achieving all-uses coverage
Autor:Marré, M.; Bertolino, A.; Tracz W.; Zeil S.J.; ACM Special Interest Group on Software Engineering (SIGSOFT)
Filiación:Departamento de Computación, FCEyN, Universidad de Buenos Aires, Pabelloń I, Buenos Aires, 1428, Argentina
Istituto di Elaborazione Dells Informazione, CNR, Piss, Italy
Palabras clave:Cost benefit analysis; Cost estimating; Cost reduction; Costs; Cardinalities; Coverage criteria; Data-flow testing; Spanning sets; Testing effort; Software testing
Año:1996
Página de inicio:147
Página de fin:157
DOI: http://dx.doi.org/10.1145/229000.226312
Título revista:1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996
Título revista abreviado:Proc. ACM SIGSOFT Int. Symp. Softw. Test. Anal., ISSTA
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_08979178_v_n_p147_Marre

Referencias:

  • Beizer, B., (1990) Software Testing Techniques, Second Edition, , Van Nostrand Reinhold New York
  • Berge, C., (1973) Graphs and Hypergraphs, , North-Holland New York
  • Bertolino, A., Mart, M., How many paths are needed for branch testing9 (1996) The Journal of Systems and Software, , To appear
  • Bertolino, A., Marr, M., Automatic generation of path covers based on the control flow analysis of computer programs (1994) IEEE Trans. on Software Engineering, SE-20 (12), pp. 885-899. , December
  • Bertolino, A., Mirandola, R., Peciola, E., A case study in branch testing automation Proc. of the 3rd Int. Conf. on Achieving Quality in Software (.4 QulS'96, , To appear
  • Frankl, P.G., Weiss, S.N., An experimental comparison of the effectiveness of branch testing and data flow testing (1993) IEEE Trans. on Software Engineering, 19 (8), pp. 774-787. , August
  • Frankl, P.G., Weyuker, E.J., An applicable family of data flow testing criteria (1988) IEEE Trans. on Software Engineering, 14 (10), pp. 1483-1498
  • Gupta, R., Sofia, 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., Sofia, M.L., A methodology for controlling the size of a test suite (1993) ACM Trans. on Software Engineering and Methodology, 2 (3), pp. 270-285. , July
  • Hecht, M.S., (1977) Flow Analysis of Computer Programs, , North Holland New York
  • Hutchins, M., Foster, H., Goradia, T., Ostrand, T., Experiments on the effectiveness of dataflowand controlflow-based test adequacy criteria (1994) Proc. 16th. Lnt. Conf. on Soft. Eng. (ICSE 9~, pp. 191-200
  • Korel, B., Automated software test data generation (1990) IEEE Trans. on Software Engineering, 16 (8), pp. 870-879
  • Lengauer, T., Tarjan, R.E., A fast algorithm for finding dominators in a flowgraph (1979) ACM Trans. on Programming Languages and Systems, 1 (1), pp. 121-141
  • Marri, M., (1996) Program Flow Analysis for Reducing and Estimating the Cost of Test Coverage Criteria, , PhD thesis, Dep. Computer Science, FCEyN, Universidad de Buenos Aires
  • Miller, E.F., Software testing technology: An overview (1984) Handbook of Software Engineering, , In C. R. Vick and C. V. Ramamoorthy, editors. Van Nostrand Reinhold, New York
  • Rapps, S., Weyuker, E.J., Selecting software test data using data flow information (1985) IEEE Trans. on Software Engineering, SE-11 (4), pp. 367-375. , April
  • Weyuker, E., The cost of data flow testing: An empirical study (1990) IEEE Trans. on Software Engineering, 16 (2), pp. 121-128
  • Weyuker, E.J., The complexity of data flow criteria for test data selection (1984) Information Processing Letters, 19 (2), pp. 103-109. , August
  • Wong, W.E., Horgan, J.R., London, S., Mathur, A.P., Effect of test set minimization on fault detection effectiveness (1995) Proc. of the 17th Int. Conf. on Software Engineering (ICSE 95, pp. 41-50. , April
  • Yates, D.F., Malevris, N., Reducing the effects of infeasible paths in branch testing ACM SIGSOFT Software Engineering Notes, 14, p. 8A4 - ACM Special Interest Group on Software Engineering (SIGSOFT)

Citas:

---------- APA ----------
Marré, M., Bertolino, A., Tracz W., Zeil S.J. & ACM Special Interest Group on Software Engineering (SIGSOFT) (1996) . Unconstrained duals and their use in achieving all-uses coverage. 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996, 147-157.
http://dx.doi.org/10.1145/229000.226312
---------- CHICAGO ----------
Marré, M., Bertolino, A., Tracz W., Zeil S.J., ACM Special Interest Group on Software Engineering (SIGSOFT) "Unconstrained duals and their use in achieving all-uses coverage" . 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996 (1996) : 147-157.
http://dx.doi.org/10.1145/229000.226312
---------- MLA ----------
Marré, M., Bertolino, A., Tracz W., Zeil S.J., ACM Special Interest Group on Software Engineering (SIGSOFT) "Unconstrained duals and their use in achieving all-uses coverage" . 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996, 1996, pp. 147-157.
http://dx.doi.org/10.1145/229000.226312
---------- VANCOUVER ----------
Marré, M., Bertolino, A., Tracz W., Zeil S.J., ACM Special Interest Group on Software Engineering (SIGSOFT) Unconstrained duals and their use in achieving all-uses coverage. Proc. ACM SIGSOFT Int. Symp. Softw. Test. Anal., ISSTA. 1996:147-157.
http://dx.doi.org/10.1145/229000.226312