Tackling the testing migration problem with SAT-Solvers
classification
💻 cs.SE
keywords
migrationproblemtestingconflictsdependenciesfeasibleformulateinstance
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.