kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Category Theory Framework for Variability Models with Non-functional Requirements
Univ Malaga, ITIS Software, Malaga, Spain.;Univ Malaga, Dept LCC, Andalucia Tech, CAOSD, Malaga, Spain..
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Theoretical Computer Science, TCS.ORCID iD: 0000-0002-0074-8786
Univ Malaga, ITIS Software, Malaga, Spain.;Univ Malaga, Dept LCC, Andalucia Tech, CAOSD, Malaga, Spain..
Univ Malaga, ITIS Software, Malaga, Spain.;Univ Malaga, Dept LCC, Andalucia Tech, CAOSD, Malaga, Spain..
2021 (English)In: Advanced Information Systems Engineering (Caise 2021) / [ed] LaRosa, M Sadiq, S Teniente, E, SPRINGER INTERNATIONAL PUBLISHING AG , 2021, Vol. 12751, p. 397-413Conference paper, Published paper (Refereed)
Abstract [en]

In Software Product Line (SPL) engineering one uses Variability Models (VMs) as input to automated reasoners to generate optimal products according to certain Quality Attributes (QAs). Variability models, however, and more specifically those including numerical features (i.e., NVMs), do not natively support QAs, and consequently, neither do automated reasoners commonly used for variability resolution. However, those satisfiability and optimisation problems have been covered and refined in other relational models such as databases. Category Theory (CT) is an abstract mathematical theory typically used to capture the common aspects of seemingly dissimilar algebraic structures. We propose a unified relational modelling framework subsuming the structured objects of VMs and QAs and their relationships into algebraic categories. This abstraction allows a combination of automated reasoners over different domains to analyse SPLs. The solutions' optimisation can now be natively performed by a combination of automated theorem proving, hashing, balanced-trees and chasing algorithms. We validate this approach by means of the edge computing SPL tool HADAS.

Place, publisher, year, edition, pages
SPRINGER INTERNATIONAL PUBLISHING AG , 2021. Vol. 12751, p. 397-413
Series
Lecture Notes in Computer Science, ISSN 0302-9743
Keywords [en]
Numerical variability model, Feature, Non-functional requirement, Quality attribute, Category theory
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-305416DOI: 10.1007/978-3-030-79382-1_24ISI: 000716947800024Scopus ID: 2-s2.0-85111462241OAI: oai:DiVA.org:kth-305416DiVA, id: diva2:1615888
Conference
33rd International Conference on Advanced Information Systems Engineering (CAiSE), JUN 28-JUL 02, 2021, ELECTR NETWORK
Note

Part of proceedings: ISBN 978-3-030-79382-1, QC 20230118

Available from: 2021-12-01 Created: 2021-12-01 Last updated: 2023-01-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Gurov, Dilian

Search in DiVA

By author/editor
Gurov, Dilian
By organisation
Theoretical Computer Science, TCS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 64 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf