Simplified Extensibility in the Universal Variability Language using Answer Set Programming

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

Abstract

The Universal Variability Language (UVL) was designed with high extensibility in mind. Still, the development of new extensions necessitates a precise semantic definition and a transformation into a solver-specific encoding for their analysis. Such a transformation is challenging due to the difference in levels of abstraction, making the resulting encoding hard to understand. Moreover, the transformation itself becomes difficult to be extended. In this paper, we propose a simplified process for UVL extension by (1) analyzing the semantics of UVL and (2) providing a transformation of UVL models into an Answer Set Programming (ASP) encoding. We show the effectiveness of our approach in the exemplary extension of UVL with new concepts: attribute domains, derived attributes and scoped aggregates. Finally, we compare our approach to the conventional flattening of extensions to the existing UVL language levels, showing less implementation effort and better readability.

Details

Original languageEnglish
Title of host publicationSPLC-A '25: Proceedings of the 29th ACM International Systems and Software Product Line Conference
EditorsMiguel R. Luaces, Tirso V. Rodeiro, Sandra Greiner, Jose Galindo Duarte, Tao Yue, Kentaro Yoshimura, Laura Semini, Maxime Cordy, Maider Azanza, Jacob Kruger, Gilles Perrouin, Sophie Fortz, Iris Groher, Daniel-Jesus Munoz, Klaus Schmid, Francisca Perez, Jessie Galasso-Carbonnel, Jose Miguel Horcas, Kevin Feichtinger
Pages39-44
Number of pages6
VolumeA
Publication statusPublished - 31 Aug 2025
Peer-reviewedYes

External IDs

ORCID /0000-0002-3513-6448/work/193178539
Scopus 105017224188

Keywords

ASJC Scopus subject areas

Keywords

  • software product lines, universal variability language, language extension, answer set programming