Lungu, Mircea; Robbes, Romain; Lanza, Michele (2010). Recovering Inter-Project Dependencies in Software Ecosystems. In: IEEE/ACM international conference on Automated software engineering (pp. 309-312). ACM Press 10.1145/1858996.1859058
Text
p309-lungu.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (390kB) |
In large software systems, knowing the dependencies between modules or components is critical to assess the impact of changes. To recover the dependencies, fact extractors analyze the system as a whole and build the dependency graph, parsing the system down to the statement level. At the level of software ecosystems, which are collections of software projects, the dependencies that need to be recovered reside not only within the individual systems, but also between the libraries, frameworks, and entire software systems that make up the complete ecosystem; scaling issues arise. In this paper we present and evaluate several variants of a lightweight and scalable approach to recover dependencies between the software projects of an ecosystem. We evaluate our recovery algorithms on the Squeak 3.10 Universe, an ecosystem containing more than 200 software projects.
Item Type: |
Conference or Workshop Item (Paper) |
---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) 08 Faculty of Science > Institute of Computer Science (INF) > Software Composition Group (SCG) [discontinued] |
UniBE Contributor: |
Lungu, Mircea |
Subjects: |
000 Computer science, knowledge & systems 500 Science > 510 Mathematics |
ISBN: |
978-1-4503-0116-9 |
Publisher: |
ACM Press |
Language: |
English |
Submitter: |
Anja Ebeling |
Date Deposited: |
23 Aug 2017 16:13 |
Last Modified: |
11 Apr 2024 16:11 |
Publisher DOI: |
10.1145/1858996.1859058 |
BORIS DOI: |
10.7892/boris.104618 |
URI: |
https://boris.unibe.ch/id/eprint/104618 |