The Silent (R)evolution of SAT Page 1 THE PROPOSITIONAL SATISFIABILITY problem (SAT)
was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of …

Managing cross-project dependencies is tricky in modern software development. A primary
way to manage dependencies is using dependency configuration files, which brings …

When developing software packages in a software ecosystem, an important and well-known
challenge is how to deal with dependencies to other packages. In presence of multiple …

Container-based solutions, such as Docker, have become increasingly relevant in the
software industry to facilitate deploying and maintaining software systems. Little is known …

Abstract Reusable Open Source Software (OSS) components for major programming
languages are available in package repositories. Developers rely on package management …

Dependency solving is a hard (NP-complete) problem in all non-trivial component models
due to either mutually incompatible versions of the same packages or explicitly declared …

Code sharing and reuse is a widespread use practice in software engineering. Although a
vast amount of open-source Python code is accessible on many online platforms …

Developers usually suffer from d ependency m aze (DM) issues, ie, package dependency
constraints are violated when a project's platform or dependencies are changed. This …

Mobile device vendors develop their customized Android OS (termed downstream) based
on Google Android (termed upstream) to support new features. During daily independent …

While open-source software has enabled significant levels of reuse to speed up software
development, it has also given rise to the dreadful dependency hell that all software …