The design and implementation of hierarchical software systems with reusable components
ACM Transactions on Software Engineering and Methodology (TOSEM)
Science of Computer Programming
Term rewriting and all that
Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
WALDMEISTER: High Performance Equational Theorem Proving
DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Eliminating distinctions of class: using prototypes to model virtual classes
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
ACM Transactions on Computational Logic (TOCL)
From implementation to theory in product synthesis
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FEATUREHOUSE: Language-independent, automated software composition
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Superimposition: a language-independent approach to software composition
SC'08 Proceedings of the 7th international conference on Software composition
An algebraic foundation for automatic feature-based program synthesis
Science of Computer Programming
Subclack: feature-oriented programming with behavioral feature interfaces
Proceedings of the 5th Workshop on MechAnisms for SPEcialization, Generalization and inHerItance
Hi-index | 0.00 |
Feature, algebra was introduced as an abstract framework for feature oriented software development. One goal is to provide a common, clearly defined basis for the key ideas of feature orientation. We first present concrete models for the original axioms of feature algebra which represent the main features of feature oriented programs. However, these models show that the axioms of the feature algebra do not reflect some aspects of feature orientation properly. Hence we modify the axioms and introduce the concept of an extended feature algebra. Since the extension is also a generalisation, the original algebra can be retrieved by a single additional axiom. Last but not least we introduce more operators to cover concepts like overriding in the abstract setting.