|


Back to list of 2003/04 seminars

Abstract for Seminar

     
Problems and Methods for Testing Infinite State Machines
Tuesday 20th January 2004 16:00 Brian Spratt Room
     
Marie-Claude Gaudel
LRI, Universite de Paris-Sud & CNRS 		  Abstract
     

There has been a lot of research on testing based on formal specifications, especially in the area of communication protocols. Most approaches take as starting point a finite model of the required behaviours of the system under test, such as Finite State Machines (FSM) or finite Labelled Transition Systems (LTS).

This talk presents the problems that arise when the underlying model of the specification is not finite. It is the case as soon as non-trivial data types are used in actions and guards, as in full LOTOS, in UML statecharts, in CCS or CSP extended with value-passing possibilities such as CSP-Casl, etc.

Some solutions are sketched in the line of [2] and [3]. They are based on some integration of the methods developed for testing from finite behavioural models and of those developed for data type specifications [1].

  1. G. Bernot and M.-C. Gaudel and B. Marre, Software testing based on formal specifications: a theory and a tool, in Software Engineering Journal, pp. 387-405, 1991.
  2. Gaudel, M. -C., James, P. R.: Testing Algebraic Data Types and Processes: a unifying theory. Formal Aspects of Computing, 10(5-6), (1999) 436-451.
  3. Gregory Lestiennes, Marie-Claude Gaudel, Testing Processes from Formal Specifications with Inputs, Outputs, and data Types, 13th IEEE Int. Symposium on Software Reliability Engineering (ISSRE-2002), Annapolis, 2002, pp. 3-14.

Computer Science @ Kent

|   Home   |   Teaching   |   People   |   Search   |   Research   |   Publications   |   Postgrad   |   Contacts   |   Help   |

Go to the University of Kent's homepage Last modified Tuesday January 13 10:26:18 GMT 2004
Problems with this page? Contact the CS Webmaster
http://www.cs.kent.ac.uk/dept_info/seminars/2003_04/abs_2004_01_20.html