# IWCT 2025 : 14th International Workshop on Combinatorial Testing

Conference completed its latest edition on March 31, 2025. The conference covers research topics in Uncategorized.

**Type**: Conference
**Status**: Expired
**Verified On**: 9th May, 2026

---

## ⏱ Critical Deadline
> *No submission deadline specified*

---

## 📍 Event Information
- **Mode**: In Person
- **Location**: Global
- **Field**: Interdisciplinary
- **Date**: March 31 - April 4, 2025
- **Official Website**: [https://conf.researchr.org/home/icst-2025/iwct-2025](https://conf.researchr.org/home/icst-2025/iwct-2025?utm_source=callforpaper.org)

---

## 📝 Call for Papers Description


<a href="https://callforpaper.org/categories/conomie" title="Browse  call for papers" rel="follow" aria-label="View more  call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors"></a>We invite submissions of high-<a href="https://callforpaper.org/categories/quality-1" title="Browse quality call for papers" rel="follow" aria-label="View more quality call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">quality</a> papers presenting original work on both theoretical and practical aspects of applying combinatorial methods to testing problems, targeting software, <a href="https://callforpaper.org/categories/systems" title="Browse systems call for papers" rel="follow" aria-label="View more systems call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">systems</a>-of-systems or other domains (including, but not limited to, biotechnology, mechanical <a href="https://callforpaper.org/categories/engineering" title="Browse engineering call for papers" rel="follow" aria-label="View more engineering call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">engineering</a>, <a href="https://callforpaper.org/categories/manufacturing-2" title="Browse manufacturing call for papers" rel="follow" aria-label="View more manufacturing call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">manufacturing</a>, quantum computing, finance and disaster research).<br><br>Each submission (in any category) must conform to the IEEE conference proceedings template, specified in the IEEE Conference Proceedings Formatting Guidelines ( All papers will be reviewed by at least three members from the program committee. If a submission is accepted, at least one author of the paper is required to attend the <a href="https://callforpaper.org/categories/workshop-1" title="Browse workshop call for papers" rel="follow" aria-label="View more workshop call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">workshop</a> in-person with an author registration and present the paper for it to be published in the ICST 2025 workshop proceedings.<br><br>Please direct any questions concerning submissions to IWCT 2025 to: iwct2025@sba-research.org<br><br>------------------------------<br>Submission<br>------------------------------<br>EasyChair instance of ICST 2025, please select track ‘IWCT 2025’: <br>------------------------------<br>Full and short papers<br>------------------------------<br>We invite submissions for full papers (up to 10 pages, including references) as well as short papers (up to 4 pages, including references). Accepted papers in these two categories – full and short – will be part of the proceedings of IWCT 2025.<br><br>------------------------------<br>Journal-First<br>------------------------------<br>The aim of the Journal-First (JF) submission category is to further enrich the program of IWCT, as well as to provide an overall more flexible path to publication and dissemination of original research that is within the scope of IWCT. A submission in this category must adhere to the following criteria:<br><br>1. It should be clearly within the scope of the workshop.<br>2. It should be recent: it should have been accepted and made publicly available in a journal (online or in print) by January 1, 2023 or more recently.<br>3. It has not been presented at, and is not under consideration for, Journal-First tracks of other conferences or workshops.<br>4. The submission has to be in the form of a 2-page extended abstract and has to provide a concise summary of the published journal paper.<br>Journal-First submissions must be marked as such in the submission’s title, and must explicitly include full bibliographic details (including a DOI) of the journal publication they are based on. Since the referenced journal papers have already been reviewed and accepted by the corresponding journals, submissions in the JF category will not be reviewed again for technical content. Submissions will be judged on the basis of the above criteria, but also considering how well they would complement the workshop’s technical program. Accepted submissions in this category will be part of the proceedings of IWCT 2025, with the title equal to the original title of the article with the prefix “Summary of”.<br><br>------------------------------<br>Posters<br>------------------------------<br>In addition to the traditional program topics from the past years, and taking advantage of the fact that some of the lead CT tool developers have expressed interest in participating again in the fourth iteration of the CT competition, we would like to offer with the poster session a low-threshold opportunity – especially targeting industry – to present activities within the scope of the workshop to the participants of IWCT. A tool demonstration can be given alongside a poster. In case a poster contribution wishes to provide more details or <a href="https://callforpaper.org/categories/information-1" title="Browse information call for papers" rel="follow" aria-label="View more information call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">information</a>, but does not want to submit a short or full paper, the authors can choose to submit in addition to the poster a maximal 2-page extended abstract detailing the content of the poster. The title of the extended abstract has to have the prefix “Extended Abstract of Poster” and these extended abstracts – if accepted – will also appear in the proceedings of IWCT 2025.<br><br>------------------------------<br>Post-proceedings of IWCT 2025 in Section VI of Journal SN Computer Science<br>------------------------------<br>We plan to organize a call among the best papers of the workshop to submit extended versions to the journal SN Computer Science in the Section ‘Combinatorial Methods and Models in System Testing’ ( More information will be provided at the workshop.<br><br>------------------------------<br>Topics for submissions<br>------------------------------<br>Topics of interest for submissions include, but are not limited to:<br><br>* Combinatorial testing workflow<br><br>  - Modeling the input <a href="https://callforpaper.org/categories/space-1" title="Browse space call for papers" rel="follow" aria-label="View more space call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">space</a> for CT – the input to CT algorithms consists of the desired strength of coverage, a set of parameters together with their respective values, and constraints on value combinations. This input should capture correctly the points of variability in testing the system. While this input is clearly crucial for the effectiveness of CT, it is a difficult problem.<br>  - Efficient algorithms to generate test plans with small size for t-way testing for t ) 2, involving support of constraints on combinations that are possible.<br>  - Determination of expected system behavior for each test case – while the test cases are automatically generated by the CT algorithm, determining the expected system behavior is currently usually a manual task.<br>  - Executing CT test plans – the result of CT algorithms is a list of tests, where a test is represented by a value assignment for each parameter. There is still significant effort in transforming this representation into actual tests that a tester or testing tool can execute.<br>  - Combinatorial testing based fault localization.<br>  - Implementation of CT in existing testing infrastructures.<br>  - Handling changes in test <a href="https://callforpaper.org/categories/requirements-1" title="Browse requirements call for papers" rel="follow" aria-label="View more requirements call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">requirements</a> – current CT methods focus on one-time generation of a test plan from a given set of requirements, but test requirements are almost never static, and tend to change between different releases and versions. However, generating a new plan of tests for each release may not be practical either.<br><br>*  Real-world experience in <a href="https://callforpaper.org/categories/deployment-1" title="Browse deployment call for papers" rel="follow" aria-label="View more deployment call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">deployment</a> of combinatorial testing<br>  - Empirical studies and feedback from practical applications of CT.<br>  - CT targeting AI/<a href="https://callforpaper.org/categories/ml-1" title="Browse ML call for papers" rel="follow" aria-label="View more ML call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">ML</a>-based systems.<br>  - CT targeting security, including hardware and chip security.<br>  - CT targeting autonomous, concurrent and real-time systems.<br>  - CT targeting <a href="https://callforpaper.org/categories/cloud-computing" title="Browse cloud computing call for papers" rel="follow" aria-label="View more cloud computing call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">cloud computing</a> systems and use of combinatorial methods in cloud architecture.<br>  - CT targeting feature models for software product lines.<br>  - CT targeting other domains; e.g., study of gene regulations and other biotechnology applications, mechanical engineering, testing in manufacturing hardware, quantum computing domain, financial domain or disaster management.<br><br>* Applicability of combinatorial testing<br>  - Comparison and combination of CT with other dynamic <a href="https://callforpaper.org/categories/verification-1" title="Browse verification call for papers" rel="follow" aria-label="View more verification call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">verification</a> methods.<br>  - Investigation of historical records of failures to determine the kind of CT which may have detected underlying faults.<br>  - Methodology used for test space modeling and determination of <a href="https://callforpaper.org/categories/interaction-1" title="Browse interaction call for papers" rel="follow" aria-label="View more interaction call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">interaction</a> coverage requirements.<br>  - Evaluation and return of investment metrics to assess the degree of usefulness of CT.<br>  - Discussion of challenges and open problems in the <a href="https://callforpaper.org/categories/application-1" title="Browse application call for papers" rel="follow" aria-label="View more application call for papers" class="!text-inherit !font-normal !underline decoration-dotted decoration-slate-400/60 underline-offset-4 cursor-pointer hover:decoration-slate-900 dark:hover:decoration-slate-100 transition-colors">application</a> of CT in an industrial setting.<br><br>* Combinatorial and complementing methods<br>  - Combinatorial analysis of existing test plans – analyzing test plans not generated by a CT algorithm in light of a combinatorial test space.<br>  - Test plan reduction and completeness – both under stable, and under changing test requirements.<br>  - CT and coverage metrics – combining the two, and studying the relation between them.
	

---

## 🏷 Taxonomy &amp; Topics
- **Primary Category**: N/A
- **Research Fields**: 
  - Uncategorized

---

## 🧭 Agent Instructions
- **Standard Link**: `https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472`
- **Markdown Link**: `https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472.md`
- **PDF Version**: `https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472.pdf`



---

## 🎓 Academic Citations &amp; Bibliographic Records

Use these pre-formatted snippets to cite this Call for Papers in publications or reference managers:

### Plain Text
```text
IWCT 2025 : 14th International Workshop on Combinatorial Testing. March 31, 2025 – April 04, 2025. Available at: https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472. Accessed: August 5, 2026.
```

### APA Style 7th edition
```text
IWCT 2025 : 14th International Workshop on Combinatorial Testing. (2025, March 31 – April 04). https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472
```

### IEEE
```text
&quot;IWCT 2025 : 14th International Workshop on Combinatorial Testing,&quot; Mar. 31, 2025–Apr. 04, 2025. [Online]. Available: https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472. [Accessed: August 5, 2026].
```

### BibTeX
```bibtex
@misc{iwct20252025cfp,
  title     = {IWCT 2025 : 14th International Workshop on Combinatorial Testing},
  year      = {2025},
  month     = mar,
  url       = {https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472},
  note      = {Call for Papers. Accessed: 2026-08-05}
}
```

### RIS (Reference Manager, EndNote)
```ris
TY  - CONF
TI  - IWCT 2025 : 14th International Workshop on Combinatorial Testing
PY  - 2025
DA  - 2025/03/31
UR  - https://callforpaper.org/cfp/iwct-2025-14th-international-workshop-on-combinatorial-testing_2472
N1  - Call for Papers. Accessed: 2026-08-05
ER  -
```

