Abstract | ||
---|---|---|
The increasing complexity and cost of software-intensive systems has led developers to seek ways of increasing software reusability. One software reuse approach is to develop a Software Product-line (SPL), which is a reconfigurable software architecture that can be reused across projects. Creating configurations of the SPL that meets arbitrary requirements is hard. Existing research has focused on techniques that produce a configuration of the SPL in a single step. This paper provides three contributions to the study of multi-step configuration for SPLs. First, we present a formal model of multi-step SPL configuration and map this model to constraint satisfaction problems (CSPs). Second, we show how solutions to these CSP configuration problem CSPs can be derived automatically with a constraint solver. Third, we present empirical results demonstrating that our CSP-based technique can solve multi-step configuration problems involving hundreds of features in seconds. |
Year | Venue | Keywords |
---|---|---|
2009 | SPLC | software reuse approach,csp configuration problem csps,creating configuration,constraint solver,automated reasoning,multi-step configuration,multi-step spl configuration,constraint satisfaction problem,software reusability,multi-step configuration problem,reconfigurable software architecture,multi-step feature model configuration |
Field | DocType | Citations |
Automated reasoning,Reuse,Computer science,Theoretical computer science,Constraint satisfaction problem,Feature model,Software,Software architecture,Reusability | Conference | 51 |
PageRank | References | Authors |
1.79 | 12 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jules White | 1 | 662 | 45.87 |
Brian Dougherty | 2 | 386 | 22.16 |
Doulas C. Schmidt | 3 | 51 | 1.79 |
David Benavides | 4 | 436 | 30.52 |