<?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-05-31T07:26:28Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/28274" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/28274</identifier><datestamp>2026-02-03T11:06:12Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Estimating Software Testing Complexity</dc:title>
   <dc:creator>Ferrer-Urbano, Francisco Javier</dc:creator>
   <dc:creator>Chicano-García, José-Francisco</dc:creator>
   <dc:creator>Alba-Torres, Enrique</dc:creator>
   <dc:subject>Soporte lógico</dc:subject>
   <dc:subject>Ingeniería del software</dc:subject>
   <dc:subject>Computación evolutiva</dc:subject>
   <dcterms:abstract>Context: Complexity measures provide us some information about software artifacts. A measure of the&#xd;
difficulty of testing a piece of code could be very useful to take control about the test phase.&#xd;
Objective: The aim in this paper is the definition of a new measure of the difficulty for a computer to gen erate test cases, we call it Branch Coverage Expectation (BCE). We also analyze the most common com plexity measures and the most important features of a program. With this analysis we are trying to&#xd;
discover whether there exists a relationship between them and the code coverage of an automatically&#xd;
generated test suite.&#xd;
Method: The definition of this measure is based on a Markov model of the program. This model is used&#xd;
not only to compute the BCE, but also to provide an estimation of the number of test cases needed to&#xd;
reach a given coverage level in the program. In order to check our proposal, we perform a theoretical val idation and we carry out an empirical validation study using 2600 test programs.&#xd;
Results: The results show that the previously existing measures are not so useful to estimate the difficulty&#xd;
of testing a program, because they are not highly correlated with the code coverage. Our proposed mea sure is much more correlated with the code coverage than the existing complexity measures.&#xd;
Conclusion: The high correlation of our measure with the code coverage suggests that the BCE measure is&#xd;
a very promising way of measuring the difficulty to automatically test a program. Our proposed measure&#xd;
is useful for predicting the behavior of an automatic test case generator.</dcterms:abstract>
   <dcterms:dateAccepted>2023-12-13T10:50:18Z</dcterms:dateAccepted>
   <dcterms:available>2023-12-13T10:50:18Z</dcterms:available>
   <dcterms:created>2023-12-13T10:50:18Z</dcterms:created>
   <dcterms:issued>2013-07-29</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>Ferrer, J., Chicano, F., &amp; Alba, E. (2013). Estimating software testing complexity. Information and Software Technology, 55(12), 2125–2139.</dc:identifier>
   <dc:identifier>https://hdl.handle.net/10630/28274</dc:identifier>
   <dc:identifier>10.1016/j.infsof.2013.07.007</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
   <dc:rights>open access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</dc:rights>
   <dc:publisher>Science Direct</dc:publisher>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>