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

DOI10.1016/j.jlamp.2018.02.002zbMath1395.68095OpenAlexW2793721708MaRDI QIDQ1647962

Aliakbar Safilian, Zinovy Diskin, Thomas S. E. 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

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

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Commutative grammars
• The inclusion problem for regular expressions
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• Checking NFA equivalence with bisimulations up to congruence
• Advanced Ramsey-Based Büchi Automata Inclusion Testing
• On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
• On the complexity of integer programming
• Hardness Results for Intersection Non-Emptiness
• GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic
• On Context-Free Languages
• On the equivalence and containment problems for context-free languages
• The complexity of theorem-proving procedures
• One-unambiguous regular languages