Testing for refinement in CSP

  • Authors:
  • Ana Cavalcanti;Marie-Claude Gaudel

  • Affiliations:
  • University of York, Department of Computer Science, York, UK;LRI, Université de Paris-Sud and CNRS, Orsay, France

  • Venue:
  • ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective tool have encouraged much work on algebraic reasoning and model checking. Testing techniques based on CSP, however, have not been widely explored, and in this paper we take a first step by instantiating Gaudel et al's theory of formal testing to CSP. We identify the testability hypothesis that we consider necessary to use CSP models as a basis for testing. We also define test sets that we prove to be exhaustive with respect to traces and failures refinement, and consider optimisations, inputs and outputs, and selection strategies. Our results are proved in terms of the CSP denotational models; they are a sound foundation for the development of test-generation techniques.