Type-based parametric analysis of program families

Abstract

Previous research on static analysis for program families has focused on lifting analyses for single, plain programs to program families by employing idiosyncratic representations. The lifting effort typically involves a significant amount of work for proving the correctness of the lifted algorithm and demonstrating its scalability. In this paper, we propose a parameterized static analysis framework for program families that can automatically lift a class of type-based static analyses for plain programs to program families. The framework consists of a parametric logical specification and a parametric variational constraint solver. We prove that a lifted algorithm is correct provided that the underlying analysis algorithm is correct. An evaluation of our framework has revealed an error in a previous manually lifted analysis. Moreover, performance tests indicate that the overhead incurred by the general framework is bounded by a factor of 2.

Automatic and Efficient Variability-Aware Lifting of Functional Programs

“…Automated lifting of type-based analyses [Chen and Erwig 2014] to support annotative product lines is another attempt towards solving the SPL lifting problem. However, this approach only works if the analysis can be expressed as a type system.…”

Formal Verification for Feature-Based Composition of Workflows

“…There is a huge body of work on verifying properties of software product lines [14,10,11,20,22,27,26]. A strength of our implementation is that we can use Agda's theorem proving capabilities to prove arbitrary properties about SPLs.…”