HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

On Software Component Co-Installability (extended version)

Abstract : Modern software systems are built by composing components drawn from large repositories, whose size and complexity is increasing at a very fast pace. A fundamental challenge for the maintainability and the scalability of such software systems is the ability to quickly identify the components that can or cannot be installed together: this is the co-installability problem, which is related to boolean satisfiability and is known to be algorithmically hard. This paper develops a novel theoretical framework, based on formally certified. semantic preserving graph-theoretic transformations, that allows to associate to each concrete component repository a much smaller one with a simpler structure, but with equivalent co-installability properties. This smaller repository can be represented graphically, giving a concise view of the co-installability issues in the original repository, or used as a basis for various algorithms related to co-installability, like the efficient computation of strong conflicts between components. The proofs contained in this work have been machine checked in Coq.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

Contributor : Jérôme Vouillon Connect in order to contact the contributor
Submitted on : Friday, July 1, 2011 - 6:20:26 PM
Last modification on : Saturday, March 28, 2020 - 2:20:03 AM
Long-term archiving on: : Monday, November 12, 2012 - 9:55:17 AM


Files produced by the author(s)


  • HAL Id : hal-00605491, version 1



Jérôme Vouillon, Roberto Di Cosmo. On Software Component Co-Installability (extended version). 2011. ⟨hal-00605491⟩



Record views


Files downloads