Skip to main content
SpringerLink
Log in

Extending Data Flow Coverage to Test Constraint Refinements

  • Conference paper
  • First Online:
Integrated Formal Methods (IFM 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13274))

Included in the following conference series:

Abstract

This paper presents a new data flow coverage criterion for a deeper analysis of possible refinements to the constraints on paths unfolding of software program’s behavior. Such refinements represent a feasible chain of usages of the same variable without redefinitions in-between. An algorithm for reasonable chains selection is proposed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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. Miranda, B., Bertolino, A.: Testing relative to usage scope: revisiting software coverage criteria. ACM Trans. Softw. Eng. Methodol. 29(3), 18. 24p. (2020)

    Google Scholar 

  2. Lee, J., Kang, S., Pilsu, J.: Test coverage criteria for software product line testing: Systematic literature review. Inf. Softw. Techn. 122, 106272 (2020)

    Google Scholar 

  3. Gay, G., Staats, M., Whalen, M., Heimdahl, M.: The risks of coverage-directed test case generation. IEEE Trans. Softw. Eng. 41, 803–819 (2015)

    Article  Google Scholar 

  4. Inozemtseva, L., Holmes, R.: Coverage is not strongly correlated with test suite effectiveness. In: Proceedings of ACM ICSE, pp. 435–445 (2015)

    Google Scholar 

  5. Kolchin, A., Potiyenko, S., Weigert, T.: Challenges for automated, model-based test scenario generation. Comm. Comput. Inf. Sci. 1078, 182–194 (2019)

    Google Scholar 

  6. Su T., et al.: A survey on data-flow testing. ACM Comput. Surv. 50, 35p (2017)

    Google Scholar 

  7. Sahoo, R.R., Ray, M.: Metaheuristic techniques for test case generation: a review. Research anthology on agile software. Softw. Dev. Test. 1043–1058 (2022)

    Google Scholar 

  8. Hong, H.S., Ural, H.: Dependence testing: extending data flow testing with control dependence. In: Khendek, F., Dssouli, R. (eds.) TestCom 2005. LNCS, vol. 3502, pp. 23–39. Springer, Heidelberg (2005). https://doi.org/10.1007/11430230_3

    Chapter  Google Scholar 

  9. Rapps, S., Weyuker, E.: Data flow analysis techniques for test data selection. In: Proceedings of the International Conference of Software Engineering. pp. 272–277 (1982)

    Google Scholar 

  10. Laski, J., Korel, B.: A data flow oriented program testing strategy. IEEE Trans. Softw. Eng. 9(3), 347–354 (1983)

    Article  Google Scholar 

  11. Chilenski, J., Miller, S.: Applicability of modified condition/decision coverage to software testing. Softw. Eng. J. 7(5), 193–200 (1994)

    Article  Google Scholar 

  12. Static single assignment book (2018). https://pfalcon.github.io/ssabook/latest/book-full.pdf. Accessed 6 Apr 2022

  13. Weigert, T., et al.: Generating test suites to validate legacy systems. In: Fonseca i Casas, P., Sancho, M.-R., Sherratt, E. (eds.) SAM 2019. LNCS, vol. 11753, pp. 3–23. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30690-8_1

    Chapter  Google Scholar 

  14. Kolchin, A.: A novel algorithm for attacking path explosion in model-based test generation for data flow coverage. In: Proceedings of IEEE 1st International Conference on System Analysis and Intelligent Computing, SAIC. pp. 226–231 (2018)

    Google Scholar 

  15. Ntafos, S.: On required element testing. IEEE Trans. Softw. Eng. 10, 795–803 (1984)

    Article  Google Scholar 

  16. Kolchin, A., Potiyenko, S., Weigert, T.: Extending data flow coverage with redefinition analysis. In: Proceedings of the IEEE International Conference on Information and Digital Technologies. pp. 293–296 (2021)

    Google Scholar 

  17. Chaim, M.L., Baral, K., Offutt, J., Concilio, M.: Araujo, R.P.A.: Efficiently finding data flow subsumptions. In: Proceedings of 14th IEEE Conference on Software Testing, Verification and Validation (ICST). pp. 94–104 (2021)

    Google Scholar 

  18. Gal, R., Haber, E., Ibraheem, W., Irwin, B., Nevo, Z., Ziv, A.: Automatic scalable system for the coverage-directed generation (CDG) problem. In: Proceedings of Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 206–211 (2021)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V.M. Glushkov Institute of Cybernetics NAS of Ukraine, Kyiv, Ukraine

    Alexander Kolchin & Stepan Potiyenko

Authors
  1. Alexander Kolchin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stepan Potiyenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Kolchin .

Editor information

Editors and Affiliations

  1. ISTI-CNR, Pisa, Italy

    Maurice H. ter Beek

  2. Maynooth University, Maynooth, Ireland

    Rosemary Monahan

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kolchin, A., Potiyenko, S. (2022). Extending Data Flow Coverage to Test Constraint Refinements. In: ter Beek, M.H., Monahan, R. (eds) Integrated Formal Methods. IFM 2022. Lecture Notes in Computer Science, vol 13274. Springer, Cham. https://doi.org/10.1007/978-3-031-07727-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-07727-2_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-07726-5

  • Online ISBN: 978-3-031-07727-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation