Skip to main content

Multi-objective Test Suite Optimization for Event-B Models

  • Conference paper
Book cover Informatics Engineering and Information Science (ICIEIS 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 251))

Abstract

Event-B is a formalism that is used in modeling and proving the consistency of complex systems. The test suite generation methods have been recently introduced as research theme. In this paper, the multi-objective test suite optimization problem is introduced for Event-B testing. However, there exist many optimization criteria in real-life testing problems. Given that, six specifically multi-objective test suite optimization problems are formulated. Two modern Multi-Objective Evolutionary Algorithms are used for solving them: NSGA-II [6] and SPEA-2 [18]. The experiments have been conducted using five test suites generated from two industrial inspired Event-B models (five different machines).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial, J.-R.: Modeling in Event-B - system and software engineering. Cambridge University Press (2010)

    Google Scholar 

  2. Agrawal, H.: Efficient coverage testing using global dominator graphs. In: Proceedings of the 1999 Workshop on Program Analysis for Software Tools and Engineering, pp. 11–20 (1999)

    Google Scholar 

  3. Black, J., Melachrinoudis, E., Kaeli, D.: Bi-criteria models for all-uses test suite reduction. In: Proceedings of the 26th International Conference on Software Engineering (ICSE 2004), Edinburgh, Scotland, United Kingdom, pp. 106–115 (2004)

    Google Scholar 

  4. Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3) (1979)

    Google Scholar 

  5. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to algorithms. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Deb, K., Agrawal, S., Pratab, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Dinca, I., Stefanescu, A., Ipate, F., Lefticaru, R., Tudose, C.: Test Data Generation for Event-B Models Using Genetic Algorithms. In: Zain, J.M., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds.) ICSECS 2011, Part III. CCIS, vol. 181, pp. 76–90. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Durillo, J.J., Nebro, A.J., Alba, E.: The jMetal framework for multi-objective optimization: Design and architecture. In: CEC 2010, Barcelona, Spain, pp. 4138–4325 (July 2010)

    Google Scholar 

  9. Harman, M.: Making the case for MORTO: Multi Objective Regression Test Optimization. In: Proceedings of the 1st International Workshop on Regression Testing (Regression 2011), Berlin, Germany (2011)

    Google Scholar 

  10. Harrold, M.J., Gupta, R., Soffa, M.L.: A methodology for controlling the size of a test suite. ACM Transactions on Software Engineering and Methodology 2(3), 270–285 (1993)

    Article  Google Scholar 

  11. Iliasov, A., Troubitsyna, E., Laibinis, L., Romanovsky, A., Varpaaniemi, K., Ilic, D., Latvala, T.: Developing Mode-Rich Satellite Software by Refinement in Event B. In: Kowalewski, S., Roveri, M. (eds.) FMICS 2010. LNCS, vol. 6371, pp. 50–66. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Ipate, F.: Learning finite cover automata from queries. Journal of Computer and System Sciences (in press, 2011), http://doi:10.1016/j.jcss.2011.04.002

    Google Scholar 

  13. Leuschel, M., Butler, M.J.: ProB: an automated analysis toolset for the B method. Int. J. Softw. Tools Technol. Transf. 10(2), 185–203 (2008)

    Article  Google Scholar 

  14. Marre, M., Bertolino, A.: Using spanning set for coverage testing. IEEE Transactions on Software Engineering 29(11), 974–984 (2003)

    Article  Google Scholar 

  15. Wieczorek, S., Kozyura, V., Roth, A., Leuschel, M., Bendisposto, J., Plagge, D., Schieferdecker, I.: Applying Model Checking to Generate Model-Based Integration Tests from Choreography Models. In: Núñez, M., Baker, P., Merayo, M.G. (eds.) TESTCOM 2009. LNCS, vol. 5826, pp. 179–194. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Yoo, S., Harman, M.: Pareto efficient multi-objective test-case selection. In: Proceedings of International Symposium on Software Testing and Analysis (ISSTA 2007), pp. 140–150. ACM Press (2007)

    Google Scholar 

  17. Yoo, S., Harman, M.: Using hybrid algorithm for pareto efficient multi-objective test suite minimisation. Journal of Systems and Software 83(4), 689–701 (2010)

    Article  Google Scholar 

  18. Zitzler, E., Laumanss, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Tech. Rep., 103 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dincǎ, I. (2011). Multi-objective Test Suite Optimization for Event-B Models. In: Abd Manaf, A., Zeki, A., Zamani, M., Chuprat, S., El-Qawasmeh, E. (eds) Informatics Engineering and Information Science. ICIEIS 2011. Communications in Computer and Information Science, vol 251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25327-0_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25327-0_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25326-3

  • Online ISBN: 978-3-642-25327-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics