~/talk

On the Expressive Power of Languages for Static Variability

Talkat OOPSLA 2024 · 2024-10-20..10-25· [software-architecture, compilers-and-language-design]

speakers

name:Paul Maximilian Bittner

github:pmbittner

name:Alexander Schultheiß

links:none on file

name:Benjamin Moosherr

links:none on file

name:Jeffrey M. Young

github:facundominguez

name:Leopoldo Teixeira

website:https://leopoldomt.github.io

name:Eric Walkingshaw

website:https://eric.walkingshaw.net

name:Parisa Ataei

links:none on file

name:Thomas Thüm

website:https://www.tu-braunschweig.de/isf/team/thuem

resources

video:https://youtu.be/hMZyoyCLI4I

slides:none on file

summary

A formal semantic domain for static variability models configurations as functions-to-variants, and the paper proves soundness, completeness, and relative expressiveness for several languages, including choice calculus and algebraic decision trees (both complete) and several incomplete formalisms; translations are implemented as an Agda library so every proof is an executable compiler, artifacts are available and evaluated, and practical costs appear: clone‑and‑own is complete but causes combinatorial blowup (e.g. Linux has 5,000 options).

AI-written summary · about

chapters (8)

related talks