Pairwise Testing Revisited for Structured Data With Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Pairwise Testing Revisited for Structured Data With Constraints


Pairwise testing (PT) exercises the interactions of pairs of input parameters. The approach is classically defined for a flat set of parameters, the number of which is fixed. Such a definition does not fit well with applications that process structured data like XML and JSON documents. This paper revisits the PT concepts to accommodate hierarchical data structures. The choices and pairs are created by considering the multiplicity of data instances, their access paths and common ancestors. The revised PT approach is implemented on top of on a recent data generation tool, TAF. TAF mixes random sampling and constraint solving to produce diverse data from XML-based models. Our PT implementation interacts with TAF by inserting pair coverage constraints into the models. It monitors overall coverage progress by XPath queries on the data returned by TAF. The approach is demonstrated for two data models: a 3D scene for an agricultural robot, and a population of taxpayers for a tax management system.
Fichier principal
Vignette du fichier
pairwise_article_ICST_format (2).pdf (402.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03938378 , version 1 (13-01-2023)
hal-03938378 , version 2 (30-01-2023)


  • HAL Id : hal-03938378 , version 1


Luca Vittorio Sartori, Hélène Waeselynck, Jérémie Guiochet. Pairwise Testing Revisited for Structured Data With Constraints. International Conference on Software Testing, Verification and Validation (ICST), Apr 2023, Dublin, Ireland. ⟨hal-03938378v1⟩
0 View
0 Download


Gmail Facebook Twitter LinkedIn More