Computer Science – Logic in Computer Science
Scientific paper
2010-07-07
EPTCS 29, 2010, pp. 11-22
Computer Science
Logic in Computer Science
In Proceedings LoCoCo 2010, arXiv:1007.0831
Scientific paper
10.4204/EPTCS.29.2
Managing the software complexity of package-based systems can be regarded as one of the main challenges in software architectures. Upgrades are required on a short time basis and systems are expected to be reliable and consistent after that. For each package in the system, a set of dependencies and a set of conflicts have to be taken into account. Although this problem is computationally hard to solve, efficient tools are required. In the best scenario, the solutions provided should also be optimal in order to better fulfill users requirements and expectations. This paper describes two different tools, both based on Boolean satisfiability (SAT), for solving Linux upgradeability problems. The problem instances used in the evaluation of these tools were mainly obtained from real environments, and are subject to two different lexicographic optimization criteria. The developed tools can provide optimal solutions for many of the instances, but a few challenges remain. Moreover, it is our understanding that this problem has many similarities with other configuration problems, and therefore the same techniques can be used in other domains.
Argelich Josep
Berre Daniel Le
Lynce Inês
Marques-Silva Joao
Rapicault Pascal
No associations
LandOfFree
Solving Linux Upgradeability Problems Using Boolean Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solving Linux Upgradeability Problems Using Boolean Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Linux Upgradeability Problems Using Boolean Optimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-344752