PackUp: Tools for Package Upgradability Solving

This paper presents PackUp (PACKage UPgradability with Boolean formulations) a framework for solving the the software package upgradability problem. Earlier versions of the framework (cudf2msu, cudf2pbo) participated in the 3rd MISC-live, an international competition organized by the European project MANCOOSI. The framework encodes the problem as a weighted partial MaxSAT formula and invokes a dedicated solver to solve the formula. The framework supports two types of solvers: weighted partial MaxSAT solvers and optimization pseudo-Boolean (OPB) solvers. The paper discusses the design of the framework and the specifics of the problem encoding.

[1]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[2]  Sorin Lerner,et al.  OPIUM: Optimal Package Install/Uninstall Manager , 2007, 29th International Conference on Software Engineering (ICSE'07).

[3]  Mutsunori Banbara,et al.  Compiling finite linear CSP into SAT , 2006, Constraints.

[4]  Vasco M. Manquinho,et al.  Algorithms for Weighted Boolean Optimization , 2009, SAT.

[5]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

[6]  Roberto Di Cosmo,et al.  Managing the Complexity of Large Free and Open Source Package-Based Software Distributions , 2006, 21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06).

[7]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[8]  Josep Argelich,et al.  Solving Linux Upgradeability Problems Using Boolean Optimization , 2010, LoCoCo.