Advertisement

Fast Testing of Critical Properties through Passive Testing

  • José Antonio Arnedo
  • Ana Cavalli
  • Manuel Núñez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2644)

Abstract

We present a novel methodology to perform passive testing. The usual approach consists in recording the trace produced by the implementation under test and trying to find a fault by comparing this trace with the specification. We propose a more active approach to passive testing where the minimum set of (critical) properties required to a correct implementation may be explicitly indicated. In short, an invariant expresses that each time that the implementation under test performs a given sequence of input/output actions, then it must show a behavior reflected in the invariant. By using an adaptation of the classical pattern matching algorithms on strings, we obtain that the complexity of checking whether an invariant is fulfilled by the observed trace is in \( \mathcal{O}\left( {nm} \right) \) , where n and m are the lengths of the trace and the invariant, respectively. If the length of the invariant is much smaller than the length of the trace then this complexity is almost linear with respect to the length of the trace. Actually, this is usually the case for most practical examples. In addition to our methodology, we present the case study that was the driving force for the development of our theory: The Wireless Application Protocol (WAP). We present a test architecture for WAP as well as the experimental results obtained from the application of our passive testing with invariants approach.

Keywords

Pattern Match Critical Property Finite State Machine Input Symbol Invariant Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [AAD79]
    J.M. Ayache, P. Azema, and M. Diaz. Observer: A concept for on-line detection of control errors in concurrent systems. In 9th Symposium on Fault-Tolerant Computing, 1979.Google Scholar
  2. [BM77]
    R.S. Boyer and J.S. Moore. A fast string searching algorithm. Communications of the ACM, 20: 762–772, 1977.CrossRefGoogle Scholar
  3. [CGP01]
    A. Cavalli, C. Gervy, and S. Prokopenko. New approaches for passive testing using an extended finite state machine specification. In Concordia Prestigious Workshop on Communication Software Engineering, pages 225–250, 2001.Google Scholar
  4. [KMP77]
    D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(1):323–350, 1977.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [Lai02]
    R. Lai. A survey of communication protocol testing. Journal of Systems and Software, 62: 21–46, 2002.CrossRefGoogle Scholar
  6. [LCH+02]
    D. Lee, D. Chen, R. Hao, R. Miller, J. Wu and X. Yin. A formal approach for passive testing of protocol data portions. In 10th IEEE Int. Conf. on Network Protocols, ICNP’02, pages 122–131. IEEE Computer Society Press, 2002.Google Scholar
  7. [LNS+97]
    D. Lee, A.N. Netravali, K.K. Sabnani, B. Sugla, and A. John. Passive testing and applications to network management. In 5th IEEE Int. Conf. on Network Protocols, ICNP’97, pages 113–122. IEEE Computer Society Press, 1997.Google Scholar
  8. [LY96]
    D. Lee and M. Yannakakis. Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE, 84(8):1090–1123, 1996.CrossRefGoogle Scholar
  9. [MA01a]
    R.E. Miller and K.A. Arisha. Fault coverage in networks by passive testing. In International Conference on Internet Computing 2001, IC’2001, pages 413–419. CSREA Press, 2001.Google Scholar
  10. [MA01b]
    R.E. Miller and K.A. Arisha. Fault identification in networks by passive testing. In 34th Simulation Symposium, SS’01, pages 277–284. IEEE Computer Society Press, 2001.Google Scholar
  11. [Mil98]
    R.E. Miller. Passive testing of networks using a CFSM specification. In IEEE Int. Performance Computing and Communications Conference, pages 111–116. IEEE Computer Society Press, 1998.Google Scholar
  12. [TC99]
    M. Tabourier and A. Cavalli. Passive testing and application to the GSM-MAP protocol. Journal of Information and Software Technology, 41:813–821, 1999.CrossRefGoogle Scholar
  13. [TCI99]
    M. Tabourier, A. Cavalli, and M. Ionescu. A GSM-MAP protocol experiment using passive testing. In World Congress on Formal Methods in the Development of Computing Systems, FM’99, LNCS 1708, pages 915–934. Springer, 1999.Google Scholar
  14. [WZY01]
    J. Wu, Y. Zhao, and X. Yin. From active to passive: Progress in testing of internet routing protocols. In FORTE 2001, pages 101–116. Kluwer Academic Publishers, 2001.Google Scholar

Copyright information

© IFIP 2003

Authors and Affiliations

  • José Antonio Arnedo
    • 1
  • Ana Cavalli
    • 1
  • Manuel Núñez
    • 2
  1. 1.Institut National des Télécommunications GET-INTEvry CedexFrance
  2. 2.Dept. Sistemas Informáticos y ProgramaciónUniversidad Complutense de MadridMadridSpain

Personalised recommendations