An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
Implicit and incremental computation of primes and essential primes of Boolean functions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Generative programming: methods, tools, and applications
Generative programming: methods, tools, and applications
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 10th International Conference on Automated Deduction
Computing Prime Implicates Incrementally
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Integrating Feature Modeling with the RSEB
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
fmp and fmp2rsm: eclipse plug-ins for modeling features using model templates
OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Formal verification and software product lines
Communications of the ACM - Software product line
Generic semantics of feature diagrams
Computer Networks: The International Journal of Computer and Telecommunications Networking
Feature Diagrams and Logics: There and Back Again
SPLC '07 Proceedings of the 11th International Software Product Line Conference
Optimization of Variability in Software Product Lines
SPLC '07 Proceedings of the 11th International Software Product Line Conference
FeatureMapper: mapping features to models
Companion of the 30th international conference on Software engineering
Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Sample Spaces and Feature Models: There and Back Again
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Adding Standardized Variability to Domain Specific Languages
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Efficient compilation techniques for large scale feature models
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
Automated analysis of feature models 20 years later: A literature review
Information Systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Variability modeling in the real: a perspective from the operating systems domain
Proceedings of the IEEE/ACM international conference on Automated software engineering
Feature-to-code mapping in two large product lines
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
A comparison of decision modeling approaches in product lines
Proceedings of the 5th Workshop on Variability Modeling of Software-Intensive Systems
Reverse engineering feature models
Proceedings of the 33rd International Conference on Software Engineering
Extraction of feature models from formal contexts
Proceedings of the 15th International Software Product Line Conference, Volume 2
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On subsumption removal and on-the-fly CNF simplification
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
Usage scenarios for feature model synthesis
Proceedings of the VARiability for You Workshop: Variability Modeling Made Useful for Everyone
Support for reverse engineering and maintaining feature models
Proceedings of the Seventh International Workshop on Variability Modelling of Software-intensive Systems
On extracting feature models from sets of valid feature combinations
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
FAMILIAR: A domain-specific language for large scale management of feature models
Science of Computer Programming
Feature model extraction from large collections of informal product descriptions
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Investigating preprocessor-based syntax errors
Proceedings of the 12th international conference on Generative programming: concepts & experiences
Comparing or configuring products: are we getting the right ones?
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
Towards system analysis with variability model metrics
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
On lazy and eager interactive reconfiguration
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
Automated generation of computationally hard feature models using evolutionary algorithms
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Variability modeling, and in particular feature modeling, is a central element of model-driven software product line architectures. Such architectures often emerge from legacy code, but, unfortunately creating feature models from large, legacy systems is a long and arduous task. We address the problem of automatic synthesis of feature models from propositional constraints. We show that this problem is NP-hard. We design efficient techniques for synthesis of models from respectively CNF and DNF formulas, showing a 10- to 1000-fold performance improvement over known techniques for realistic benchmarks. Our algorithms are the first known techniques that are efficient enough to be applied to dependencies extracted from real systems, opening new possibilities of creating reverse engineering and model management tools for variability models. We discuss several such scenarios in the paper.