skip to main content
10.1145/3297280.3297496acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Matching implementations to specifications: the corner cases of ioco

Published:08 April 2019Publication History

ABSTRACT

A well-known conformance relation for model-based testing is ioco. A conformance relation expresses when an implementation is correct with respect to a specification. Unlike many other conformance and refinement relations, ioco has different domains for implementations and for specifications. Consequently, ioco is neither reflexive nor transitive, implying that a specification does not implement itself, and that specifications cannot be compared for refinement. In this paper, we investigate how we can compensate for the lack of reflexivity and transitivity. We show that (i) given a specification, we can construct in a standard way a canonical conforming implementation that is very 'close' to the specification; and (ii) a refinement preorder on specification models can be defined such that a refined model allows less ioco-conforming implementations. We give declarative and constructive definitions of both, we give examples of unimplementable corner-cases, we investigate decidability, and we do that for ioco as well as for the ioco-variant uioco. The latter turns out to be simpler and on more aspects decidable.

References

  1. L. de Alfaro and T.A. Henzinger. Interface Automata. In V. Gruhn, editor, ESEC/FSE'01, SIGSOFT Softw. Eng. Notes 26, pages 109--120. ACM Press, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Beneš, P. Daca, T.A. Henzinger, J. Křetínskỳ, and D. Ničković. Complete composition operators for ioco-testing theory. In P. Kruchten et al., editors, ACM SIGSOFT Symp. on Comp.-Based Softw. Eng., pages 101--110. ACM, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. JA Bergstra, JCM Baeten, and Jan Willem Klop. On the consistency of Koomen's fair abstraction rule. TCS, 37(1):129--176, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. van der Bijl, A. Rensink, and J. Tretmans. Compositional Testing with ioco. In A. Petrenko and A. Ulrich, editors, FATES 2003, LNCS 2931, pages 86--100. Springer-Verlag, 2004.Google ScholarGoogle Scholar
  5. I.B. Bourdonov and A.S. Kossatchev. Specification completion for IOCO. Programming and Computer Softw., 37(1):1--14, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. Frantzen, J. Tretmans, and T.A.C. Willemse. A Symbolic Framework for Model-Based Testing. In K. Havelund et al., editors, FATES/RV'06, LNCS 4262, pages 40--54. Springer-Verlag, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M.-C. Gaudel. Testing can be Formal, too. In P.D. Mosses et al., editors, TAP-SOFT'95, LNCS 915, pages 82--96. Springer-Verlag, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Marcus Gerhold and Mariëlle Stoelinga. Model-based testing of probabilistic systems. Formal Aspects of Computing, 30(1):77--106, 2018. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Janssen and J. Tretmans. Matching implementations to specifications: The corner cases of ioco. Technical report, 2019. URL https://sumbat.cs.ru.nl/Publications?action=upload&upname=JanssenTretmansCornerCasesOfIoco.pdf.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Krichen and S. Tripakis. Black-Box Conformance Testing for Real-Time Systems. In S. Graf and others., editors, SPIN'04, LNCS 2989. Springer-Verlag, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. Malte Lochau, Sven Peldszus, Matthias Kowal, and Ina Schaefer. Model-based testing. In M. Bernardo et al., editors, Formal Methods for the Design of Computer, Communication and Softw. Systems, 2014.Google ScholarGoogle Scholar
  13. Anil Nerode. Linear automaton transformations. Proc. of the American Mathematical Society, 9(4):541--544, 1958.Google ScholarGoogle ScholarCross RefCross Ref
  14. N. Noroozi. Improving Input-Output Conformance Testing Theories. PhD thesis, Eindhoven University of Technology, Eindhoven (NL), 2014.Google ScholarGoogle Scholar
  15. Larry J Stockmeyer and Albert R Meyer. Word problems requiring exponential time. In Proc. 5th ACM Symp. on Theory of computing, pages 1--9. ACM, 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Stokkink, M. Timmer, and M. Stoelinga. Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation. In A. K. Petrenko and H. Schlingloff, editors, MBT'12, volume 80 of EPTCS, 2012.Google ScholarGoogle Scholar
  17. J. Tretmans. Test Generation with Inputs, Outputs and Repetitive Quiescence. Software---Concepts and Tools, 17(3):103--120, 1996.Google ScholarGoogle Scholar
  18. J. Tretmans. Model Based Testing with Labelled Transition Systems. In R.M. Hierons et al., editors, Formal Methods and Testing, LNCS 4949, pages 1--38. Springer-Verlag, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Volpato and J. Tretmans. Towards Quality of Model-Based Testing in the ioco Framework. In JAMAICA'13, pages 41--46, New York, NY, USA, 2013. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T.A.C. Willemse. Heuristics for ioco-Based Test-Based Modelling. In L. Brim et al., editors, FMICS/PDMC'07, LNCS 4346, pages 123--147. Springer-Verlag, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

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
    SAC '19: Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing
    April 2019
    2682 pages
    ISBN:9781450359337
    DOI:10.1145/3297280

    Copyright © 2019 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: 8 April 2019

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader