Name
Abstract | ||
|---|---|---|
A Software Product Line SPL is a set of similar programs generated from a common code base. Delta Oriented Programming DOP is a flexible approach to implement SPLs. Efficiently type checking an SPL i.e., checking that all its programs are well-typed is challenging. This paper proposes a novel type checking approach for DOP. Intrinsic complexity of SPL type checking is addressed by providing early detection of type errors and by reducing type checking to satisfiability of a propositional formula. The approach is tunable to exploit automatically checkable DOP guidelines for making an SPL more comprehensible and type checking more efficient. The approach and guidelines are formalized by means of a core calculus for DOP of product lines of Java programs. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-33693-0_4 | IFM |
Field | DocType | Volume |
Abstraction model checking,Model checking,Programming language,Type checking,Computer science,Satisfiability,Theoretical computer science,Exploit,Software product line,Java,Propositional formula | Conference | 9681 |
ISSN | Citations | PageRank |
0302-9743 | 10 | 0.47 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ferruccio Damiani | 1 | 989 | 71.30 |
| Michael Lienhardt | 2 | 75 | 8.24 |