Combinatorial Testing for Tree-Structured Test Models with Constraints

Kitamura, Takashi; Yamada, Akihisa; Hatayama, Goro; Artho, Cyrille; Choi, Eun-Hye; Bich, Ngoc Thi; Oiwa, Yutaka; Sakuragi, Shinya

doi:10.1109/qrs.2015.29

Cited by 9 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An earlier study provided by van Deursen et al [9] puts practical lessons learned to the smells of code and can be very helpful when KVmaps cannot be employed. Kitamura et al [10] provide graphical notations for modeling tests in combinatorial testing tailored for tree-structured strategies. Although their scope is different, their approach can be extended to discuss permutation testing based on KV-maps in the future.…”

Section: Related Work and State Of The Artmentioning

confidence: 99%

Karnaugh-Veitch Maps as Minimal Formal Contract between Textual Requirements and Tests: A Use-Case Based Technical Analysis

Müllner

2022

Electronics

View full text Add to dashboard Cite

Checking that requirements written in natural language hold for a formally implemented system is a complex task. Test steps are commonly implemented manually from the requirements. This process is inherently prone to mistakes, as test cases are complex and need to be analyzed sequentially to check which input/output combinations are tested (although tools allow for explicit tracing). Utilizing Karnaugh–Veitch maps as minimal formal contract between informal requirements and implemented test steps improves this process. KV-maps provide the requirements in a computer-editable way, as they correspond to Boolean formulas. KV-maps further allow to define which test steps are relevant. With both requirements and relevance specification at hand, test steps are automatically generated. The approach is applied on a real-world industrial use-case—a train control management system. Although being generally amenable to permutation testing, the selected use-case emphasizes the potential of the method. The method successfully demonstrates its benefits and may help to disclose flaws in the current manually implemented tests.

show abstract

Section: Related Work and State Of The Artmentioning

confidence: 99%

Karnaugh-Veitch Maps as Minimal Formal Contract between Textual Requirements and Tests: A Use-Case Based Technical Analysis

Müllner

2022

Electronics

View full text Add to dashboard Cite

show abstract

“…The tree must be flattened to obtain a set of parameters with their choices, so that CT tools can be used [9]. If the tree has constraints (e.g., a constraint on the presence of related nodes), the flattening algorithm must take care that the node-level constraints are translated into parameter-level ones [10].…”

Section: Introductionmentioning

confidence: 99%

Pairwise Testing Revisited for Structured Data With Constraints

Sartori

Waeselynck

Guiochet

2023

2023 IEEE Conference on Software Testing, Verification and Validation (ICST)

View full text Add to dashboard Cite

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.

show abstract