<?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-06-07T08:01:47Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/8192" metadataPrefix="oai_dc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/8192</identifier><datestamp>2026-02-03T12:00:24Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>On the Application of SAT Solvers to the Test Suite Minimization Problem</dc:title>
   <dc:creator>Arito, Franco</dc:creator>
   <dc:creator>Chicano-García, José-Francisco</dc:creator>
   <dc:creator>Alba-Torres, Enrique</dc:creator>
   <dc:subject>Ingeniería del software</dc:subject>
   <dc:subject>Test suite minimization</dc:subject>
   <dc:subject>Satisfiability problem</dc:subject>
   <dc:subject>Multi-objective optimization</dc:subject>
   <dc:description>Arito, F., Chicano F., &amp; Alba E. (2012).  On the Application of SAT Solvers to the Test Suite Minimization Problem. (Fraser, G., &amp; de Souza J. Teixeira, Ed.).Search Based Software Engineering - 4th International Symposium, {SSBSE} 2012, Riva del Garda, Italy, September 28-30, 2012. Proceedings. 45–59.</dc:description>
   <dc:description>The Test Suite Minimization problem in regression testing is a software engineering problem which consists in selecting a set of test cases from a large test suite that satisfies a given condition, like maximizing the coverage and/or minimizing the oracle cost. In this work we use an approach based on SAT solvers to find optimal solutions for the Test Suite Minimization Problem. The approach comprises two translations: from the original problem instance into Pseudo-Boolean constraints and then to a propositional Boolean formula. In order to solve a problem, we first translate it into a SAT instance. Then the SAT instance is solved using a state-of-the-art SAT solver. Our main contributions are: we create an encoding for single and multi-objective formulations of the Test Suite Minimization Problem as Pseudo-Boolean constraints and we compute optimal solutions for well-known and highly-used instances of this problem for future reference.</dc:description>
   <dc:description>Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.                 Spanish Ministry of Science and Innovation and FEDER under contract TIN2011-28194 (RoadME project). Andalusian Government under contract P07-TIC-03044 (DIRICOM project).</dc:description>
   <dc:date>2014-10-06T10:53:06Z</dc:date>
   <dc:date>2014-10-06T10:53:06Z</dc:date>
   <dc:date>2014-10-06</dc:date>
   <dc:type>conference output</dc:type>
   <dc:identifier>http://hdl.handle.net/10630/8192</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>International Symposium on Search Based Software Engineering</dc:relation>
   <dc:relation>Riva del Garda, Italy</dc:relation>
   <dc:relation>28/9/2012</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc>
</metadata></record></GetRecord></OAI-PMH>