A language for test case refinement in the test template framework

  • Authors:
  • Maximiliano Cristia;Diego Hollmann;Pablo Albertengo;Claudia Frydman;Pablo Rodriguez Monetti

  • Affiliations:
  • CIFASIS-UNR, Rosario Argentina and LSIS-UPCAM, Marseille, France;CIFASIS-UNR, Rosario Argentina;Flowgate Consulting, Rosario, Argentina;LSIS-UPCAM, Marseille, France;FCEIA-UNR, Rosario, Argentina

  • Venue:
  • ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model-based testing (MBT) generates test cases by analysing a formal model of the system under test (SUT). In many MBT methods, these test cases are too abstract to be executed. Therefore, an executable representation of them is necessary to test the SUT. So far, the MBT community has focused on methods that automate the generation of test cases, but less has been done in making them executable. In this paper we propose a language to specify rules that can be automatically applied to produce an executable representation of test cases generated by the Test Template Framework (TTF), a MBT method for the Z notation.