skip to main content
10.1145/1188895.1188902acmconferencesArticle/Chapter ViewAbstractPublication PagesfseConference Proceedingsconference-collections
Article

Test automation for hybrid systems

Published:06 November 2006Publication History

ABSTRACT

This article presents novel results on automated test generation for hybrid control systems, which involves the generation of both discrete and real-valued, potentially time-continuous, input data to the system under test. Our generation techniques are allocated in two layers: The upper layer contains a symbolic test case generator constructing test cases as paths through an abstracted representation model of the system under test. Different test strategies designed to pursue various quality objectives lead to different selections of symbolic test cases. Symbolic test cases are transformed into feasible, i. e., executable, test cases by constructing concrete sequences of input data, allowing the execution of the pre-planned transition sequence. The input data construction is performed by the lower layer consisting of a constraint solver which applies interval analysis techniques to identify the domains from where to pick the appropriate test data. This process is made efficient by combining subpaving with forward-backward interval constraint propagation. On both layers learning algorithms are applied in order to avoid the spending of computation time on paths and sub-constraints, respectively, which are already known not to contribute to the solution.

References

  1. P. Ammann, J. Offutt, and H. Huang. Coverage criteria for logical expressions. In Proceedings of the 2003 International Symposium on Software Reliability Engineering (ISSRE '03), pages 99--107, Denver, CO, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. Berkenkötter, S. Bisanz, U. Hannemann, and J. Peleska. The HybridUML Profile for UML 2.0. International Journal on Software Tools for Technology Transfer (STTT), 8(2):167--176, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, SE-4(3):178--186, Mar. 1978.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Denise, M.-C. Gaudel, and S.-D. Gouraud. A generic method for statistical testing. In Proceedings of the 15th International Symposium on Software Reliability Engineering (ISSRE'04), pages 25--34, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. B. J. Ellis. Automation for exception freedom proofs. In 18th IEEE International Conference on Automated Software Engineering, 2003. IEEE, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Fränzle, C. Herde, S. Ratschan, T. Schubert, and T. Teige. Interval Constraint Solving Using Propositional SAT Solving Techniques. CP 2006 Workshop on the Integration of SAT and CP Techniques, 2006.Google ScholarGoogle Scholar
  7. T. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 278--292. IEEE Computer Society Press, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. T. Henzinger and P. Kopke. Discrete-time control for rectangular hybrid automata. In ICALP 97, Lecture Notes in Computer Science 1256, pages 582--593. Springer, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. J. Hickey, Q. Ju, and M. H. van Emden. Interval arithmetic: From principles to implementation. Journal of the ACM, 48(5):1038--1068, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Jaulin, M. Kieffer, O. Didrit, and É. Walter. Applied Interval Analysis. Springer-Verlag, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  11. SC-167. Software Considerations in Airborne Systems and Equipment Certification. RTCA, 1992.Google ScholarGoogle Scholar
  12. J. Springintveld, F. Vaandrager, and P. D'Argenio. Testing timed automata. Theoretical Computer Science, 254(1-2):225--257, March 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In IEEE/ACM International Conference on Computer-Aided Design, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Test automation for hybrid 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
        SOQUA '06: Proceedings of the 3rd international workshop on Software quality assurance
        November 2006
        86 pages
        ISBN:1595935843
        DOI:10.1145/1188895

        Copyright © 2006 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: 6 November 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Upcoming Conference

        FSE '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader