skip to main content
10.1145/2889160.2889212acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
research-article

Testing the untestable: model testing of complex software-intensive systems

Published:14 May 2016Publication History

ABSTRACT

Increasingly, we are faced with systems that are untestable, meaning that traditional testing methods are expensive, time-consuming or infeasible to apply due to factors such as the systems' continuous interactions with the environment and the deep intertwining of software with hardware.

In this paper we outline our vision to enable testing of untestable systems. Our key idea is to frame testing on models rather than operational systems. We refer to such testing as model testing. Our goal is to raise the level of abstraction of testing from operational systems to models of their behaviors and properties. The models that underlie model testing are executable representations of the relevant aspects of a system and its environment, alongside the risks of system failures. Such models necessarily have uncertainties due to complex, dynamic environment behaviors and the unknowns about the system. This makes it crucial for model testing to be uncertainty-aware. We propose to synergistically combine metaheuristic search, increasingly used in traditional software testing, with system and risk models to drive the search for faults that entail the most risk.

We expect model testing to bring early and cost-effective automation to the testing of many critical systems that defy existing automation techniques, thus significantly improving the dependability of such systems.

References

  1. R. Calinescu, C. Ghezzi, M. Kwiatkowska, and R. Mirandola. Self-adaptive software needs quantitative verification at runtime. Commun. ACM, 55(9):69--77, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Y. Chen, T. H. Tse, and Z. Q. Zhou. Fault-based testing without the need of oracles. Information and Software Technology, 45(1):1--9, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  4. H. Hemmati, A. Arcuri, and L. Briand. Achieving Scalable Model-Based Testing through Test Case Diversity. ACM Trans. Softw. Eng. Methodol., 22(1):6:1--6:42, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Z. Iqbal, A. Arcuri, and L. Briand. Empirical investigation of search algorithms for environment model-based testing of real-time embedded software. In Proc. of ISSTA 2012, pages 199--209. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. MathWorks. Mathworks MATLAB Simulink. http://www.mathworks.com/products/simulink/.Google ScholarGoogle Scholar
  7. R. Matinnejad, S. Nejati, L. Briand, T. Bruckmann, and C. Poull. Search-based automated testing of continuous controllers: Framework, tool support, and case studies. Information and Software Technology, 57:705--722, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  8. P. McMinn. Search-based software test data generation: A survey. Softw. Test. Verif. Reliab., 14(2):105--156, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Shokry and M. Hinchey. Model-based verification of embedded software. Computer, 42(4):53--59, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. E. J. Weyuker. On testing non-testable programs. The Computer Journal, 25(4):465--470, 1982.Google ScholarGoogle ScholarCross RefCross Ref
  1. Testing the untestable: model testing of complex software-intensive systems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ICSE '16: Proceedings of the 38th International Conference on Software Engineering Companion
      May 2016
      946 pages
      ISBN:9781450342056
      DOI:10.1145/2889160

      Copyright © 2016 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 14 May 2016

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate276of1,856submissions,15%

      Upcoming Conference

      ICSE 2025

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader