Skip to main content

Generating Covering Arrays with Pseudo-Boolean Constraint Solving and Balancing Heuristic

  • Conference paper
  • First Online:
PRICAI 2016: Trends in Artificial Intelligence (PRICAI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9810))

Included in the following conference series:

Abstract

Covering arrays (CAs) are interesting objects in combinatorics and they also play an important role in software testing. It is a challenging task to generate small CAs automatically and efficiently. In this paper, we propose a new approach which generates a CA column by column. A kind of balancing heuristic is adopted to guide the searching procedure. At each step (column extension), some pseudo Boolean constraints are generated and solved by a PBO solver. A prototype tool is implemented, which turns out to be able to find smaller CAs than other tools, for some cases.

This work has been supported in part by the National 973 Program under grant No. 2014CB340701, and by the Youth Innovation Promotion Association, CAS (grant No. 2016104).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  Google Scholar 

  2. Cohen, M.B., Gibbons, P.B., Mugridge, W.B., Colbourn, C.J.: Constructing test suites for interaction testing. In: Proceedings of ICSE 2003, pp. 38–48 (2003)

    Google Scholar 

  3. Czerwonka, J.: Pairwise testing in the real world. In: Proceedings of the 24th Pacific Northwest Software Quality Conference (PNSQC 2006), pp. 419–430 (2006)

    Google Scholar 

  4. Garvin, B.J., Cohen, M.B., Dwyer, M.B.: An improved meta-heuristic search for constrained interaction testing. In: Proceedings of the 1st International Symposium on Search Based Software Engineering (SBSE 2009), pp. 13–22 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Kuhn, D.R., Michael, J.R.: An investigation of the applicability of design of experiments to software testing. In: Proceedings of the 27th Annual NASA Goddard/IEEE Software Engineering Workshop (2002)

    Google Scholar 

  7. Lei, Y., Tai, K.C.: In-parameter-order: a test generation strategy for pair-wise testing. In: Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE 1998), pp. 254–261. IEEE Computer Society (1998)

    Google Scholar 

  8. Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG: a general strategy for T-way software testing. In: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS 2007), pp. 549–556. IEEE (2007)

    Google Scholar 

  9. Lei, Y., Kacker, R., Kuhn, D.R., Okun, V., Lawrence, J.: IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing. Softw. Test. Verification Reliab. 18(3), 125–148 (2008)

    Article  Google Scholar 

  10. Yan, J., Zhang, J.: A backtracking search tool for constructing combinatorial test suites. J. Syst. Softw. 81(10), 1681–1693 (2008)

    Article  Google Scholar 

  11. Zhang, J., Zhang, Z., Ma, F.: Automatic Generation of Combinatorial Test Data. Springer Briefs in Computer Science. Springer, Heidelberg (2014). ISBN 978-3-662-43428-4

    MATH  Google Scholar 

  12. Zhang, Z., Yan, J., Zhao, Y., Zhang, J.: Generating combinatorial test suite using combinatorial optimization. J. Syst. Softw. 98, 191–207 (2014)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Lin, J., Luo, C., Cai, S., Su, K., Hao, D., Zhang, L.: TCA: an efficient two-mode meta-heuristic algorithm for combinatorial test generation. In: Proceedings of ASE 2015, pp. 494–505 (2015)

    Google Scholar 

  15. Ma, F., Zhang, J.: Finding orthogonal arrays using satisfiability checkers and symmetry breaking constraints. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 247–259. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. The clasp webpage. http://potassco.sourceforge.net/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Feifei Ma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, H., Ma, F., Zhang, J. (2016). Generating Covering Arrays with Pseudo-Boolean Constraint Solving and Balancing Heuristic. In: Booth, R., Zhang, ML. (eds) PRICAI 2016: Trends in Artificial Intelligence. PRICAI 2016. Lecture Notes in Computer Science(), vol 9810. Springer, Cham. https://doi.org/10.1007/978-3-319-42911-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42911-3_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42910-6

  • Online ISBN: 978-3-319-42911-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics