Constraint-based approaches to the covering test problem

DOI10.1007/11402763_13MaRDI QIDQ5703904zbMATH OpenOpenAlexFDO

Authors Brahim Hnich, Steven Prestwich, Evgeny Selensky

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106890

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Constraint models for the covering test problem
• Problems and algorithms for covering arrays
• Upper bounds for covering arrays by tabu search.

Cited in

(14)

• Bipartite locating array
• Optimality and constructions of locating arrays
• Locating and detecting arrays for interaction faults
• Maxx: Test pattern optimisation with local search over an extended logic
• Strength two covering arrays: existence tables and projection
• A constraint programming approach to extract the maximum number of non-overlapping test forms
• Lower bounds estimation of factor‐covering design sizes
• Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
• Non-uniform covering array with symmetric forbidden edge constraints
• Generating event-sequence test cases by answer set programming with the incidence matrix
• A Logic-Based Approach to Combinatorial Testing with Constraints
• A Set-Covering Approach to Customized Coverage Instrumentation
• A feature commonality-based search strategy to find high t-wise covering solutions in feature models
• Constraint models for the covering test problem

Describes a project that uses

Uses Software

• AETG

This page was built for publication: Constraint-based approaches to the covering test problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703904)