Since their introduction into software testing in the mid-1980s, combinatorial methods for test
design gathered popularity as a testing best practice and as a prominent software testing …

We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with
Constraints of minimum length, referred to as the Covering Array Number problem. This …

Combinatorial Testing (CT) is a potentially powerful testing technique, whereas its failure
revealing ability might be dramatically reduced if it fails to handle constraints in an adequate …

The TLS protocol is the standard for secure Internet communication between two parties.
Unfortunately, there have been recently successful attacks like DROWN, ROBOT, or …

Constraints depict the dependency relationships between parameters in a software system
under test. Because almost all systems are constrained in some way, techniques that …

In the pursuit of software quality, testing plays a pivotal role in identifying and rectifying
errors and defects before software is delivered to users. However, the increasing complexity …

A locating array is a mathematical object that is intended to be used for fault localization in
combinatorial interaction testing. However, applying it to a real-world testing is difficult …

The TLS protocol is the standard for secure Internet communication between two parties.
Unfortunately, there have been recently successful attacks like DROWN or BREACH that …

The effective construction of covering arrays for interaction testing relies on fast, practical
algorithms. Such algorithms are needed to directly construct covering arrays and variants …

Covering arrays have become a key piece in Combinatorial Testing. In particular, we focus
on the efficient construction of Covering Arrays with Constraints of high strength. SAT solving …