| | |
Summary: Type-checking Software Product Lines
A Formal Approach
Christian Kästner
School of Computer Science
University of Magdeburg
39106 Magdeburg, Germany
kaestner@iti.cs.uni-magdeburg.de
Sven Apel
Dept. of Informatics and Mathematics
University of Passau
94030 Passau, Germany
apel@uni-passau.de
Abstract--A software product line (SPL) is an efficient means
to generate a family of program variants for a domain from
a single code base. However, because of the potentially high
number of possible program variants, it is difficult to test all
variants and ensure properties like type-safety for the entire SPL.
While first steps to type-check an entire SPL have been taken,
they are informal and incomplete. In this paper, we extend the
Featherweight Java (FJ) calculus with feature annotations to be
|
