A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays
-
Updated
Aug 22, 2023 - C++
A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays
Wrapper over the Tcases tool to make a runnable jar
Automatizované testování a dynamická analýza - Projekt - Návrh automatizované testovací sady - Řízení vozíku v robotické továrně
Replication Package for Applying Combinatorial Testing for the Body Sensor Network: An Experience Report
Automated Testing and Dynamic Analysis - Project - Design of an automated test set - Truck control in a robotic factory
One-wise combinatorial testing generator for JavaScript
A model-based test case generator
Playing with rapidcheck
Pipesmith is a Python utility class that helps you create pipelines of different steps (functions or other callable objects), by combining them and applying conditions.
An adaptive based parallel tabu search algorithm for CCAG
Simulated annealing for obtaining locating arrays
A reference implementation of constrained covering array generation
This repository is part of the paper "Better Safe Than Sorry! Automated Identification of Breaking Security-Configuration Rules" accepted at the "4th ACM/IEEE International Conference on Automation of Software Test (AST)". https://conf.researchr.org/home/ast-2023
A pairwise test case generator
Dockerized Pairwise Independent Combinatorial Testing
Covering array generator for combinatorial testing
Test Case Design
Parameterization solution that enables a regular JUnit test to make itself parameterized by introducing parameters in midair during the test execution
Combinatorial Test Case Generation
One-wise combinatorial testing generator for JavaScript
Add a description, image, and links to the combinatorial-testing topic page so that developers can more easily learn about it.
To associate your repository with the combinatorial-testing topic, visit your repo's landing page and select "manage topics."