LaTe, a non-fully deterministic testing language

  • Authors:
  • Emmanuel Donin de Rosière;Claude Jard;Benoît Parreaux

  • Affiliations:
  • France Télécom R&D, Lannion, France;ENS Cachan, Bruz, France;France Télécom R&D, Lannion, France

  • Venue:
  • TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a case study which is the test of a voice-based service. To develop this application, we propose new functionalities for testing languages and a new language called LaTe that implements them. With LaTe, one testing scenario can describe several different executions and the interpreter tries to find the execution that best fits with the real behavior of the System Under Testing (SUT). We propose an operational semantics of these non-deterministic operators. Experimental results of the test of the voice-based service are also included.