Efficiently Automating Covering Array Generation: A Model Checking and Metaheuristic Algorithm Approach
The cost of software testing is a significant aspect of the software development life cycle, typically accounting for half of the total software production cost. Due to the large number of tests, it is impractical to perform a complete test of a system under test. Combinatorial testing is employed t...
Saved in:
| Published in | IEEE access Vol. 13; pp. 122804 - 122821 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Piscataway
IEEE
2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2169-3536 2169-3536 |
| DOI | 10.1109/ACCESS.2025.3587202 |
Cover
| Abstract | The cost of software testing is a significant aspect of the software development life cycle, typically accounting for half of the total software production cost. Due to the large number of tests, it is impractical to perform a complete test of a system under test. Combinatorial testing is employed to identify errors that arise from the interaction among subsystems, with covering arrays being the most crucial type of combinatorial testing. Covering arrays consider parameter combinations using the t-way strategy. The goal is to reduce the number of test cases while ensuring adequate coverage. Fewer test cases result in greater efficiency, and less time spent generating the test suite leads to more effective testing. Various solutions have been proposed, with metaheuristic algorithms playing a vital role. Furthermore, solutions have been developed to automatically generate parameters and their corresponding values by utilizing a model of the system under test. In this paper, our objective is to employ model-based solutions for the automatic generation of a covering array. Specifically, we integrate the GROOVE model checker with a combination of Biogeography-Based Optimization (BBO) and Genetic Algorithm (GA) to enhance the efficiency and accuracy of the test suite generation. The GROOVE model checker extracts parameters and their values, which are then optimized by the BBO and GA algorithms to generate a minimal and effective test suite. The evaluation results show that our proposed solution outperforms existing algorithms, achieving higher efficiency and accuracy in test generation. This research highlights the novel integration of GROOVE with BBO and GA, contributing to the advancement of combinatorial testing techniques. |
|---|---|
| AbstractList | The cost of software testing is a significant aspect of the software development life cycle, typically accounting for half of the total software production cost. Due to the large number of tests, it is impractical to perform a complete test of a system under test. Combinatorial testing is employed to identify errors that arise from the interaction among subsystems, with covering arrays being the most crucial type of combinatorial testing. Covering arrays consider parameter combinations using the t-way strategy. The goal is to reduce the number of test cases while ensuring adequate coverage. Fewer test cases result in greater efficiency, and less time spent generating the test suite leads to more effective testing. Various solutions have been proposed, with metaheuristic algorithms playing a vital role. Furthermore, solutions have been developed to automatically generate parameters and their corresponding values by utilizing a model of the system under test. In this paper, our objective is to employ model-based solutions for the automatic generation of a covering array. Specifically, we integrate the GROOVE model checker with a combination of Biogeography-Based Optimization (BBO) and Genetic Algorithm (GA) to enhance the efficiency and accuracy of the test suite generation. The GROOVE model checker extracts parameters and their values, which are then optimized by the BBO and GA algorithms to generate a minimal and effective test suite. The evaluation results show that our proposed solution outperforms existing algorithms, achieving higher efficiency and accuracy in test generation. This research highlights the novel integration of GROOVE with BBO and GA, contributing to the advancement of combinatorial testing techniques. |
| Author | Rastegarnia, Amir Farzamnia, Ali Giveki, Davar Zheng, Hua Esfandyari, Sajad |
| Author_xml | – sequence: 1 givenname: Sajad surname: Esfandyari fullname: Esfandyari, Sajad organization: Department of Computer Engineering, Faculty of Engineering, Malayer University, Malayer, Iran – sequence: 2 givenname: Davar orcidid: 0000-0002-7288-8112 surname: Giveki fullname: Giveki, Davar organization: Department of Computer Engineering, Faculty of Engineering, Malayer University, Malayer, Iran – sequence: 3 givenname: Amir orcidid: 0000-0003-4371-310X surname: Rastegarnia fullname: Rastegarnia, Amir email: rastegarnia@malayeru.ac.ir organization: Department of Electrical Engineering, Faculty of Engineering, Malayer University, Malayer, Iran – sequence: 4 givenname: Ali orcidid: 0000-0001-8618-7256 surname: Farzamnia fullname: Farzamnia, Ali organization: School of Computing and Engineering, University of Huddersfield, Huddersfield, U.K – sequence: 5 givenname: Hua orcidid: 0009-0001-4546-2968 surname: Zheng fullname: Zheng, Hua organization: College of Photonic and Electronic Engineering, Fujian Normal University, Fuzhou, China |
| BookMark | eNplkU9vGyEQxVGVSk3TfIL2gNSzHf4ssPS2WjlppEQ9JDkjzM7auGtwYbeVv31wN0qrdi48Peb9xAzv0VmIARD6SMmSUqKvmrZdPTwsGWFiyUWtiniDzhmVesEFl2d_6XfoMucdKVUXS6hztFn1vXcewjgccTONcW9HHza4jT8hnUSTkj3iGwiQyk0MX3CD72MHA2634L6fWmzo8D2MdgtT8nn0DjfDJiY_bve4ORxStG77Ab3t7ZDh8uW8QE_Xq8f26-Lu281t29wtHJd0XCjmLGNdpaWSvNbKAePOcudU10GvrRTgnC6egK4UVLUCURHCXK0JF2t-gW5nbhftzhyS39t0NNF689uIaWNsKk8cwIi-B8G1Fmy9rmi_tlVhUWIpryU4URVWNbOmcLDHX3YYXoGUmNPujXUOcjan3ZuX3ZfY5zlWJv8xQR7NLk4plKkNZ5XkjCpZly4-d7kUc07Q_8ee__Vf9qc55QHgT4ISJVRBPwPK5Z-u |
| CODEN | IAECCG |
| Cites_doi | 10.1109/TEVC.2008.919004 10.1007/s11219-023-09625-5 10.1016/j.jss.2017.05.128 10.1016/j.eswa.2022.118022 10.1109/TSE.2006.8 10.1007/978-3-540-69489-2_23 10.1007/s00500-023-08199-5 10.1109/ACCESS.2022.3157400 10.1007/s11590-016-1012-x 10.1007/s10462-023-10686-y 10.1109/ACCESS.2020.2973696 10.1016/j.infsof.2012.01.002 10.1007/BF00175354 10.1016/j.infsof.2018.12.001 10.1007/s10044-020-00868-7 10.1016/j.asoc.2011.11.029 10.1016/j.asoc.2020.106219 10.1109/CEC.2010.5586148 10.1007/s00500-021-05848-5 10.1007/978-3-642-17458-2_6 10.1109/TEVC.2014.2362532 10.1016/j.infsof.2015.05.005 10.1007/978-981-15-1289-6_13 10.1109/ASE.2015.61 10.1016/j.asoc.2023.111070 10.1109/SSBSE.2009.25 10.1007/s00500-021-05788-0 10.1109/ICNN.1995.488968 10.1007/s11042-024-18948-9 10.1016/j.ins.2018.10.048 10.1109/ICSTW.2014.11 10.1016/j.ins.2011.01.002 10.1002/stvr.4370030203 10.1109/ICSTW.2013.44 10.1016/j.jksuci.2021.06.020 10.1007/s12065-022-00802-2 10.1016/j.infsof.2018.01.004 10.1016/j.neucom.2015.05.104 10.1109/ICSTW.2013.48 10.1109/32.605761 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D ADTOC UNPAY DOA |
| DOI | 10.1109/ACCESS.2025.3587202 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 122821 |
| ExternalDocumentID | oai_doaj_org_article_5ffe539952bb41fba47e510a1386ec54 10.1109/access.2025.3587202 10_1109_ACCESS_2025_3587202 11075746 |
| Genre | orig-research |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D ADTOC UNPAY |
| ID | FETCH-LOGICAL-c361t-72ca22d496763897ce23ca3cc7ddef9a65ecc923c5edddde487e54002c89035b3 |
| IEDL.DBID | DOA |
| ISSN | 2169-3536 |
| IngestDate | Fri Oct 03 12:51:47 EDT 2025 Sun Oct 26 03:59:54 EDT 2025 Wed Oct 08 04:40:03 EDT 2025 Wed Oct 01 05:46:06 EDT 2025 Wed Aug 27 02:13:13 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0/legalcode cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c361t-72ca22d496763897ce23ca3cc7ddef9a65ecc923c5edddde487e54002c89035b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0009-0001-4546-2968 0000-0002-7288-8112 0000-0001-8618-7256 0000-0003-4371-310X |
| OpenAccessLink | https://doaj.org/article/5ffe539952bb41fba47e510a1386ec54 |
| PQID | 3246321768 |
| PQPubID | 4845423 |
| PageCount | 18 |
| ParticipantIDs | unpaywall_primary_10_1109_access_2025_3587202 crossref_primary_10_1109_ACCESS_2025_3587202 proquest_journals_3246321768 doaj_primary_oai_doaj_org_article_5ffe539952bb41fba47e510a1386ec54 ieee_primary_11075746 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20250000 2025-00-00 20250101 2025-01-01 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – year: 2025 text: 20250000 |
| PublicationDecade | 2020 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2025 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref12 ref15 ref14 Esfandyari (ref23) 2016; 46 ref53 ref11 ref10 ref17 ref16 ref19 ref18 Pira (ref42) 2022; 52 Esfandyari (ref13) 2024; 54 ref51 Esfandyari (ref22) 2020; 8 ref46 ref45 Runge (ref50); 58 ref48 ref47 ref41 ref43 ref49 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 Cohen (ref34) 2004 ref35 ref37 Grindal (ref44) Czerwonka (ref25) ref30 ref32 ref2 ref1 ref39 ref38 Giveki (ref28) 2024; 22 Stardom (ref33) 2001 ref24 ref26 ref20 ref21 ref27 ref29 Abbasi (ref31) 2018; 48 Yang (ref52) 2008 Alsariera (ref36) 2021; 21 |
| References_xml | – ident: ref19 doi: 10.1109/TEVC.2008.919004 – ident: ref11 doi: 10.1007/s11219-023-09625-5 – ident: ref12 doi: 10.1016/j.jss.2017.05.128 – ident: ref17 doi: 10.1016/j.eswa.2022.118022 – ident: ref51 doi: 10.1109/TSE.2006.8 – ident: ref49 doi: 10.1007/978-3-540-69489-2_23 – volume: 22 start-page: 267 issue: 79 year: 2024 ident: ref28 article-title: Proposing an improved version of the bat algorithm publication-title: J. Model. Eng. – ident: ref5 doi: 10.1007/s00500-023-08199-5 – ident: ref15 doi: 10.1109/ACCESS.2022.3157400 – ident: ref16 doi: 10.1007/s11590-016-1012-x – ident: ref10 doi: 10.1007/s10462-023-10686-y – ident: ref41 doi: 10.1109/ACCESS.2020.2973696 – ident: ref38 doi: 10.1016/j.infsof.2012.01.002 – ident: ref39 doi: 10.1007/BF00175354 – ident: ref48 doi: 10.1016/j.infsof.2018.12.001 – volume: 46 start-page: 25 issue: 3 year: 2016 ident: ref23 article-title: A hybrid solution for software testing to minimum test suite generation using Hill climbing and bat search algorithms publication-title: Tabriz J. Electr. Eng. – ident: ref8 doi: 10.1007/s10044-020-00868-7 – volume: 58 start-page: 1 volume-title: Proc. 12th Int. Workshop Graph Transformation Vis. Model. Techn. (GTVMT) ident: ref50 article-title: Test case generation using visual contracts – ident: ref37 doi: 10.1016/j.asoc.2011.11.029 – ident: ref14 doi: 10.1016/j.asoc.2020.106219 – ident: ref27 doi: 10.1109/CEC.2010.5586148 – volume-title: Nature-Inspired Metaheuristic Algorithms year: 2008 ident: ref52 – ident: ref53 doi: 10.1007/s00500-021-05848-5 – ident: ref29 doi: 10.1007/978-3-642-17458-2_6 – volume: 8 start-page: 66 issue: 2 year: 2020 ident: ref22 article-title: Using the particle swarm optimization algorithm to generate the minimum test suite in covering array with uniform strength publication-title: Soft Comput. J. – ident: ref3 doi: 10.1109/TEVC.2014.2362532 – ident: ref30 doi: 10.1016/j.infsof.2015.05.005 – start-page: 419 volume-title: Proc. 24th Pacific Northwest Softw. Quality Conf. ident: ref25 article-title: Pairwise testing in real world: Practical extensions to test case generator – volume: 52 start-page: 77 issue: 2 year: 2022 ident: ref42 article-title: Minimum covering array generation using success-history and linear population size reduction based adaptive differential evolution algorithm publication-title: TABRIZ J. Electr. Eng. – ident: ref20 doi: 10.1007/978-981-15-1289-6_13 – ident: ref1 doi: 10.1109/ASE.2015.61 – volume: 54 start-page: 269 issue: 3 year: 2024 ident: ref13 article-title: Optimal production of the test suite by the combinatorial testing method by applying changes in the gravitational search algorithm for the uniform strength cover array publication-title: Tabriz J. Electr. Eng. – year: 2001 ident: ref33 article-title: Metaheuristics and the search for covering and packing array – volume: 48 start-page: 161 issue: 1 year: 2018 ident: ref31 article-title: Covering array generation using teaching learning base optimization algorithm publication-title: Tabriz J. Electr. Eng. – ident: ref32 doi: 10.1016/j.asoc.2023.111070 – ident: ref2 doi: 10.1109/SSBSE.2009.25 – year: 2004 ident: ref34 article-title: Designing test suites for software interaction testing – start-page: 255 volume-title: Proc. Int. Conf. Softw. Eng. ident: ref44 article-title: Input parameter modeling for combination strategies – ident: ref21 doi: 10.1007/s00500-021-05788-0 – ident: ref35 doi: 10.1109/ICNN.1995.488968 – volume: 21 start-page: 343 issue: 10 year: 2021 ident: ref36 article-title: Hybridized BA & PSO t-way algorithm for test case generation publication-title: Int. J. Comput. Sci. Netw. Secur. – ident: ref6 doi: 10.1007/s11042-024-18948-9 – ident: ref18 doi: 10.1016/j.ins.2018.10.048 – ident: ref47 doi: 10.1109/ICSTW.2014.11 – ident: ref26 doi: 10.1016/j.ins.2011.01.002 – ident: ref43 doi: 10.1002/stvr.4370030203 – ident: ref45 doi: 10.1109/ICSTW.2013.44 – ident: ref40 doi: 10.1016/j.jksuci.2021.06.020 – ident: ref7 doi: 10.1007/s12065-022-00802-2 – ident: ref4 doi: 10.1016/j.infsof.2018.01.004 – ident: ref9 doi: 10.1016/j.neucom.2015.05.104 – ident: ref46 doi: 10.1109/ICSTW.2013.48 – ident: ref24 doi: 10.1109/32.605761 |
| SSID | ssj0000816957 |
| Score | 2.336736 |
| Snippet | The cost of software testing is a significant aspect of the software development life cycle, typically accounting for half of the total software production... |
| SourceID | doaj unpaywall proquest crossref ieee |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 122804 |
| SubjectTerms | Accuracy Algorithms Arrays biogeography based optimization (BBO) Biological system modeling Combinatorial analysis Combinatorial testing Complex systems Covering array (CA) Efficiency genetic algorithm (GA) Genetic algorithms Grooves Heuristic methods Mathematical models Metaheuristics Model checking Parameters Production costs Software development Software testing Subsystems Testing |
| SummonAdditionalLinks | – databaseName: IEEE Xplore dbid: RIE link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9QwELVoL8CBzyICBfnAkWwTfybcQtSqQmpPVOotsh1nFxGy1ZIILb-eGce7tCAkcrIiR7Hzxvabif2GkHeFEh3XRZuWsL6nolQutdzrVIlcYBpV10k873xxqc6vxKdreR0Pq4ezMN77sPnML7AY_uW3azdhqOwEfRWphTogB7pQ82GtfUAFM0iUUkdloTwrT6q6hk6AD8jkgstCsxg72a0-QaQ_ZlW5QzDvT8ON2f4wfX9rrTl7TC53rZy3mHxdTKNduJ9_CDj-dzeekEeRddJqNpOn5J4fnpGHt7QIn5PlaRCTgCf7La2mcY1UdljSGvd4YqHabMyWzjLViOYHWlHMpNbTeuUdRtypGVp64Uez8tMsAE2rfrnefBlX32gVxcuPyNXZ6ef6PI1ZGFLHVT6mmjnDWAswamQ32nnGneHOaZgZu9IoCVYANNFJ38LlwQPyQAMz5ooy49LyF-RwWA_-JaHW5xZm3xbtRgBRtjK3RllhpXCSiS4h73foNDez2EYTnJSsbGYwGwSziWAm5CMiuK-KStnhBnztJg68RnadR_VdyawVeWeNgOblmcl5obyTIiFHiNDv90VwEnK8M4gmDuvvDbBPxcGJU0VC0r2R_NVWE3Jd3mnrq3-85jV5gNXmoM4xORw3k38DNGe0b4N5_wJhafoK priority: 102 providerName: IEEE – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELbQ9oA48CwitCAfOOIlfibhFqJWFVIrDqxUTpHtOLuIkK22idD21zOTpGUXJAQ5RZGjOJ7Pnm_8-IaQN6lRtUzSimXg35nKjGdOhoQZxRWmUfW1xvPO5xfmbKE-XurLSWcbz8Lsrt_zOHtnh7SBEMcJPZc6TQQKRx4YDcR7Rg4WF5_yL5g-jpuMyWEh8ugvb-75nkGif8qpskcv7_ftld3-sE2z42lOH41HuK8HgULcYPJt3ndu7m9-k2_8x594TB5OjJPmI0SekHuhfUoe7OgQPiPLk0FIAvxPs6V5362RxrZLWuD-TrzJNxu7paNENVryPc0pZlFraLEKHmfbqW0reh46uwr9KP5M82a53nztVt9pPgmXH5LF6cnn4oxNGRiYl4Z3LBHeClGBCRNkNokPQnorvU9gVKwzazQgACii16GCK0D0E4ACxsKnWSy1k8_JrF234QWhLnAHI2-FmFFAkp3mzhqnnFZeC1VH5O2tbcqrUWijHAKUOCvzogA0lth-5dR-EfmA9rsriirZwwNo93LqdKWu64DKu1o4p3jtrILq8dhymZrgtYrIIVr_1_cgFtaJMhE5voVDOXXp6xKYp5EQwJk0IuwOIn_UdbT1Xl1f_mf5YzLrNn14BWync68nlP8E7XL6Sg priority: 102 providerName: Unpaywall |
| Title | Efficiently Automating Covering Array Generation: A Model Checking and Metaheuristic Algorithm Approach |
| URI | https://ieeexplore.ieee.org/document/11075746 https://www.proquest.com/docview/3246321768 https://doi.org/10.1109/access.2025.3587202 https://doaj.org/article/5ffe539952bb41fba47e510a1386ec54 |
| UnpaywallVersion | publishedVersion |
| Volume | 13 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: KQ8 dateStart: 20130101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT9wwELUQPZQeKmipGkpXPvTYQOLPhFsagVAlEIeuRE-W7Ti7lUIWLVlV--87drx0EQcu5BRFUTKZ53jejOw3CH0rBGupLJq0hPieslLY1FAnU8Fy5tuo2pb7_c5X1-Jyyn7e8tutVl9-TdgoDzw67pS3rfPqqZwYw_LWaCYdjCOd00I4y4MSaFaUW8lUmIOLXJRcRpmhPCtPq7qGL4KEkPATygtJYiFlE4qCYn9ssfKEbb5d9fd6_Vd33VbgudhH7yNjxNVo6QHacf0H9G5LR_Ajmp0HIQiIH90aV6th4WloP8O1X5_pT6rlUq_xKDHtkTjDFfZd0Dpcz5311XKs-wZfuUHP3WoUb8ZVN1ss_wzzO1xF4fFDNL04_1VfprGDQmqpyIdUEqsJaQAC6ZmJtI5Qq6m1Ema1ttSCA4JA8Sx3DRwOshcHFC4jtigzyg39hHb7Re8-I2xcbmDmbDzmDEiu4bnRwjDDmeWEtQn6vnGmuh-FMlRIMLJSjb5X3vcq-j5BP7zDH2_1KtfhAmCvIvbqJewTdOjh-v8-yGW5ZCJBxxv8VPwlHxQwR0EhARNFgtJHTJ_ZqkOfyie2Hr2GrV_Qnn_mWL05RrvDcuW-Ap8ZzCQM3UnYejhBb6bXN9Xvf4xN8s8 |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9QwEB1BOZQe-CwiUMAHjmSbxB9JuIWo1QLdPbVSb5btOLsVIVttE6Hl1-NJvEsLQiInK4oVO29sv5nYbwDeZ4LVNM2qMHfre8hyYUJNbRoKFjNMo2pqjuedZ3MxvWBfLvmlP6w-nIWx1g6bz-wEi8O__GplegyVHaOvwlMm7sMDzhjj43GtXUgFc0jkPPXaQnGUHxdl6brhvMCETyjP0sRHT7brzyDT7_Oq3KGY-317rTY_VNPcWm1OH8N8285xk8m3Sd_pifn5h4Tjf3fkCTzyvJMUo6E8hXu2fQYHt9QIn8PiZJCTcDWbDSn6boVktl2QEnd5YqFYr9WGjELViOdHUhDMpdaQcmkNxtyJaisys51a2n6UgCZFs1itr7rld1J4-fJDuDg9OS-noc_DEBoq4i5ME6OSpHJApshvUmMTahQ1JnVzY50rwZ0dOKJouK3cZZ0PZB0RjBKT5RHlmr6AvXbV2pdAtI21m38rtBzmqLLmsVZCM82Z4QmrA_iwRUdej3IbcnBTolyOYEoEU3owA_iECO4eRa3s4Yb72tIPPcnr2qL-Lk-0ZnGtFXPNiyMV00xYw1kAh4jQ7_d5cAI42hqE9AP7Rjr-Kahz40QWQLgzkr_aqoZsl3fa-uofr3kH-9Pz2Zk8-zz_-hoeYpUxxHMEe926t28c6en028HUfwGXrv1X |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELbQ9oA48CwitCAfOOIlfibhFqJWFVIrDqxUTpHtOLuIkK22idD21zOTpGUXJAQ5RZGjOJ7Pnm_8-IaQN6lRtUzSimXg35nKjGdOhoQZxRWmUfW1xvPO5xfmbKE-XurLSWcbz8Lsrt_zOHtnh7SBEMcJPZc6TQQKRx4YDcR7Rg4WF5_yL5g-jpuMyWEh8ugvb-75nkGif8qpskcv7_ftld3-sE2z42lOH41HuK8HgULcYPJt3ndu7m9-k2_8x594TB5OjJPmI0SekHuhfUoe7OgQPiPLk0FIAvxPs6V5362RxrZLWuD-TrzJNxu7paNENVryPc0pZlFraLEKHmfbqW0reh46uwr9KP5M82a53nztVt9pPgmXH5LF6cnn4oxNGRiYl4Z3LBHeClGBCRNkNokPQnorvU9gVKwzazQgACii16GCK0D0E4ACxsKnWSy1k8_JrF234QWhLnAHI2-FmFFAkp3mzhqnnFZeC1VH5O2tbcqrUWijHAKUOCvzogA0lth-5dR-EfmA9rsriirZwwNo93LqdKWu64DKu1o4p3jtrILq8dhymZrgtYrIIVr_1_cgFtaJMhE5voVDOXXp6xKYp5EQwJk0IuwOIn_UdbT1Xl1f_mf5YzLrNn14BWync68nlP8E7XL6Sg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficiently+Automating+Covering+Array+Generation%3A+A+Model+Checking+and+Metaheuristic+Algorithm+Approach&rft.jtitle=IEEE+access&rft.au=Esfandyari%2C+Sajad&rft.au=Giveki%2C+Davar&rft.au=Rastegarnia%2C+Amir&rft.au=Farzamnia%2C+Ali&rft.date=2025&rft.issn=2169-3536&rft.eissn=2169-3536&rft.volume=13&rft.spage=122804&rft.epage=122821&rft_id=info:doi/10.1109%2FACCESS.2025.3587202&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_ACCESS_2025_3587202 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon |