Bootstrapping software distributions

CBSE 2013 - Proceedings of the 16th ACM SIGSOFT Symposium on Component Based Software Engineering

Volumn , Issue , 2013, Pages 131-141

  Abate, Pietro ^a   Schauer, Johannes ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b JACOBS UNIVERSITY BREMEN   (Germany)

Author keywords

Bootstrapping; Dependency graph; Feedback arc set; FOSS distribution

Indexed keywords

BOOTSTRAPPING; DEPENDENCY GRAPHS; FEEDBACK ARC SETS; FOSS DISTRIBUTION; HARDWARE ARCHITECTURE; MANUAL PROCESS; PROPRIETARY SOFTWARE; SOFTWARE DISTRIBUTIONS;

ENGINEERING; INDUSTRIAL ENGINEERING;

SOFTWARE ENGINEERING;

EID: 84880548590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2465449.2465461     Document Type: Conference Paper

References (17)

1. P. Abate, J. Boender, R. Di Cosmo, and S. Zacchiroli. Strong dependencies between software components. In International Symposium on Empirical Sofware Engineering and Measurement, pages 89-99. IEEE, 2009.
2. P. Abate, R. D. Cosmo, R. Treinen, and S. Zacchiroli. Dependency solving: A separate concern in component evolution management. Journal of Systems and Software, 85(10):2228-2240, 2012.
3. P. Abate, R. D. Cosmo, R. Treinen, S. Zacchiroli, and S. Zacchiroli. Learning from the future of component repositories. In CBSE, pages 51-60, 2012.
4. P. Abate, R. Treinen, R. D. Cosmo, S. Zacchiroli, J. Boender, and J. Zwolakowski. dose3. http://mancoosi.org/software/#index2h1.
5. H. Abdeen, S. Ducasse, H. Sahraoui, and I. Alloui. Automatic package coupling and cycle minimization. In Reverse Engineering, 2009. WCRE'09. 16th Working Conference on, pages 103-112. IEEE, 2009.
6. A. W. Appel. Axiomatic bootstrapping: A guide for compiler hackers. ACM Trans. Program. Lang. Syst., 16(6):1699-1718, 1994.
7. C. Chambers, J. Dean, and D. Grove. Frameworks for intra-and interprocedural dataflow analysis. Citeseer, Washington University, technical report, 1996.
8. P. Clements and L. Northrop. Software Product Lines: Practices and Patterns. SEI Series in Software Engineering. Addison-Wesley, 2002.
9. R. D. Cosmo and S. Zacchiroli. Feature diagrams as package dependencies. In SPLC, pages 476-480, 2010.
10. E. Hautus. Improving java software through package structure analysis. In The 6th IASTED International Conference Software Engineering and Applications, 2002.
11. G. F. Italiano, L. Laura, and F. Santaroni. Finding strong bridges and strong articulation points in linear time. Theoretical Computer Science, 447(0):74 - 84, 2012. Combinational Algorithms and Applications (COCOA 2010).
12. D. B. Johnson. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, 4(1):77-84, 1975.
13. R. M. Karp. Reducibility among combinatorial problems. 50 Years of Integer Programming 1958-2008, pages 219-241, 2010.
14. J. Laval, S. Denier, S. Ducasse, et al. Cycles assessment with cycletable. 2011.
15. F. Mancinelli, J. Boender, R. Di Cosmo, J. Vouillon, B. Durak, X. Leroy, and R. Treinen. Managing the complexity of large free and open source package-based software distributions. In ASE, pages 199-208, 2006.
16. H. Melton and E. Tempero. An empirical study of cycles among classes in java. Empirical Software Engineering, 12(4):389-415, 2007.
17. H. Melton and E. Tempero. Jooj: Real-time support for avoiding cyclic dependencies. In G. Dobbie, editor, Thirtieth Australasian Computer Science Conference (ACSC2007), volume 62 of CRPIT, pages 87-95, Ballarat Australia, 2007. ACS.