使用布尔优化解决Linux可升级性问题
Solving Linux Upgradeability Problems Using Boolean Optimization
摘要：
管理软件包系统的软件复杂性可以被视为软件体系结构的主要挑战之一。需要在短时间内进行升级，预计系统在此之后将保持可靠和一致。对于系统中的每个包，必须考虑一组依赖关系和一组冲突。虽然这个问题在计算上很难解决，但需要有效的工具。在最好的情况下，提供的解决方案也应该是最佳的，以便更好地满足用户的需求和期望。本文介绍了两种不同的工具，都基于布尔可满足性（SAT），用于解决Linux可扩展性问题。这些工具的评估中使用的问题实例主要是从真实环境中获得的，并受到两个不同的字典优化标准。开发的工具可以为许多情况提供最佳解决方案，但仍然存在一些挑战。此外，我们的理解是，这个问题与其他配置问题有许多相似之处，因此相同的技术可以用于其他领域。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
