Using Large Language Models to Classify Test Case Complexity with Explainability
The classification of black-box test case complexity is a key task in software testing, enabling resource prioritization and the identification of edge scenarios. In this work, we propose a three-stage LLM-based pipeline that integrates explanation generation into the classification process, treating justifications as central to model decision-making. Our approach formulates the task as a conditional generation problem, where LLMs are guided to first produce a rationale and then a complexity label. Experimental results demonstrate that this strategy improves both predictive accuracy and explainability compared to using LLMs directly for classification. We show that LLM-generated justifications not only enhance user trust but also contribute to more consistent and explainable decisions.
Authors
- Raquel Marques (ORCID: https://orcid.org/0000-0002-1445-7592)
- Yan F. F. Soares (ORCID: https://orcid.org/0000-0002-7151-141X)
- Marlei Rosa dos Santos (ORCID: https://orcid.org/0000-0001-8251-618X)
- Tiago Custódio (ORCID: https://orcid.org/0000-0001-5620-6145)
- Nikson Ferreira (ORCID: https://orcid.org/0000-0003-4249-7599)
- André Carvalho (ORCID: https://orcid.org/0000-0002-7903-6705)
- Hallyson Melo
Publication Details
- Published
- 2025-09-22
- DOI
- https://doi.org/10.5753/sbes.2025.11575
- Primary Topic
- Software Engineering Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Universidade Federal do Amazonas
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
- Fundação de Amparo à Pesquisa do Estado do Amazonas