<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-46515</cfResPublId>
<cfResPublDate>2016-08-25</cfResPublDate>
<cfVol>71</cfVol>
<cfIssue>2</cfIssue>
<cfStartPage>192</cfStartPage>
<cfISSN>1561-4042</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/46515</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>The general prioritization framework</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>prioritization; regression testing; software testing; prioritization framework; test case prioritization.</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'>This paper proposes the general prioritization framework for test case prioritization during regression testing. Regression testing (RT) is done to ensure that modifications have not created new faults or that modifications fulfilled their intended purpose by correctly altering software functionality. Being performed multiple times, RT can have a profound effect on the software budget. The test case prioritization orders test cases for execution to reach a certain objective. Usually, such an objective is to detect faults as early as possible during the testing process. Many prioritization techniques have been developed that successfully reach this objective. However, most of these techniques were developed and studied independently from each other despite the fact that they have many similarities. This article presents the framework that allows to represent known prioritization techniques. Thus, it helps to improve existing and devise new techniques. Also, it allows to implement a single tool that emulates any prioritization technique by just setting the correct parameters. The proposed framework includes the combination/condensation (CC) structure and the structure functions including element combination functions, condensation functions, and a super-group combination function. By defining two such structures together with the corresponding structure functions, one for computing award values and one for their update, any known prioritization technique can be expressed. A general prioritization algorithm is presented that can express any known prioritization technique. </cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016-08-25T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2016-08-25T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-47586</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2016-08-25T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-47586</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-47586-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2016-08-25T24:00:00</cfStartDate>
<cfFamilyNames>Malishevsky</cfFamilyNames>
<cfFirstNames>Alexey</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>