Formulation of the Interaction Test Coverage Problem as an Integer Program

  • Alan W. Williams
  • Robert L. Probert
Chapter
Part of the IFIP — The International Federation for Information Processing book series (IFIPAICT, volume 82)

Abstract

A trend in software development is to assemble a system from a number of components. In many cases, the system is expected to function for multiple configurations of interchangeable components, leading to the problem of determining a set of system test configurations to fit a reasonable budget. One approach is to test all configurations that cover, for example, all two-way interactions. We investigate the feasibility of using an integer programming approach to solve the interaction test coverage problem exactly. We also examine the formulation to see if it provides insight into the NP-completeness of the interaction problem.

Key words

Interactions components coverage system testing 
Download to read the full chapter text

References

  1. Beizer, B. Software Testing Techniques, Second Edition, Van. Nostrand Reinhold, New York NY USA, 1990.MATHGoogle Scholar
  2. Berkelaar, M., “Ip_solve,” version 3.0. Linear programming solver developed at Eindhoven University, available at ftp://ftp.ics.ele.tue.nl/pub/lp_solve
  3. Brownlie, R., Prowse, J., and Phadke, M.S. Robust Testing of ATandT PMX/StarMail using OATS. ATandT Technical Journal 71, 3 (May/June 1992 ), 41–47.Google Scholar
  4. Burroughs, K., Jain, A., and Erickson, R.L. Improved Quality of Protocol Testing Through Techniques of Experimental Design. In Proceedings of Supercomm/ICC ‘84,(1994), 745752.Google Scholar
  5. Cohen, D.M., Dalal, S.R., Fredman, M.L., and Patton, G.C. The AETG System: An Approach to Testing Based on Combinatorial Design. IEEE Transactions on Software Engineering, 23, 7 (July 1997), 437–444.CrossRefGoogle Scholar
  6. Cohen, D.M., Dalal, S.R., Parelius, J., and Patton, G.C. The Combinatorial Approach to Automatic Test Generation. IEEE Software 13, 5 (Sept. 1996), 83–88.CrossRefGoogle Scholar
  7. Crescenzi, P., Kann, V., editors. A compendium of NP-complete problems. On-line at http://www.f.kth.se/-viggo/problemlist/compendium.html
  8. Dunietz, I.S., Ehrlich, W.K., Szablak, B.D., Mallows, C.L., and Iannino, A. Applying Design of Experiments to Software Testing. In Proceedings of the 19 th International Conference on Software Engineering (ICSE ‘87), (Boston MA USA, 1997 ), 205–215.Google Scholar
  9. Karpinski, M. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. In Proceedings of the 1st Symposium on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1269, Springer-Verlag, 1997, 1–14.Google Scholar
  10. Karpinski, M. and Zelikovsky, A. Approximating Dense Cases of Covering Problems. ECCC Technical Report TR97–004. On-line at ftp://eccc.uni-trier.de/pub/eccc/reports/1997/TR97–004/index.html.
  11. Perkinson, W.B. A Methodology for Designing and Executing ISDN Feature Tests Using Automated Test Systems. In Proc. of IEEE GLOBECOMM ‘82, (1992).Google Scholar
  12. Ryu, J., Kim, M., Kang S., and Seol, S. Interoperability Test Suite Generation for the TCP Data Part Using Experimental Design Techniques. In Proceedings of the 13th International Conference on the Testing of Communicating Systems (Testcom 2000), (Ottawa ON Canada, 2000 ), 127–142.Google Scholar
  13. Stevens, B. and Mendelsohn, E. Efficient Software Testing Protocols. In Proceedings of the 8` h IBM Centre for Advanced Studies Conference (CASCON ‘88), (Toronto ON, 1998 ), 279–293.Google Scholar
  14. Williams, A.W., and Probert, R.L. A Practical Strategy for Testing pair-wise Coverage of Network Interfaces. In Proceedings of the 7th International Conference on Software Reliability Engineering (ISSRE ‘86), (White Plains NY USA, 1996 ), 246–254.Google Scholar
  15. Williams, A.W. Determination of Test Configurations for Pair-Wise Interaction Coverage. In Proceedings of the 13th International Conference on the Testing of Communicating Systems (Testcom 2000), (Ottawa ON Canada, 2000 ), 59–74.Google Scholar
  16. Williams, A.W., and Probert, R.L. A Measure of Component Interaction Test Coverage. In Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2001), (Beirut Lebanon, 2001 ), 304–311.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2002

Authors and Affiliations

  • Alan W. Williams
    • 1
  • Robert L. Probert
    • 1
  1. 1.School of Information Technology and EngineeringUniversity of OttawaCanada

Personalised recommendations