Theoretical Computer Science
Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
FORM: A feature-oriented reuse method with domain-specific reference architectures
Annals of Software Engineering
Knowledge-Based Configuration: Survey and Future Directions
XPS '99 Proceedings of the 5th Biannual German Conference on Knowledge-Based Systems: Knowledge-Based Systems - Survey and Future Directions
Feature Diagrams and Logics: There and Back Again
SPLC '07 Proceedings of the 11th International Software Product Line Conference
An Approach to Domain-Specific Reuse in Service-Oriented Environments
ICSR '08 Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems
An Approach for Developing Service Oriented Product Lines
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Variation-Oriented Engineering (VOE): Enhancing Reusability of SOA-based Solutions
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
SOA Design Patterns
Composition of Semantic Web services using Linear Logic theorem proving
Information Systems
Automated analysis of feature models 20 years later: A literature review
Information Systems
Incremental service composition based on partial matching of visual contracts
FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
| Hi-index | 0.00 |
When matching services, we are caught in the tradeoff between precise specifications required to make dynamic binding safe and the lack of flexibility that comes with this precision. We propose to use feature modelling techniques to specify the variability of provided and required services, thus increasing the flexibility of the matching process. In particular, we address the matching of one required against several provided specifications, distinguishing between static matching, where all services are known in advance, and dynamic matching, where one provided service is matched at a time. After analysing the requirements for matching feature models in this context, we use an interpretation in linear logic to analyse their use in service specifications and matching.