On Software Component Co-installability

Autor: Jérôme Vouillon, Roberto Di Cosmo
Přispěvatelé: Preuves, Programmes et Systèmes (PPS), Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), European Project: 214898,EC:FP7:ICT,FP7-ICT-2007-1,MANCOOSI(2008)
Jazyk: angličtina
Rok vydání: 2013
Předmět:
Zdroj: ACM Transactions on Software Engineering and Methodology
ACM Transactions on Software Engineering and Methodology, Association for Computing Machinery, 2013, 22 (4), pp.34. ⟨10.1145/2522920.2522927⟩
ESEC/FSE
ESEC/FSE, Sep 2011, France. pp.n-a, ⟨10.1145/2025113.2025149⟩
SIGSOFT FSE
ISSN: 1049-331X
DOI: 10.1145/2522920.2522927⟩
Popis: 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 article develops a novel theoretical framework, based on formally certified semantic preserving graph-theoretic transformations, that allows us to associate to each concrete component repository a much smaller one with a simpler structure, that we call strongly flat , with equivalent co-installability properties. This flat repository can be displayed in a way that provides 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 using the Coq proof assistant.
Databáze: OpenAIRE
Externí odkaz: