A new polynomial-time algorithm for linear programming
Combinatorica
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Inside COM
Version models for software configuration management
ACM Computing Surveys (CSUR)
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
Maximum RPM
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Making Components Contract Aware
Computer
Enterprise-Scale CBD: Building Complex Computer Systems from Components
STEP '99 Proceedings of the Software Technology and Engineering Practice
Component evolution and versioning state of the art
ACM SIGSOFT Software Engineering Notes
A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compatible component upgrades through smart component swapping
Proceedings of the 2004 international conference on Architecting Systems with Trustworthy Components
| Hi-index | 0.00 |
Component updates always imply the risk of negatively influencing the operability of software systems. Because of wrong combinations of component versions, dependencies might break, methods which do no longer exist, might be called or methods might not be compatible to provided interfaces, objects, or classes. In this paper we model the problem of finding a well-configured system consisting of multiple component versions as a Boolean Optimization Problem. We introduce objective functions and constraints, which use Branch-and-Bound for restricting the search space and yield most recent, minimal systems.