Please use this identifier to cite or link to this item:
|Title:||Avoiding some common preprocessing pitfalls with feature queries|
|Authors:||Jarzabek, S. |
|Citation:||Jarzabek, S., Xue, Y., Zhang, H., Lee, Y. (2009). Avoiding some common preprocessing pitfalls with feature queries. Proceedings - Asia-Pacific Software Engineering Conference, APSEC : 283-290. ScholarBank@NUS Repository. https://doi.org/10.1109/APSEC.2009.61|
|Abstract:||Preprocessors (e.g., cpp) provide simple means to manage software product variants by including/excluding required feature code to/from base program. Feature-related customizations occur at variation points in base program marked with preprocessing directives. Problems emerge when the number of inter-dependent features grows, and each feature maps to many variation points in many base program components. Component-based and architecture-centric techniques promoted by a Software Product Line approach to reuse help us contain the impact of some features in small number of base components. Still, accommodating other features into product variants requires fine granular code changes in many components, at many variation points. Fine granular code level changes are often handled by preprocessors, which becomes a source of well-known complications during component customization for reuse. In this paper, we show how some of the common preprocessing problems can be alleviated with a query-based environment that assists programmers in analysis of features handled with preprocessor's directives. We describe problems of preprocessing that can be aided by tool like ours, and problems that we believe are inherent in approaches that attempt to manage features in the base code. © 2009 IEEE.|
|Source Title:||Proceedings - Asia-Pacific Software Engineering Conference, APSEC|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.