<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T08:07:54Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4201" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4201</identifier><datestamp>2017-03-21T14:46:27Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="e59198d2-5c02-4d83-a448-bec8d9f87a26" confidence="600">Mendonca, Marcilio</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-01-20T14:48:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-01-20T14:48:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-01-20T14:48:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4201</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In Software Product Lines (SPLs), a feature model can be used to represent the&#xd;
similarities and differences within a family of software systems. This allows&#xd;
describing the systems derived from the product line as a unique combination of&#xd;
the features in the model. What makes feature models particularly appealing is&#xd;
the fact that the constraints in the model prevent incompatible features from&#xd;
being part of the same product. &#xd;
&#xd;
&#xd;
Despite the benefits of feature models, constructing and maintaining these models&#xd;
can be a laborious task especially in product lines with a large number of&#xd;
features and constraints. As a result, the study of automated techniques to&#xd;
reason on feature models has become an important research topic in the SPL&#xd;
community in recent years. Two techniques, in particular, have significant&#xd;
appeal for researchers: SAT solvers and Binary Decision Diagrams (BDDs). Each&#xd;
technique has been applied successfully for over four decades now to tackle&#xd;
many practical combinatorial problems in various domains. Currently, several&#xd;
approaches have proposed the compilation of feature models to specific logic&#xd;
representations to enable the use of SAT solvers and BDDs.&#xd;
&#xd;
&#xd;
In this thesis, we argue that several critical issues related to the use of SAT&#xd;
solvers and BDDs have been consistently neglected. For instance, satisfiability&#xd;
is a well-known NP-complete problem which means that, in theory, a SAT solver&#xd;
might be unable to check the satisfiability of a feature model in a feasible&#xd;
amount of time. Similarly, it is widely known that the size of BDDs can become&#xd;
intractable for large models. At the same time, we currently do not know&#xd;
precisely whether these are real issues when feature models, especially large&#xd;
ones, are compiled to SAT and BDD representations.&#xd;
&#xd;
&#xd;
Therefore, in our research we provide a significant step forward in the&#xd;
state-of-the-art by examining deeply many relevant properties of the feature&#xd;
modeling domain and the mechanics of SAT solvers and BDDs and the sensitive&#xd;
issues related to these techniques when applied in that domain. Specifically, we&#xd;
provide more accurate explanations for the space and/or time (in)tractability of&#xd;
these techniques in the feature modeling domain, and enhance the algorithmic&#xd;
performance of these techniques for reasoning on feature models. The&#xd;
contributions of our work include the proposal of novel heuristics to reduce the&#xd;
size of BDDs compiled from feature models, several insights on the construction&#xd;
of efficient domain-specific reasoning algorithms for feature models, and&#xd;
empirical studies to evaluate the efficiency of SAT solvers in handling very&#xd;
large feature models.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Software Product Lines</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Feature Models</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Binary Decision Diagrams</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">SAT Solvers</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Feature Model Reasoning</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Efficient Reasoning Techniques for Large Scale Feature Models</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>