Modular logic metaprogramming

KloseKarl,; OstermannKlaus,

doi:10.1145/1932682.1869499

Cited by 3 publications

(6 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Feature-product-based type checking has been proposed for composition-based implementation approaches such as logic metaprogramming [Klose and Ostermann 2010], feature modules [Apel and Hutchins 2010;Kolesnikov et al 2013], delta modules [Bettini et al 2013], and traits [Bettini et al 2014]. As explained for our running example, feature implementations (i.e., modules, feature modules, delta modules, traits) are type checked as far as possible in isolation in the first phase.…”

Section: Feature-product-based Analysesmentioning

confidence: 99%

A Classification and Survey of Analysis Strategies for Software Product Lines

et al. 2014

View full text Add to dashboard Cite

Software-product-line engineering has gained considerable momentum in the recent years, both in industry and in academia. A software product line is a family of software products that share a common set of features. Software product lines challenge traditional analysis techniques, such as type checking, model checking, and theorem proving, in their quest of ensuring correctness and reliability of software. Simply creating and analyzing all products of a product line is usually not feasible, due to the potentially exponential number of valid feature combinations. Recently, researchers began to develop analysis techniques that take the distinguishing properties of software product lines into account, for example, by checking feature-related code in isolation or by exploiting variability information during analysis. The emerging field of product-line analyses is both broad and diverse, so it is difficult for researchers and practitioners to understand their similarities and differences. We propose a classification of product-line analyses to enable systematic research and application. Based on our insights with classifying and comparing a corpus of 123 research articles, we develop a research agenda to guide future research on product-line analyses.

show abstract

Section: Feature-product-based Analysesmentioning

confidence: 99%

A Classification and Survey of Analysis Strategies for Software Product Lines

et al. 2014

View full text Add to dashboard Cite

show abstract

“…• Finally, we can use any other implementation strategy, including runtime variability [44], sophisticated metaprogramming systems [26,31], and configuration management systems [10,32]. For most of these implementation mechanisms, no efficient means to type check all configurations is available yet.…”

Section: Abstraction From Variability Implementationmentioning

confidence: 99%

“…Furthermore, each module defines its own local variability model -the constraints on its environment. The formalization is based on Cardelli's seminal formalization of separate type checking and linking [13] and a more recent generalization of this work towards propositions in interfaces [31]. We show that the calculus is sound in two ways: (1) well-typedness of a module implies well-typedness of all configurations of the module, and (2) module composition preserves well-typedness.…”

Section: Introductionmentioning

confidence: 99%

A variability-aware module system

2012

Self Cite

View full text Add to dashboard Cite

Module systems enable a divide and conquer strategy to software development. To implement compile-time variability in software product lines, modules can be composed in different combinations. However, this way variability dictates a dominant decomposition. Instead, we introduce a variability-aware module system that supports compile-time variability inside a module and its interface. This way, each module can be considered a product line that can be type checked in isolation. Variability can crosscut multiple modules. The module system breaks with the antimodular tradition of a global variability model in product-line development and provides a path toward software ecosystems and product lines of product lines developed in an open fashion. We discuss the design and implementation of such a module system on a core calculus and provide an implementation for C, which we use to type check the open source product line Busybox with 811 compile-time options.

show abstract

“…A loop then iterates over the solutions, extracting the bindings for the constraint, kind of rule and annotation type. (lines [17][18][19][20][21][22] …”

Section: Comparing Eclipse Search Api and Baristamentioning

confidence: 99%

“…To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. alog [4] have lent their proof procedure to [1,7,10,15,20,26,30] and [6,12,17,22] respectively). We will focus on querying Java programs using the latest incarnation of SOUL [30], one of the earliest logic program query languages under active development.…”

Section: Introductionmentioning

confidence: 99%

The SOUL tool suite for querying programs in symbiosis with Eclipse

Roover

Noguera

Kellens

et al. 2011

Proceedings of the 9th International Conference on Principles and Practice of Programming in Java

View full text Add to dashboard Cite

Program queries can answer important software engineering questions that range from "which expressions are cast to this type?" over "does my program attempt to read from a closed file?" to "does my code follow the prescribed design?". In this paper, we present a comprehensive tool suite for querying Java programs. It consists of the logic program query language SOUL, the CAVA library of predicates for quantifying over an Eclipse workspace and the Eclipse plugin BARISTA for launching queries and inspecting their results. BARISTA allows other Eclipse plugins to peruse program query results which is facilitated by the symbiosis of SOUL with Java -setting SOUL apart from other program query languages. This symbiosis enables the CAVA library to forego the predominant transcription to logic facts of the queried program. Instead, the library queries the actual AST nodes used by Eclipse itself, making it trivial for any Eclipse plugin to find the AST nodes that correspond to a query result. Moreover, such plugins do not have to worry about having queried stale program information. We illustrate the extensibility of our suite by implementing a tool for co-evolving source code and annotations using program queries.

show abstract

Modular logic metaprogramming

Cited by 3 publications

References 40 publications

A Classification and Survey of Analysis Strategies for Software Product Lines

A Classification and Survey of Analysis Strategies for Software Product Lines

A variability-aware module system

The SOUL tool suite for querying programs in symbiosis with Eclipse

Contact Info

Product

Resources

About