A theoretical framework for cardinality-based feature models: the semantics and computational aspects

DOI10.1016/J.JLAMP.2018.02.002MaRDI QIDQ1647962zbMATH OpenOpenAlexFDO

Authors Aliakbar Safilian, Zinovy Diskin, Tim Maibaum

Publication date 27 June 2018

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2018.02.002

zbMATH Keywords

complexitydecidabilityformal language theorycardinality-based feature models

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Generic semantics of feature diagrams
• Modeling product lines with Kripke structures and modal logic
• Faithful Modeling of Product Lines with Kripke Structures and Modal Logic
• On logical and extensional characterizations of attributed feature models
• Approach of feature dependency modeling for software product line

Cites work

• Advanced Ramsey-based Büchi automata inclusion testing
• An introduction to formal languages and automata.
• Checking NFA equivalence with bisimulations up to congruence
• Commutative grammars
• GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic
• Hardness results for intersection non-emptiness
• Introduction to algorithms.
• On Context-Free Languages
• On the complexity of integer programming
• On the complexity of intersecting regular, context-free, and tree languages
• On the equivalence and containment problems for context-free languages
• On the equivalence, containment, and covering problems for the regular and context-free languages
• One-unambiguous regular languages
• The complexity of theorem-proving procedures
• The inclusion problem for regular expressions
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata

Cited in

(6)

• On logical and extensional characterizations of attributed feature models
• The expressive power of cardinality-bounded set values in object-based data models
• Generic semantics of feature diagrams
• Approach of feature dependency modeling for software product line
• Modeling product lines with Kripke structures and modal logic
• On the benefits of knowledge compilation for feature-model analyses

Describes a project that uses

Uses Software

• VATA
• JFLAP
• MTBDD
• fmp2rsm
• FAT
• Clafer

This page was built for publication: A theoretical framework for cardinality-based feature models: the semantics and computational aspects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647962)