A Tutorial on Feature Oriented Programming and the AHEAD Tool Suite
Lecture notes in computer sciencePublished 1 January 2006
Don Batory
Citations75
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
AHEAD is a theory of FOP that is based on a fundamental concept of generative programming that functions map programs that enables the design of programs to be expressed compo sitionally as algebraic expressions, which are suited for automated analysis, manipulation, and program synthesis.
Abstract
Feature oriented programming (FOP) is the study of feature mod ularity and its use in program synthesis. AHEAD is a theory of FOP that is based on a fundamental concept of generative programming that functions map programs. This enables the design of programs to be expressed compo sitionally as algebraic expressions, which are suited for automated analysis, manipulation, and program synthesis. This paper is a tutorial on FOP and AHEAD. We review AHEAD's theory and the tool set that implements it.
Keywords
Computer Science
Feature-Oriented Domain Analysis (FODA) Feasibility Study
4,194 Citations1990Kyo C. Kang, Sholom Cohen +3 more
This report will establish methods for performing a domain analysis and describe the products of the domain analysis process, and provide a domain analysis of window management system software.
Access path selection in a relational database management system
2,153 Citations1979Patricia G. Selinger, M. M. Astrahan +3 more
This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins) given a user specification of desired data as a boolean expression of predicates.
Lecture notes in computer scienceFeature Models, Grammars, and Propositional Formulas
1,160 Citations2005Don Batory
This work integrates prior results to connect feature models, grammars, and propositional formulas, which allows arbitrary propositional constraints to be defined among features and enables off-the-shelf satisfiability solvers to debug feature models.
Communications of the ACMThe Cornell program synthesizer
709 Citations1981Tim Teitelbaum, Thomas Reps
The Cornell Program Synthesizer demands a structural perspective at all stages of program development and its separate features are unified by a common foundation: a grammar for the programming language.
IEEE Transactions on Software EngineeringScaling step-wise refinement
661 Citations2004Don Batory, Jacob Neal Sarvela +1 more
The AHEAD (algebraic hierarchical equations for application design) model is presented, that shows how step-wise refinement scales to synthesize multiple programs and multiple noncode representations, and a tool set that supports AHEAD is reviewed.
ACM Transactions on Software Engineering and MethodologyThe design and implementation of hierarchical software systems with reusable components
605 Citations1992Don Batory, Sean O’Malley
A domain-independent model of hierarchical software system design and construction that is based on interchangeable software components and large-scale reuse that is a blueprint for achieving software component technologies in many domains is presented.
IEEE Transactions on Software EngineeringA 15 Year Perspective on Automatic Programming
366 Citations1985Rosana Balzer
Automatic programming consists not only of an automatic compiler, but also some Means of acquiring the high-level specification to be compiled, some means of determining that it is the intended specification, and some (interactive) means of translating this high- level specification into a lower-level one which can be automatically compiled.
Hygienic macro expansion
309 Citations1986Eugene E. Kohlbecker, Daniel P. Friedman +2 more
A change to the expansion algorithm is proposed so that macros will only violate the binding discipline when it is explicitly intended.
Lecture notes in computer scienceA Standard Problem for Evaluating Product-Line Methodologies
195 Citations2001Roberto E. Lopez-Herrejon, Don Batory
This work proposes a standard problem to evaluate product-line methodologies using the GenVoca design methodology, and explains a series of modeling, implementation, and benchmarking issues that it encountered, so that others can understand and compare the solution with theirs.
IEEE Transactions on Software EngineeringComposition validation and subjectivity in GenVoca generators
164 Citations1997Don Batory, Bart J. Geraci
It is shown that the interfaces and bodies of GenVoca components are subjective, i.e., they mutate and enlarge upon instantiation, which enables software systems with customized interfaces to be composed from components with "standardized" interfaces.
ACM Transactions on Software Engineering and MethodologyAchieving extensibility through product-lines and domain-specific languages
164 Citations2002Don Batory, Clay Johnson +2 more
This case study in the use of product-line architectures and domain-specific languages to design an extensible command-and-control simulator for Army fire support shows how the PLA and DSL synergistically produce a more flexible way of implementing state-machine-based simulators than is possible with a pure Java implementation.
Lecture notes in computer scienceEvaluating Support for Features in Advanced Modularization Technologies
137 Citations2005Roberto E. Lopez-Herrejon, Don Batory +1 more
A variant of the expression problem as a canonical problem in product-line design reveals a set of technology-independent properties that feature modules should exhibit and suggests an abstract model of feature composition that is technology- independent and that relates compositional reasoning with algebraic reasoning.
Lecture notes in computer scienceThe Expression Problem Revisited
107 Citations2004Mads Torgersen
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: to which degree can an application be structured in such a way that both the data model and the set of virtual operations over it can be extended without the need to modify existing code.
A disciplined approach to aspect composition
101 Citations2006Roberto E. Lopez-Herrejon, Don Batory +1 more
An algebraic model is developed that relates aspects to program transformations and uncovers aspect composition as a significant source of the problems mentioned.
Generating product-lines of product-families
87 Citations2002Don Batory, Roberto E. Lopez-Herrejon +1 more
This work presents a mathematical model that explains relationships between layers and facets, and uses the model to develop a generator for tools that are used in language-extensible Integrated Development Environments (IDEs).
Refinements and multi-dimensional separation of concerns
84 Citations2003Don Batory, Jia Liu +1 more
This work presents new examples of multidimensional models: a micro example of a product-line and isomorphic macro examples (whose programs exceed 30K lines of code) and provides strong evidence that SWR scales to synthesis of large systems.
IEEE Transactions on Software EngineeringDesign wizards and visual programming environments for GenVoca generators
77 Citations2000Don Batory, Gang Chen +2 more
The authors present the P3 ContainerStore graphical language, its generator, and design wizard, which will provide front-ends to generators and related tools to produce customized code on demand.
The expression problem revisited: Four new solutions using generics
70 Citations2004Mads Torgersen
A fifteen-year perspective on automatic programming
17 Citations1989Rosana Balzer
Lecture notes in computer scienceThe Road to Utopia: A Future for Generative Programming
16 Citations2004Don Batory
This paper charts the successes and mindset used by database researchers to generate efficient query processing programs automatically and argues that the road that they have so successfully followed is the same road that the generative programming, domain-specific languages, and automatic programming communities are now traversing.
Lecture notes in computer scienceAutomatic Remodularization and Optimized Synthesis of Product-Families
14 Citations2004Jia Liu, Don Batory
It is shown how tools can be automatically remodularized so that shared files are identified and extracted into a common package, and how isomorphic class inheritance hierarchies can be merged into a single hierarchy.
Lecture notes in computer scienceWorkshop on Generative Programming 2002 (GP2002)
2 Citations2002Merijn de Jonge, Joost Visser
This work focuses on developing new domain-specific languages (DSLs), application generators, and component generators for generative programming, which requires being knowledgeable and experienced both in language design and compiler development.