Advanced search
Start date
Betweenand

A search approach for supporting the identification of infeasible sequences in concurrent software

Grant number: 18/25744-6
Support type:Scholarships in Brazil - Doctorate
Effective date (Start): August 01, 2019
Effective date (End): July 31, 2022
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Computing Methodologies and Techniques
Principal researcher:Simone Do Rocio Senger de Souza
Grantee:João Choma Neto
Home Institution: Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil

Abstract

Software testing activity is imperative to improve the quality of a software product. However, finding a set of test data that satisfies a given test criterion is not a trivial task because the domain can be large and different test sets can be satisfactory solutions. Testing concurrent programs in addition to presenting the sequential program problems yet, for example, can address the problem of non-determinism and non-executability of synchronization sequences. Search Based Software Engineering (SBSE) seeks to solve difficult problems like this by using search algorithms. Numerous research reports the benefits of using genetic algorithms to solve problems related to software testing and other Software Engineering (SE) problems. After previous results of a state-of-the-art survey, no work was found regarding the use of genetic algorithms to solve the problem of non-executable synchronization sequences in concurrent programs. This project proposes the use of the genetic algorithm to support the problem of non-executability in concurrent programs. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.