Test generation from recursive tile systems

نویسندگان

  • Sébastien Chédor
  • Thierry Jéron
  • Christophe Morvan
چکیده

In this paper we explore the generation of conformance test cases for Recursive Tile Systems (RTSs) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. Test generation for this kind of models is seldom explored in the literature. We first present an off-line test generation algorithm for Weighted RTSs, a determinizable sub-class of RTSs, and second, an on-line test generation algorithm for the full RTS model. Both algorithms use test purposes to guide test selection through targeted behaviours. Additionally, essential properties relating verdicts produced by generated test cases on an implementation with both the conformance with respect to its specification, and the precision with respect to a test purpose, are proved. Key-words: Model-based Testing, IOCO Theory, Recursive Systems ∗ Université de Rennes I, Campus de Beaulieu, 35042 Rennes, France † INRIA Rennes Bretagne Atlantique, Campus de Beaulieu, 35042 Rennes, France ‡ Université Paris-Est, Marne-La-Vallée, France ha l-0 07 78 13 4, v er si on 1 18 J an 2 01 3 Génération de tests pour les systèmes de tuile récursifs Résumé : Dans ce rapport, nous nous intéressons à la génération de cas de tests de conformité pour les systèmes de tuiles récursifs (RTSs) dans le contexte classique de la théorie ioco. Le modèle des RTSs permet de décrire les systèmes réactifs avec un comportement récursif, et est très similaire aux automates à pile, aux grammaires de graphes avec remplacement d’hyperarcs et aux machines récursives à états. La génération de test pour ce genre de modèles est rarement traitée dans la littérature. Dans un premier temps, nous présentons un algorithme de génération de test hors ligne pour les RTSs pondérés, une sousclasse de RTSs, puis, un algorithme en ligne pour le modèle complet. Les deux algorithmes utilisent des objectifs de test pour guider le test vers des comportements ciblés. De plus, les verdicts renvoyés par l’exécution des cas de tests sur une implémentation sont prouvés à la fois conformes par rapport à la spécification et précis par rapport à l’objectif de test. Mots-clés : Test basé sur les modèles, Théorie IOCO, Systèmes Récursifs ha l-0 07 78 13 4, v er si on 1 18 J an 2 01 3 Test generation from RTS 3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of partially observed recursive tile systems

The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. We consider recursive tile systems, which are infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars. Recursive tile systems are expressive...

متن کامل

A tile logic-based semantics for mobile software architectures

The paper deals with the specification of dynamic reconfiguration of complex systems. We show how dynamic reconfiguration and especially components mobility, affects the ongoing behaviour of the reconfigured parts and its side effects on the system as a whole. Our approach is based on software architectural viewpoint of hierarchical systems, considered as sets of independent components and link...

متن کامل

Test Generation from Recursive Tiles Systems

In this paper we explore test generation for Recursive Tiles Systems (RTS) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. We first present an off-line test generation algorithm for Weighted RTS, a...

متن کامل

Diagnostic, opacité et test de conformité pour des systèmes récursifs. (Diagnosis, opacity and conformance testing for recursive tile systems)

An effective way to ensure the proper functioning of a computer system is to represent itby using mathematical models . Many studies have been conducted using finite automata asmodels, in this thesis we try to extend these works to infinite models.We focus on three problems in which a system is partially observed. In this case, it isimpossible to access certain internal info...

متن کامل

Picture languages: Tiling systems versus tile rewriting grammars

Two formal models of pictures, i.e., 2D languages are compared: Tiling Systems and Tile Rewriting Grammars, which resp. extend to 2D the Regular and Context-Free languages. Two results extending classical language properties into 2D are proved. First, non-recursive TRG coincide with TS. Second, non-self-embedding TRG are suitably defined as corner grammars, showing that they generate TS languag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Softw. Test., Verif. Reliab.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2014