SEApr 13, 2012
Tackling the testing migration problem with SAT-Solvers
arXiv:1204.2974v12 citations
Originality Synthesis-oriented
AI Analysis
This addresses a specific software engineering problem for developers, but appears incremental as it applies an existing method (SAT-solvers) to a new domain.
The authors tackled the testing migration problem by formulating it as a practically solvable PMAX-SAT instance, achieving feasibility through sensible pre-processing of package dependencies and conflicts.
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.