Tackling the testing migration problem with SAT-Solvers

TL;DR

This paper demonstrates that the testing migration problem can be effectively formulated as a PMAX-SAT problem, enabling practical solutions through pre-processing of package dependencies and conflicts.

Contribution

It introduces a novel formulation of the testing migration problem as a PMAX-SAT instance, making it more solvable in practice.

Findings

Feasible to model testing migration as PMAX-SAT

Pre-processing dependencies and conflicts improves solvability

Practical solutions achieved for complex migration scenarios

Abstract

We show that it is feasible to formulate the testing migration problem as a practically solvable PMAX-SAT instance, when package dependencies and conflicts are pre-processed sensibly.