How to Identify the Infeasible Test Requirements using Static Analyse? An Exploratory Study

Author(s)

Choma Neto, Joao ; Mori, Allan ; Vilela, Ricardo Ferreira ; Colanzi, Thelma E. ; de Souza, Simone R. S. ; Filipe, J ; Smialek, M ; Brodsky, A ; Hammoudi, S

• Document type: Journal article
• Source: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS 2021), VOL 1; v. N/A, p. 8-pg., 2021-01-01.

Abstract

Context: Software testing is an essential activity to ensure the quality of the software. However, the selection and generation of test cases can be an expensive and hard task. A large number of infeasible test requirements (e.g. infeasible paths) collaborate to increase the effort on test data generation, and it is not a trivial task to identify them. Objective: To investigate and analyze an process of properties of infeasible test requirements identification in a static way without inputs data through an exploratory study. Methodology: We gathered a set of statistical properties to identify infeasible test requirements without the use of input data. We manually verified the identification process using a benchmark with 19 Java programs. Results and conclusions: The alternative process identified infeasible requirements without using input data and proved effective. This study highlights the tester's role in the process of identifying the infeasible elements and also the need to automate this process because level of complexity in decision making. (AU)

• FAPESP's process: 19/06937-0 - Study and development of software testing techniques and their applications
• Grantee: Márcio Eduardo Delamaro
• Support Opportunities: Regular Research Grants
• FAPESP's process: 18/25744-6 - A search approach for supporting the identification of infeasible sequences in concurrent software
• Grantee: João Choma Neto
• Support Opportunities: Scholarships in Brazil - Doctorate