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.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35497-2_31
Chapter PDF
Similar content being viewed by others
References
Beizer, B. Software Testing Techniques, Second Edition, Van. Nostrand Reinhold, New York NY USA, 1990.
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
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.
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.
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.
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.
Crescenzi, P., Kann, V., editors. A compendium of NP-complete problems. On-line at http://www.f.kth.se/-viggo/problemlist/compendium.html
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.
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.
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.
Perkinson, W.B. A Methodology for Designing and Executing ISDN Feature Tests Using Automated Test Systems. In Proc. of IEEE GLOBECOMM ‘82, (1992).
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Williams, A.W., Probert, R.L. (2002). Formulation of the Interaction Test Coverage Problem as an Integer Program. In: Schieferdecker, I., König, H., Wolisz, A. (eds) Testing of Communicating Systems XIV. IFIP — The International Federation for Information Processing, vol 82. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35497-2_21
Download citation
DOI: https://doi.org/10.1007/978-0-387-35497-2_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6705-6
Online ISBN: 978-0-387-35497-2
eBook Packages: Springer Book Archive