Mutation operators for concurrent programs in MPI

Silva, Rodolfo Adamshuk; Souza, Simone do Rocio Senger de; Souza, Paulo Sérgio Lopes de

doi:10.1109/latw.2012.6261240

Cited by 14 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Abordagens são propostas também para a técnica baseada em defeitos, como o teste de mutação (GLIGORIC et al, 2010;SILVA et al, 2012;GLIGORIC et al, 2013).…”

Section: Trabalhos Relacionadosunclassified

Um framework para avaliação sistemática de técnicas de teste no contexto de programação concorrente

Melo¹

View full text Add to dashboard Cite

show abstract

“…Abordagens são propostas também para a técnica baseada em defeitos, como o teste de mutação (GLIGORIC et al, 2010;SILVA et al, 2012;GLIGORIC et al, 2013).…”

Section: Trabalhos Relacionadosunclassified

Um framework para avaliação sistemática de técnicas de teste no contexto de programação concorrente

Melo¹

View full text Add to dashboard Cite

show abstract

“…A segunda categoria, "Ponto a ponto", contém operadores de mutação que podem ser aplicados em funções que realizam comunicação ponto a ponto subdividida em operadores aplicadosàs funções de send, receive e outras. Por fim, a categoria "Todas" mostra os operadores que podem ser aplicados tanto para as funções coletivas quanto para as funções ponto a ponto (Silva et al, 2012b).…”

Section: Operadores De Mutaçãounclassified

Teste de mutação aplicado a programas concorrentes em MPI

Silva¹

Self Cite

View full text Add to dashboard Cite

AgradecimentosAgradeço a Deus por, a cada dia, dar-me o melhor dia da minha vida: o hoje. Agradeço também por fazer-me forte e perseverante frente aos desafios de cada dia.A minha família, em especial aos meus pais, pelo apoio que me deram e por acreditarem que eu estou fazendo um bom trabalho aqui, mesmo longe deles. Obrigado por entenderem a minha ausência e por sempre oferecerem palavras de apoio quando as coisas apertavam por aqui.A minha orientadora, Prof. a Simone e ao Prof. Paulo, que aqui na USP costumamos dar o título de Mãe e Pai e que, de fato, foram minhas figuras materna e paterna aqui em São Carlos e que, sem dúvida, merecem receber esse título. Obrigado pela atenção, disponibilidade, ajuda e, principalmente, pela paciência que tiveram comigo. Obrigado pelos conselhos e pelas chamadas de atenção sempre que necessários.Aos meus amigos de Ponta Grossa, por entenderem que nãoé fácil voltar para Ponta Grossa com tanta frequência quanto todos gostaríamos.Ao pessoal do Laboratório de Engenharia de Software -LabES pela ajuda e convivência durante esse período e, em especial ao nosso "grupo": Arineiza, Draylson, Eduardo, Eliana, Harry, Joice, Juliana e Silvana. Agradeço também a todos que me ajudaram de alguma forma com a ferramenta ValiMPI.A Universidade de São Paulo. A FAPESP pelo apoio financeiro.v Abstract Concurrent programming became a popular paradigm for software development. This paradigm is essential to build applications which aim to reduce the computational time in many areas, such as, weather forecast, image processing, among others. These programs present new features such as communication, synchronization, and nondeterminism, which must be considered during the testing activity. Software testing is an activity that looks to ensure quality by identifying faults in the product. Mutation Testing is a criterion based on the most common mistakes that might be made by software developers. However, the mutation testing cannot be applied in concurrent programs the same way as applied in sequential ones due to the peculiarities present in concurrent programs. One of the problems in applying mutation testing in this context is the non-deterministic behavior. This work investigates the definition of mutation testing for concurrent programs implemented in MPI (Message Passing Interface), which perform communication and synchronization using message passing. For this, typical faults in this area were considered in order to model mutation operators addressing the aspects of communication and synchronization of these applications. Also, we are proposing a new procedure to support the behavioral analysis of the mutants. The ideas were implemented in a testing tool called ValiMPI Mut.

show abstract

“…In order to deal with the non-determinism in testing of concurrent programs, some strategies were defined, e.g. Deterministic Execution Mutation Testing (CARVER, 1993), Multiple Execution Testing , Behavior Mutation Analysis (SILVA-BARRADAS, 1998), Record and Playback (DELAMARO, 2004), Reachability Testing (LEI; CARVER, 2010) and DEMT and MET adapted (SILVA, 2013;SILVA et al, 2012a).…”

Section: Testing Strategiesmentioning

confidence: 99%

“…This model presents the problem of the explosion of concurrency states since the number of states grows exponentially with the number of processes and the number of synchronizations to be performed. Silva (2013) and Silva et al (2012a) developed two approaches to support mutation testing based on the DEMT and MET approaches. Reachability test is used for both approaches in the running of all synchronization sequences from a test input, generating a set of all possible output.…”

Section: Testing Strategiesmentioning

confidence: 99%

“…If an input is used several times in a concurrent program, different and correct outputs can be obtained, due to the synchronization sequences that may occur. Therefore, both output and synchronization sequence must be analyzed for the killing of a mutant, as reported by Carver (1993) (Deterministic Execution Mutation Testing), (Multiple Execution Testing), Silva-Barradas (1998) (Behavior Mutation Analysis), Delamaro et al (2001) (Record and Playback) and Silva et al (2012a), Silva (2013) (Multiple Execution Testing Adapted and Deterministic Execution Mutation Testing Adapted). Those techniques reduce the number of synchronization sequences, and however, they cannot select "interesting" sequences, i.e., sequences that kill more mutants.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Search based software testing for the generation of synchronization sequences for mutation testing of concurrent programs

Silva¹

Self Cite

View full text Add to dashboard Cite

Firstly, I would like to thank God for the possibility to live every day with happiness and motivation. I would like to thank my family: my parents and to my brother and sister for supporting me throughout this PH.D. and all my life in general. Besides that, thank you for believing in my potential more than myself sometimes. I would like to express my sincere gratitude to my advisor Prof. Dr. Simone do Rocio Senger de Souza for the continuous support of my Ph.D. study, for her attention, availability, help and, mainly, for her patience. Her guidance helped me during this research and writing of this thesis. Also, I would like Prof. Dr. Paulo Sergio Lopes de Souza for the comments, encouragement, support and contribution to this research. My sincere thanks also go to Prof. Dr. Gordon Fraser who provided me an opportunity to join their team as an intern at the University of Sheffield, and who gave me access to the laboratory and research facilities. Thank you for your support and advice. His precious support during the internship was crucial for the results present in this thesis. I want to thank all the friends I made in Sheffield that helped me to feel more comfortable there and showed me how tasty is the meat pie at The Old House.

show abstract

Mutation operators for concurrent programs in MPI

Cited by 14 publications

References 13 publications

Um framework para avaliação sistemática de técnicas de teste no contexto de programação concorrente

Um framework para avaliação sistemática de técnicas de teste no contexto de programação concorrente

Teste de mutação aplicado a programas concorrentes em MPI

Search based software testing for the generation of synchronization sequences for mutation testing of concurrent programs

Contact Info

Product

Resources

About