Finding Suitable Variability Abstractions for Family-Based Analysis

Dimovski, Aleksandar S.; Brabrand, Claus; Wąsowski, Andrzej

doi:10.1007/978-3-319-48989-6_14

Cited by 8 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, for live variables analysis, we may obtain more live variables than there are in any single variant. The live variables analysis determines which variables may be live at a program point, that is there is a path from the program point to a use of [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19] the variable that does not redefine it [32]. This information can be used as a basis for dead code elimination.…”

Section: Discussionmentioning

confidence: 99%

“…Another efficient implementation of lifted analysis formulated within the IFDS framework for inter-procedural distributive environments has been proposed in SPL LIFT [6]. In order to speed-up the lifted verification techniques, variability abstractions have been introduced in [17,18,15,16]. They tame the exponential blowup caused by the large number of features and variants in a program family.…”

Section: Related Workmentioning

confidence: 99%

“…They tame the exponential blowup caused by the large number of features and variants in a program family. In this way, variability abstractions enable deliberate trading of precision for speed in the context of lifted (monotone) data-flow analysis [17,18] and lifted model checking [15,16].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Effective Analysis of C Programs by Rewriting Variability

et al. 2017

Self Cite

View full text Add to dashboard Cite

Context. Variability-intensive programs (program families) appear in many application areas and for many reasons today. Different family members, called variants, are derived by switching statically configurable options (features) on and off, while reuse of the common code is maximized. Inquiry. Verification of program families is challenging since the number of variants is exponential in the number of features. Existing single-program analysis and verification tools cannot be applied directly to program families, and designing and implementing the corresponding variability-aware versions is tedious and laborious. Approach. In this work, we propose a range of variability-related transformations for translating program families into single programs by replacing compile-time variability with run-time variability (non-determinism). The obtained transformed programs can be subsequently analyzed using the conventional off-the-shelf singleprogram analysis tools such as type checkers, symbolic executors, model checkers, and static analyzers. Knowledge. Our variability-related transformations are outcome-preserving, which means that the relation between the outcomes in the transformed single program and the union of outcomes of all variants derived from the original program family is equality. Grounding. We present our transformation rules and their correctness with respect to a minimal core imperative language IMP. Then, we discuss our experience of implementing and using the transformations for efficient and effective analysis and verification of real-world C program families. Importance. We report some interesting variability-related bugs that we discovered using various state-of-theart single-program C verification tools, such as Frama-C, Clang, LLBMC. ACM CCS 2012Software and its engineering → Software creation and management Software verification and validation; Software notations and tools Formal language definitions;

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Effective Analysis of C Programs by Rewriting Variability

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another way to speed up lifted analysis is via so-called variability abstractions [14][15][16], which aim tame the combinatorial explosion of the number of variants and reduce it to something more tractable. It would be interesting to apply the obtained abstract lifted analysis for resolving program sketches.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Program Sketching Using Lifted Analysis for Numerical Program Families

Dimovski¹,

Apel

Legay

2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This work presents a novel approach for synthesizing numerical program sketches using lifted (family-based ) static program analysis. In particular, our approach leverages a lifted static analysis based on abstract interpretation, which is used for analyzing program families with numerical features. It takes as input the common code base, which encodes all variants of a program family, and produces precise results for all variants in a single analysis run. The elements of the underlying lifted analysis domain are decision trees, in which decision nodes are labeled with linear constraints defined over numerical features and leaf nodes belong to a given single-program analysis domain.We encode a program sketch as a program family such that holes correspond to numerical features and all possible sketch realizations correspond to variants in the program family. Then, we preform a lifted analysis of the family, so that only those variants that satisfy all assertions under all possible inputs represent correct realizations of holes in the sketch.We have implemented an experimental program synthesizer for resolving C sketches. It is based on a lifted static analyzer for #if-based C program families, which uses the numerical domains from the APRON library. An evaluation yields promising results. Moreover, our approach provides speedups in some cases against the popular sketching tool Sketch and can solve some numerical benchmarks that Sketch cannot handle.

show abstract

“…Recently, many family-based techniques that work on the level of variational systems have been proposed. This includes family-based syntax checking [27,22], family-based type checking [26], family-based static program analysis [30,18,19], family-based verification [25,32,24], etc. In the context of family-based model checking, one of the earliest attempts for modelling variational systems is by using modal transition systems (MTSs) [28,3].…”

Section: Related Workmentioning

confidence: 99%

Abstract Family-Based Model Checking Using Modal Featured Transition Systems: Preservation of CTL$$^{\star }$$⋆

Dimovski

2018

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Variational systems allow effective building of many custom variants by using features (configuration options) to mark the variable functionality. In many of the applications, their quality assurance and formal verification are of paramount importance. Family-based model checking allows simultaneous verification of all variants of a variational system in a single run by exploiting the commonalities between the variants. Yet, its computational cost still greatly depends on the number of variants (often huge). In this work, we show how to achieve efficient family-based model checking of CTL temporal properties using variability abstractions and off-theshelf (single-system) tools. We use variability abstractions for deriving abstract family-based model checking, where the variability model of a variational system is replaced with an abstract (smaller) version of it, called modal featured transition system, which preserves the satisfaction of both universal and existential temporal properties, as expressible in CTL . Modal featured transition systems contain two kinds of transitions, termed may and must transitions, which are defined by the conservative (over-approximating) abstractions and their dual (under-approximating) abstractions, respectively. The variability abstractions can be combined with different partitionings of the set of variants to infer suitable divideand-conquer verification plans for the variational system. We illustrate the practicality of this approach for several variational systems.

show abstract

Finding Suitable Variability Abstractions for Family-Based Analysis

Cited by 8 publications

References 21 publications

Effective Analysis of C Programs by Rewriting Variability

Effective Analysis of C Programs by Rewriting Variability

Program Sketching Using Lifted Analysis for Numerical Program Families

Abstract Family-Based Model Checking Using Modal Featured Transition Systems: Preservation of CTL$$^{\star }$$⋆

Contact Info

Product

Resources

About