Write a Blog >>
GPCE 2019
Sun 20 - Fri 25 October 2019 Athens, Greece
co-located with SPLASH 2019
Tue 22 Oct 2019 14:00 - 14:30 at Ground floor conference room - Product lines Chair(s): Guido Salvaneschi

Many software systems are today variational. They can produce a potentially large variety of related programs (variants) by selecting suitable configuration options (features) at compile time. Specialized variability-aware (lifted, family-based) static analyses allow analyzing all variants of the family, simultaneously, in a single run without generating any of the variants explicitly. The elements of the lifted analysis domain represent tuples (i.e. disjunction of properties), which maintain one property from an existing single-program analysis domain per variant. Nevertheless, explicit property enumeration in tuples, one by one for all variants, immediately yields to combinatorial explosion given that the number of variants can grow exponentially with the number of features. Therefore, such lifted analyses may be too costly or even infeasible for families with a large number of variants.

In this work, we propose a more efficient lifted static analysis where sharing is explicitly possible between analysis elements corresponding to different variants. This is achieved by giving an symbolic representation of the lifted analysis domain, which can efficiently handle disjunctive properties in program families. The elements of the new lifted domain are binary decision diagrams where decision nodes are labeled with features, and the leaf nodes belong to an existing single-program analysis domain. We have developed such efficient lifted analysis which uses APRON and BDDAPRON libraries for implementing the new lifted analysis domain. The APRON library, used for the leaves, is a widely accepted API for numerical abstract domains (e.g. polyhedra, octagons, intervals), while the BDDAPRON is an extension of APRON which adds the power domain of Boolean formulae and any APRON domain. Through experiments applied to C program families, we show that our new BDD-based approach outperforms the old tuple-based approach for lifted analysis.

Tue 22 Oct

gpce-2019-papers
14:00 - 15:30: GPCE 2019 - Product lines at Ground floor conference room
Chair(s): Guido SalvaneschiTechnische Universität Darmstadt
gpce-2019-papers14:00 - 14:30
Talk
gpce-2019-papers14:30 - 15:00
Talk
Daniel HinterreiterJohannes Kepler University Linz, Michael NiekeTU Braunschweig, Germany, Lukas Linsbauer, Christoph SeidlTechnische Universität Braunschweig, Herbert PrähoferJohannes Kepler University Linz, Paul GrünbacherJohannes Kepler University Linz, Austria
gpce-2019-papers15:00 - 15:30
Talk
Kevin FeichtingerJohannes Kepler University Linz, Daniel HinterreiterJohannes Kepler University Linz, Lukas Linsbauer, Herbert PrähoferJohannes Kepler University Linz, Paul GrünbacherJohannes Kepler University Linz, Austria