Variation Programming with the Choice Calculus

Exploring variability-aware execution for testing plugin-based web applications

“…Helper function createChoice performs some simplifications of the representation (lines [11][12][13][14][15][16][17][18][19][20][21][22]. Second, loading a variable's value in a given context φ (lines 7-10) is done by finding values in the variable's MultiValue that satisfy context φ via function extract (lines [24][25][26][27][28][29][30][31][32]. It recursively extracts values from the two branches of a Choice by eliminating branches unsatisfiable to φ .…”

“…A community of researchers has investigated how to perform type checking [33,40,21,51], model checking [23,39], data-flow analysis [16,15,40], and other analyses [26,34] on multiple compile-time configurations of a system at a time. This community has explored how to represent and reason about partial but finite configuration spaces compactly with BDDs or SAT solvers (as used in our variability contexts) [14,33,41], how to represent choices of structures [28] and in complex structures [29,40]. For an overview of the field see a recent survey [52].…”

Morpheus: Variability-Aware Refactoring in the Wild

“…The key to variability-aware refactoring is the introduction of variability into data structures and algorithms that are used by the refactoring engine [58], [19], [62]. In this section, we briefly introduce variational data structures (Sections III-A and III-B), and describe the development of a refactoring engine, which is a novel contribution (Section III-C).…”

An abstract representation of variational graphs

“…Additionally, we have introduced the idea of variational data structures, and described how to extend algebraic data types with choice calculus-based variation [11]. One difference between the choice calculus and this work is that dimensions of variation can be locally scoped in the choice calculus, while they are globally defined in the decision structure corresponding to a variational graph.…”