ICSE '91 Proceedings of the 13th international conference on Software engineering
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A machine program for theorem-proving
Communications of the ACM
Finding bugs with a constraint solver
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Semantic errors - diagnosis and repair
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Instant consistency checking for the UML
Proceedings of the 28th international conference on Software engineering
Fixing Inconsistencies in UML Design Models
ICSE '07 Proceedings of the 29th international conference on Software Engineering
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Journal of Automated Reasoning
Automated Diagnosis of Product-Line Configuration Errors in Feature Models
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
SPLC '08 Proceedings of the 2008 12th International Software Product Line Conference
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Generalizing Core-Guided Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
S.P.L.O.T.: software product lines online tools
Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications
Generating and Evaluating Choices for Fixing Inconsistencies in UML Design Models
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
C2O: a tool for guided decision-making
Proceedings of the IEEE/ACM international conference on Automated software engineering
The DOPLER meta-tool for decision-oriented variability modeling: a multiple case study
Automated Software Engineering
Optimizing User Guidance during Decision-Making
SPLC '11 Proceedings of the 2011 15th International Software Product Line Conference
Managing SAT inconsistencies with HUMUS
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
SAT-Based verification methods and applications in hardware verification
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Fault diagnosis and logic debugging using Boolean satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Beyond data mining; towards "idea engineering"
Proceedings of the 9th International Conference on Predictive Models in Software Engineering
Hi-index | 0.00 |
Tolerating inconsistencies is well accepted in design modeling because it is often neither obvious how to fix an inconsistency nor important to do so right away. However, there are technical reasons why inconsistencies are not tolerated in many areas of software engineering. The most obvious being that common reasoning engines are rendered (partially) useless in the presence of inconsistencies. This paper investigates automated strategies for tolerating inconsistencies during decision-making in product line engineering, based on isolating parts from reasoning that cause inconsistencies. We compare trade offs concerning incorrect and incomplete reasoning and demonstrate that it is even possible to fully eliminate incorrect reasoning in the presence of inconsistencies at the expense of marginally less complete reasoning. Our evaluation is based on seven medium-to-large size software product line case studies. It is important to note that our mechanism for tolerating inconsistencies can be applied to arbitrary SAT problems and thus the basic principles of this approach are applicable to other domains also.