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.
Type de document :
Pré-publication, Document de travail
2011
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00605491
Contributeur : Jérôme Vouillon <>
Soumis le : vendredi 1 juillet 2011 - 18:20:26
Dernière modification le : mardi 11 octobre 2016 - 13:55:43
Document(s) archivé(s) le : lundi 12 novembre 2012 - 09:55:17

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00605491, version 1

Collections

PPS | USPC

Citation

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

Partager

Métriques

Consultations de
la notice

244

Téléchargements du document

49