Skip to main content

Interaction Coverage Meets Path Coverage by SMT Constraint Solving

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 5826)

Abstract

We present a novel approach for generating interaction combinations based on SMT constraint resolution. Our approach can generate maximal interaction coverage in the presence of general constraints as supported by the underlying solver. It supports seeding with general predicates, which allows us to combine it with path exploration such that both interaction and path coverage goals can be met. Our approach is motivated by the application to behavioral model-based testing in the Spec Explorer tool, where parameter combinations must be generated such that all path conditions of a model action have at least one combination which enables the path. It is applied in a large-scale project for model-based quality assurance of interoperability documentation at Microsoft.

Keywords

  • General Constraint
  • Path Condition
  • Symbolic Execution
  • Constraint Resolution
  • Path Coverage

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Calvagna, A., Gargantini, A.: A logic-based approach to combinatorial testing with constraints. In: Beckert, B., Hähnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 66–83. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  2. Calvagna, A., Gargantini, A.: Using SRI SAL model checker for combinatorial tests generation in the presence of temporal constraints. In: Workshop on Automated Formal Methods (AFM), pp. 1–10 (2008)

    Google Scholar 

  3. Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 23(7), 437–444 (1997)

    CrossRef  Google Scholar 

  4. Cohen, M.B., Colbourn, C.J., Collofello, J.S., Gibbons, P.B., Mugridge, W.B.: Variable strength interaction testing of components. In: Proceedings of the International Computer Software and Applications Conference, pp. 413–418 (2003)

    Google Scholar 

  5. Cohen, M.B., Colbourn, C.J., Gibbons, P.B., Mugridge, W.B.: Constructing test suites for interaction testing. In: Proceedings of the International Conference on Software Engineering (ICSE), May 2003, pp. 38–48 (2003)

    Google Scholar 

  6. Cohen, M.B., Dwyer, M.B., Shi, J.: Interaction testing of highly-configurable systems in the presence of constraints. In: International Symposium on Software Testing and Analysis, July 2007, pp. 129–139 (2007)

    Google Scholar 

  7. Cohen, M.B., Dwyer, M.B., Shi, J.: Constructing interaction test suites for highly-configurable systems in the presence of constraints: A greedy approach. IEEE Transactions on Software Engineering 34(5), 633–650 (2008)

    CrossRef  Google Scholar 

  8. Czerwonka, J.: Pairwise testing in real world. In: Pacific Northwest Software Quality Conference, October 2006, pp. 419–430 (2006)

    Google Scholar 

  9. de Moura, L., Bjørner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  10. Grieskamp, W.: Multi-paradigmatic Model-Based Testing. In: Havelund, K., Núñez, M., Roşu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol. 4262, pp. 1–19. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  11. Grieskamp, W., Kicillof, N.: A schema language for coordinating construction and composition of partial behavior descriptions. In: Whittle, J., Geiger, L., Meisinger, M. (eds.) SCESM, pp. 59–66. ACM, New York (2006)

    CrossRef  Google Scholar 

  12. Grieskamp, W., Kicillof, N., MacDonald, D., Nandan, A., Stobie, K., Wurden, F.L.: Model-Based Quality Assurance of Windows Protocol Documentation. In: ICST, pp. 502–506. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  13. Grieskamp, W., Kicillof, N., Tillmann, N.: Action Machines: a Framework for Encoding and Composing Partial Behaviors. International Journal of Software Engineering and Knowledge Engineering 16(5), 705–726 (2006)

    CrossRef  Google Scholar 

  14. Grieskamp, W., Tillmann, N., Schulte, W.: XRT – Exploring Runtime for.NET: Architecture and Applications. Electr. Notes Theor. Comput. Sci. 144(3), 3–26 (2006)

    CrossRef  Google Scholar 

  15. Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Math. 284, 149–156 (2004)

    MathSciNet  CrossRef  MATH  Google Scholar 

  16. Hnich, B., Prestwich, S., Selensky, E., Smith, B.M.: Constraint models for the covering test problem. Constraints 11, 199–219 (2006)

    MathSciNet  CrossRef  MATH  Google Scholar 

  17. Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: A general strategy for t-way software testing. In: IEEE International Conference on the Engineering of Computer-Based Systems, pp. 549–556 (2007)

    Google Scholar 

  18. Qu, X., Cohen, M.B., Rothermel, G.: Configuration-aware regression testing: An empirical study of sampling and prioritization. In: International Symposium on Software Testing and Analysis, July 2008, pp. 75–85 (2008)

    Google Scholar 

  19. Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: Wermelinger, M., Gal, H. (eds.) ESEC/SIGSOFT FSE, pp. 263–272. ACM, New York (2005)

    Google Scholar 

  20. Sherwood, G.: Testcover.com (2006), http://testcover.com/pub/constex.php

  21. Tillmann, N., de Halleux, J.: Pex–White Box Test Generation for .NET. In: Beckert, B., Hähnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134–153. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  22. Yilmaz, C., Cohen, M.B., Porter, A.: Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering 31(1), 20–34 (2006)

    CrossRef  Google Scholar 

  23. Yuan, X., Cohen, M., Memon, A.M.: Covering array sampling of input event sequences for automated GUI testing. In: ASE 2007: Proceedings of the 22nd IEEE international conference on Automated software engineering, pp. 405–408 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grieskamp, W., Qu, X., Wei, X., Kicillof, N., Cohen, M.B. (2009). Interaction Coverage Meets Path Coverage by SMT Constraint Solving. In: Núñez, M., Baker, P., Merayo, M.G. (eds) Testing of Software and Communication Systems. FATES TestCom 2009 2009. Lecture Notes in Computer Science, vol 5826. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05031-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05031-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05030-5

  • Online ISBN: 978-3-642-05031-2

  • eBook Packages: Computer ScienceComputer Science (R0)