| 1. Identity statement | ||||
| Reference Type | Journal Article | |||
| Site | mtc-m21b.sid.inpe.br | |||
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S | |||
| Identifier | 8JMKD3MGP3W34P/3QEUEPE | |||
| Repository | sid.inpe.br/mtc-m21b/2018/01.29.12.47 (restricted access) | |||
| Last Update | 2018:01.29.12.47.57 (UTC) simone | |||
| Metadata Repository | sid.inpe.br/mtc-m21b/2018/01.29.12.47.57 | |||
| Metadata Last Update | 2018:06.04.02.28.12 (UTC) administrator | |||
| DOI | 10.1186/s40411-017-0043-z | |||
| Citation Key | BaleraSant:2017:DeRiEv | |||
| Title | An algorithm for combinatorial interaction testing: definitions and rigorous evaluations  | |||
| Year | 2017 | |||
| Access Date | 2024, Apr. 26 | |||
| Type of Work | journal article | |||
| Number of Files | 1 | |||
| Size | 2291 KiB | |||
| 2. Context | ||||
| Author | 1 Balera, Juliana Marino 2 Santiago Júnior, Valdivino Alexandre de | |||
| Resume Identifier | 1 2 8JMKD3MGP5W/3C9JJB5 | |||
| Group | 1 CAP-COMP-SESPG-INPE-MCTIC-GOV-BR 2 LABAC-COCTE-INPE-MCTIC-GOV-BR | |||
| Affiliation | 1 Instituto Nacional de Pesquisas Espaciais (INPE) 2 Instituto Nacional de Pesquisas Espaciais (INPE) | |||
| Author e-Mail Address | 1 juliana.balera@inpe.br 2 valdivino.santiago@inpe.br | |||
| Journal | Journal of Software Engineering Research and Development | |||
| Volume | 5 | |||
| Number | 10 | |||
| History (UTC) | 2018-01-29 12:48:19 :: simone -> administrator :: 2017 2018-06-04 02:28:12 :: administrator -> simone :: 2017 | |||
| 3. Content and structure | ||||
| Is the master or a copy? | is the master | |||
| Content Stage | completed | |||
| Transferable | 1 | |||
| Content Type | External Contribution | |||
| Version Type | publisher | |||
| Keywords | oftware testing Combinatorial interaction testing Combinatorial testing Mixed-value covering array T-Tuple reallocation Controlled experiment | |||
| Abstract | Background: Combinatorial Interaction Testing (CIT) approaches have drawn attention of the software testing community to generate sets of smaller, efficient, and effective test cases where they have been successful in detecting faults due to the interaction of several input parameters. Recent empirical studies show that greedy algorithms are still competitive for CIT. It is thus interesting to investigate new approaches to address CIT test case generation via greedy solutions and to perform rigorous evaluations within the greedy context. Methods: We present a new greedy algorithm for unconstrained CIT, T-Tuple Reallocation (TTR), to generate CIT test suites specifically via the Mixed-value Covering Array (MCA) technique. The main reasoning behind TTR is to generate an MCA M by creating and reallocating t-tuples into this matrix M, considering a variable called goal (ζ ). We performed two controlled experiments addressing cost-efficiency and only cost. Considering both experiments, we did 3200 executions related to 8 solutions. In the first controlled experiment, we compared versions 1.1 and 1.2 of TTR in order to check whether there is significant difference between both versions of our algorithm. In such experiment, we jointly considered cost (size of test suites) and efficiency (time to generate the test suites) in a multi-objective perspective. In the second controlled experiment we confronted TTR 1.2 with five other greedy algorithms/tools for unconstrained CIT: IPOG-F, jenny, IPO-TConfig, PICT, and ACTS. We performed two different evaluations within this second experiment where in the first one we addressed cost-efficiency (multi-objective) and in the second only cost (single objective). Results: Results of the first controlled experiment indicate that TTR 1.2 is more adequate than TTR 1.1 especially for higher strengths (5, 6). In the second controlled experiment, TTR 1.2 also presents better performance for higher strengths (5, 6) where only in one case it is not superior (in the comparison with IPOG-F). We can explain this better performance of TTR 1.2 due to the fact that it no longer generates, at the beginning, the matrix of t-tuples but rather the algorithm works on a t-tuple by t-tuple creation and reallocation into M. Conclusion: Considering the metrics we defined in this work and based on both controlled experiments, TTR 1.2 is a better option if we need to consider higher strengths (5, 6). For lower strengths, other solutions, like IPOG-F, may be better alternatives. | |||
| Area | COMP | |||
| Arrangement 1 | urlib.net > Produção anterior à 2021 > LABAC > An algorithm for... | |||
| Arrangement 2 | urlib.net > CAP > An algorithm for... | |||
| doc Directory Content | access | |||
| source Directory Content | there are no files | |||
| agreement Directory Content |
| |||
| 4. Conditions of access and use | ||||
| Language | en | |||
| Target File | balera_algorithm.pdf | |||
| User Group | simone | |||
| Reader Group | administrator simone | |||
| Visibility | shown | |||
| Read Permission | deny from all and allow from 150.163 | |||
| Update Permission | not transferred | |||
| 5. Allied materials | ||||
| Mirror Repository | sid.inpe.br/mtc-m21b/2013/09.26.14.25.22 | |||
| Next Higher Units | 8JMKD3MGPCW/3ESGTTP 8JMKD3MGPCW/3F2PHGS | |||
| Citing Item List | sid.inpe.br/bibdigital/2013/09.22.23.14 3 sid.inpe.br/mtc-m21/2012/07.13.15.01.24 1 | |||
| Host Collection | sid.inpe.br/mtc-m21b/2013/09.26.14.25.20 | |||
| 6. Notes | ||||
| Empty Fields | alternatejournal archivingpolicy archivist callnumber copyholder copyright creatorhistory descriptionlevel dissemination e-mailaddress format isbn issn label lineage mark month nextedition notes orcid pages parameterlist parentrepositories previousedition previouslowerunit progress project rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype session shorttitle sponsor subject tertiarymark tertiarytype url | |||
| 7. Description control | ||||
| e-Mail (login) | simone | |||
| update | ||||