Component Updates as a Boolean Optimization Problem | Zendy

Alexander Stuckenholz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Component Updates as a Boolean Optimization Problem

Author(s) -

Alexander Stuckenholz

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.09.039

Subject(s) - component (thermodynamics) , computer science , theoretical computer science , maximum satisfiability problem , boolean data type , optimization problem , boolean function , component based software engineering , interface (matter) , and inverter graph , software , algorithm , boolean expression , software system , programming language , parallel computing , physics , bubble , maximum bubble pressure method , thermodynamics

Component updates always bear the risk of negatively influencing the operativeness of software systems. Due to improper combinations of component versions, dependencies may break. In practise this often turns out to be due to missing or incompatible interfaces and signatures (syntactical interface) but may also be caused by changes in behavior or quality. In this paper we model the problem of finding a well-configured system consisting of multiple component versions as a Boolean Optimization Problem. To achieve this, we introduce objective functions and constraints that lead to most recent, minimal systems and use Branch-and-Bound to restrict the search space

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research