FOSD program cubes

In feature-oriented software development, feature-oriented software development program cubes (FOSD program cubes) are n-dimensional arrays of functions (program transformations) that represent n-dimensional product lines. A program is a composition of features: a base program is augmented with increments in program functionality, called features, to produce a complex program. A software product line (SPL) is a family of related programs. A typical product line has F₀ as a base program, and F₁..F_n as features that could be added to F₀. Different compositions of features yield different programs.

Let + denote the feature composition operation. A program P in SPL might have the following expression:

: P = F₈ + F₄ + F₂ + F₁ + F₀

That is, P extends program F₀ with features F₁, F₂, F₄, and F₈ in this order.

We can recast P in terms of a projection and contraction of a 1-dimensional array.

Let F_i = [F₀ .. F_n] denote the array of features used by a product line. A projection of F_i eliminates

unneeded features, yielding a shorter array (call it) G_i. A contraction of G_i sums each G_i in a specific order, to yield a scalar expression. The expression for P becomes:

: $P = \sum_{i=(0,1,2,4,8)} \mathbf{F}_i$

where the index values accomplish projection and summation is array contraction. This idea

generalizes to n-dimensional arrays that model multi-dimensional product lines.

Multi-dimensional product lines

Image:Kube.jpg

A multi-dimensional product line is described by multiple interacting sets of features.{{cite web| title=Generating Product-Lines of Product-Families | archive-url=https://web.archive.org/web/20170706014148/ftp://ftp.cs.utexas.edu/pub/predator/Origami.pdf | archive-date=2017-07-06 | url-status=dead | url=ftp://ftp.cs.utexas.edu/pub/predator/Origami.pdf}}

{{cite web| title=Refinements and Multi-Dimensional Separation of Concerns | archive-url=https://web.archive.org/web/20170706014145/ftp://ftp.cs.utexas.edu/pub/predator/OrigamiMDSC.pdf | archive-date=2017-07-06 | url-status=dead | url=ftp://ftp.cs.utexas.edu/pub/predator/OrigamiMDSC.pdf}}

{{cite web | title=Scaling Step-Wise Refinement | archive-url=https://web.archive.org/web/20170706122700/ftp://ftp.cs.utexas.edu/pub/predator/TSE-AHEAD.pdf | archive-date=2017-07-06 | url-status=dead | url=ftp://ftp.cs.utexas.edu/pub/predator/TSE-AHEAD.pdf}}

{{cite web| title=Evaluating Support for Features in Advanced Modularization Technologies | archive-url=https://web.archive.org/web/20170706122152/ftp://ftp.cs.utexas.edu/pub/predator/ECOOP2005.pdf | archive-date=2017-07-06 | url-status=dead | url=ftp://ftp.cs.utexas.edu/pub/predator/ECOOP2005.pdf}}

As an elementary 2D example, it is easy to create a product line of calculators, where

variants offer different sets of operations. Another variation

might offer different presentation front ends to calculators, one with no GUI, another

with a Java GUI, a third with a web GUI. These variations interact:

each GUI representation references a specific calculator operation, so each GUI

feature cannot be designed independently of its

calculator feature. Such a design leads to a matrix: columns represent increments in

calculator functionality, and rows represent different presentation front-ends. Such a matrix M is shown to the right: columns allow one to pair

basic calculator functionality (base) with optional logarithmic/exponentiation (lx)

and trigonometric (td) features. Rows allow one to pair core functionality with no

front-end (core), with optional GUI (gui) and web-based (web) front-ends.

An element M_ij implements the interaction of column feature i and row feature j.

For example, the element labeled cb is a base program that implements the core functionality of a calculator. Element gb adds code that displays the core functionality as a GUI; element wb adds code that displays the core functionality via the web. Similarly, element ct adds trigonometric code to the core calculator functionality; elements gt and wt add code to display the trigonometric functionality as a GUI and web front-ends.

A calculator is uniquely specified by two sequences of features: one sequence defines the calculator functionality, the other the front-end.

For example, calculator C that offers both base and trig functionality in a web format

is defined by the expression:

: $C = M_{cb} + M_{ct} + M_{wb} + M_{wt} = \sum_{i=(core,web) \atop j=(base,td)} \mathbf{M}_{ij}$

: Note: Each dimension is a collection of base programs and features. Not all of their compositions are meaningful. A feature model defines the legal combinations of features. Thus, each dimension would have its own feature model. It is possible that selected features along one dimension may preclude or require features along other dimensions. In any case, these feature models define the legal combinations of features in a multidimensional product line.

Cubes

In general, a cube is an n-dimensional array. The rank of a cube is its dimensionality.

A scalar is a cube of rank 0, a vector is a cube of rank 1, and a matrix is

rank 2. Following tensor notation: the number of indices a cube has designates

its rank. A scalar S is rank 0 (it has no indices), V_k is a vector (rank

1), M_ij is a matrix (rank 2), C_ijk is a cube (rank 3).

Program Cubes are n-dimensional arrays of functions

(program transformations) that represent n-dimensional product lines.

The values along each axis

of a cube denote either a base program or a feature that could elaborate a base program.

The rank of a product line is the rank of its cube.

: Note: program cubes are inspired by tensors and data cubes in databases. The primary difference is that data cube elements are numerical values that are added during cube contraction; program cube elements are transformations that are composed. Both use tensor notations and terminology.

A program in an n-dimensional SPL is uniquely specified by n sequences of features S₁..S_n, one per dimension.

The design of a program is a scalar (expression) that is formed by (1) projecting the cube

of its unneeded elements, and (2) contracting the resultant kcube to a scalar:

: $P = \sum_ { i_1 = S_1 \dots i_n = S_n} \mathbf{K}_{i_1 \dots i_n}$

Program generation is evaluating the scalar expression to produce program P.

An interesting property of cube design is that the order in which dimensions are contracted does not

matter—any permutation of dimensions during contraction results in a different

scalar expression (i.e. a different program design), but all expressions produce the

same value (program). For example, another expression (design) to produce calculator C contracts

dimensions in the opposite order from its original specification:

: C = M_cb + M_wb + M_ct + M_wt

Or more generally:

: $P = \sum_{ i_n = S_n \dots i_1 = S_1} \mathbf{K}_{i_1 \dots i_n}$

: Note: Underlying cube designs is a commutative diagram, such that there are an exponential number of paths from the empty program 0 to program P. Each path denotes a particular contraction of a cube, and corresponds to a unique incremental design of P. Included among these paths are cube aggregations that contract cubes using different dimensional orders.

The significance of program cubes is that it provides a structured way in which to

express and build multi-dimensional models of SPLs. Further, it provides scalable

specifications. If each dimension has k values, an n-cube specification of a program

requires O(kn) terms, as opposed to O(kⁿ) cube elements that would otherwise

have to be identified and then composed. In general, cubes provide a compact way

to specify complex programs.

Applications

The expression problem (a.k.a. the 'extensibility problem) is a fundamental problem in programming languages aimed at type systems that can add new classes and methods to a program in a type-safe manner.

{{cite book

| title=User-defined types and procedural data structures as complementary approaches to data abstraction

}}

{{cite web

| title=Object-Oriented Programming versues Abstract Data Types

| url=http://www.cs.utexas.edu/users/wcook/papers/OOPvsADT/CookOOPvsADT90.pdf

}}

{{cite web

| title=The Expression Problem

| url=http://www.daimi.au.dk/~madst/tool/papers/expression.txt

}}

{{cite web

| title=Synthesizing Object-Oriented and Functional Design to Promote Re-Use

| url=http://citeseer.ist.psu.edu/krishnamurthi98synthesizing.html

}}

It is also a fundamental problem in multi-dimensional SPL design. The expression problem is an example of an SPL of rank 2. The following applications either explain/illustrate the expression problem or show how it scales to product lines of large programs. EP is really a SPL of ~30 line programs; the applications below show how these ideas scale to programs of >30K lines (a 10³ increase in size).

[https://web.archive.org/web/20170706122152/ftp://ftp.cs.utexas.edu/pub/predator/ECOOP2005.pdf Expression Problem]
[http://www.cs.utexas.edu/users/schwartz/ATS/EPL/index.html Illustration of Small Expression Problem]
[https://web.archive.org/web/20170706014148/ftp://ftp.cs.utexas.edu/pub/predator/Origami.pdf Extensible IDEs]
[https://web.archive.org/web/20170706014145/ftp://ftp.cs.utexas.edu/pub/predator/OrigamiMDSC.pdf Multi-Dimensional Separation of Concerns]
[https://web.archive.org/web/20170706122700/ftp://ftp.cs.utexas.edu/pub/predator/TSE-AHEAD.pdf Calculator Product Line]

Also, FOSD metamodels can be viewed as special cases of program cubes.

References

Category:Feature-oriented programming