Automated Requirements-based Generation of Test Cases for Product Families

Software product families (PF) are becoming one of the key challenges of software engineering. Despite recent interest in this area, the extent to which the close relationship between PF and requirements engineering is exploited to guide the V&V tasks is still limited. In particular, PF processes generally lack support for generating test cases from requirements. In this paper, we propose a requirements-based approach to functional testing of product lines, based on a formal test generation tool. Here, we outline how product-specific test cases can be automatically generated from PF functional requirements expressed in UML. We study the efficiency of the generated test cases on a case study

Variability Abstractions: Trading Precision for Speed in Family-Based Analyses (Extended Version)

Family-based (lifted) data-flow analysis for Software Product Lines (SPLs) is capable of analyzing all valid products (variants) without generating any of them explicitly. It takes as input only the common code base, which encodes all variants of a SPL, and produces analysis results corresponding to all variants. However, the computational cost of the lifted analysis still depends inherently on the number of variants (which is exponential in the number of features, in the worst case). For a large number of features, the lifted analysis may be too costly or even infeasible. In this paper, we introduce variability abstractions defined as Galois connections and use abstract interpretation as a formal method for the calculational-based derivation of approximate (abstracted) lifted analyses of SPL programs, which are sound by construction. Moreover, given an abstraction we define a syntactic transformation that translates any SPL program into an abstracted version of it, such that the analysis of the abstracted SPL coincides with the corresponding abstracted analysis of the original SPL. We implement the transformation in a tool, reconfigurator that works on Object-Oriented Java program families, and evaluate the practicality of this approach on three Java SPL benchmarks.Comment: 50 pages, 10 figure

A product structure on Generating Family Cohomology for Legendrian Submanifolds

One way to obtain invariants of some Legendrian submanifolds in 1-jet spaces $J^1M$, equipped with the standard contact structure, is through the Morse theoretic technique of generating families. This paper extends the invariant of generating family cohomology by giving it a product $\mu_2$. To define the product, moduli spaces of flow trees are constructed and shown to have the structure of a smooth manifold with corners. These spaces consist of intersecting half-infinite gradient trajectories of functions whose critical points correspond to Reeb chords of the Legendrian. This paper lays the foundation for an $A_\infty$ algebra which will show, in particular, that $\mu_2$ is associative and thus gives generating family cohomology a ring structure.Comment: 50 pages, 4 figures, minor change

BKM Lie superalgebra for the Z_5 orbifolded CHL string

We study the Z_5-orbifolding of the CHL string theory by explicitly constructing the modular form tilde{Phi}_2 generating the degeneracies of the 1/4-BPS states in the theory. Since the additive seed for the sum form is a weak Jacobi form in this case, a mismatch is found between the modular forms generated from the additive lift and the product form derived from threshold corrections. We also construct the BKM Lie superalgebra, tilde{G}_5, corresponding to the modular form tilde{Delta}_1 (Z) = tilde{Phi}_2 (Z)^{1/2} which happens to be a hyperbolic algebra. This is the first occurrence of a hyperbolic BKM Lie superalgebra. We also study the walls of marginal stability of this theory in detail, and extend the arithmetic structure found by Cheng and Dabholkar for the N=1,2,3 orbifoldings to the N=4,5 and 6 models, all of which have an infinite number of walls in the fundamental domain. We find that analogous to the Stern-Brocot tree, which generated the intercepts of the walls on the real line, the intercepts for the N >3 cases are generated by linear recurrence relations. Using the correspondence between the walls of marginal stability and the walls of the Weyl chamber of the corresponding BKM Lie superalgebra, we propose the Cartan matrices for the BKM Lie superalgebras corresponding to the N=5 and 6 models.Comment: 30 pages, 2 figure

Variability Abstractions: Trading Precision for Speed in Family-Based Analyses

Family-based (lifted) data-flow analysis for Software Product Lines (SPLs) is capable of analyzing all valid products (variants) without generating any of them explicitly. It takes as input only the common code base, which encodes all variants of a SPL, and produces analysis results corresponding to all variants. However, the computational cost of the lifted analysis still depends inherently on the number of variants (which is exponential in the number of features, in the worst case). For a large number of features, the lifted analysis may be too costly or even infeasible. In this paper, we introduce variability abstractions defined as Galois connections and use abstract interpretation as a formal method for the calculational-based derivation of approximate (abstracted) lifted analyses of SPL programs, which are sound by construction. Moreover, given an abstraction we define a syntactic transformation that translates any SPL program into an abstracted version of it, such that the analysis of the abstracted SPL coincides with the corresponding abstracted analysis of the original SPL. We implement the transformation in a tool, that works on Object-Oriented Java program families, and evaluate the practicality of this approach on three Java SPL benchmarks