4.5 Article

Effectively computing high strength mixed covering arrays with constraints

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

Locating Hardware Trojans Using Combinatorial Testing for Cryptographic Circuits

Ludwig Kampel et al.

Summary: This paper presents a novel method for locating combinational hardware Trojans (HT) based on fault location approaches used in combinatorial testing. The method relies on the combinatorial properties of test vectors and test execution results to locate all combinational HTs efficiently. A concrete case study is conducted to demonstrate the effectiveness of the method in locating HTs embedded in a circuit implementing the AES symmetric-key encryption algorithm with 128 bits key length.

IEEE ACCESS (2022)

Article Computer Science, Artificial Intelligence

Incomplete MaxSAT approaches for combinatorial testing

Carlos Ansotegui et al.

Summary: The paper presents a SAT-based approach for building Mixed Covering Arrays with Constraints, known as the Covering Array Number problem, using MaxSAT technology. Efficient encodings for different classes of MaxSAT solvers allow for optimal and suboptimal solutions. Experimental evaluation confirms good performance compared to state-of-the-art tools.

JOURNAL OF HEURISTICS (2022)

Article Operations Research & Management Science

Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

Ludwig Kampel et al.

OPTIMIZATION LETTERS (2020)

Article Computer Science, Software Engineering

How does combinatorial testing perform in the real world: an empirical study

Linghuan Hu et al.

EMPIRICAL SOFTWARE ENGINEERING (2020)

Article Computer Science, Information Systems

WCA: A weighting local search for constrained combinatorial test optimization

Yingjie Fu et al.

INFORMATION AND SOFTWARE TECHNOLOGY (2020)

Article Computer Science, Software Engineering

CHiP: A Configurable Hybrid Parallel Covering Array Constructor

Hanefi Mercan et al.

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING (2019)

Editorial Material Computer Science, Hardware & Architecture

Combinatorial Methods in Security Testing

Dimitris E. Simos et al.

COMPUTER (2016)

Article Computer Science, Information Systems

Practical minimization of pairwise-covering test configurations using constraint programming

Aymeric Hervieu et al.

INFORMATION AND SOFTWARE TECHNOLOGY (2016)

Article Computer Science, Hardware & Architecture

Using Satisfiability Solving for Pairwise Testing in the Presence of Constraints

Toru Nanba et al.

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES (2012)

Article Engineering, Multidisciplinary

New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing

Himer Avila-George et al.

MATHEMATICAL PROBLEMS IN ENGINEERING (2012)

Article Computer Science, Theory & Methods

A Survey of Combinatorial Testing

Changhai Nie et al.

ACM COMPUTING SURVEYS (2011)

Article Computer Science, Software Engineering

Constructing interaction test suites for highly-configurable systems in the presence of constraints: A greedy approach

Myra B. Cohen et al.

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING (2008)

Article Computer Science, Software Engineering

IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing

Yu Lei et al.

SOFTWARE TESTING VERIFICATION & RELIABILITY (2008)

Article Computer Science, Artificial Intelligence

Constraint models for the covering test problem

Brahim Hnich et al.

CONSTRAINTS (2006)

Article Computer Science, Software Engineering

Software fault interactions and implications for software testing

DR Kuhn et al.

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING (2004)