A model for concurrent states and its coverage criteria

Empirical evaluation of a new composite approach to the coverage criteria and reachability testing of concurrent programs

“…Published research in the general area of concurrent program testing has covered aspects such as failure injection , static analysis , controlled execution , mutation testing , model checking , model‐based testing , coverage testing , symbolic analysis , reachability testing and test case generation . In this section are discussed only the relevant related research.…”

“…Kojima et al , employ the all‐concurrent‐paths criterion on a Concurrent Module Flow Graph to execute the structural testing of embedded concurrent software present in different devices, such as high‐definition TVs, recorders and mobile phones. To overcome the very large quantity of test cases required when the number of elements increases, the authors propose to suppress test cases by considering the happens‐before relation between local blocks (those that do not include operating shared resources) and focus the testing activity on the external operation blocks instead (those operating on shared resources).…”

Otimizando o teste estrutural de programas concorrentes: uma abordagem determinística e paralela

“…Os resultados do experimento mostraram que o método apresentado foi eficiente na cobertura do critério todas-arestas e os algoritmos com base em ordenação topológica obtiveram os melhores resultados, apresentando 100% de cobertura para o grafo de alcançabilidade e para o critério todasarestas. Kojima et al (2009) propõem um modelo de teste estrutural para programas concorrentes com memória compartilhada. O código fonte do programa é classificado em blocos em relação ao uso de recursos compartilhados, no qual um bloco é um conjunto sequencial de código fonte.…”

Contribuições na área de Teste de Software Concorrente.

“…They can be classified in several different ways, considering for example static or dynamic approaches and shared-memory and/or message-passing paradigms and also considering the language and/or standard used. The published papers are distributed over a number of discrete testing topics, such as failure injection [26], formal verification [27][28][29][30][31][32][33], static analysis [34][35][36], testing-driven development [37][38][39], controlled execution [40][41][42][43][44][45][46], mutation testing [47][48][49], model checking [50][51][52][53], model-based testing [54,55], structural testing [56][57][58][59][60][61][62][63][64][65][66][67][68][69][70][71][72], symbolic analysis [73,…”

“…Kojima et al [63] used the All-Concurrent-Paths criterion on a concurrent module flow graph to execute structural testing of embedded concurrent software present in different devices, such as high-definition TVs, recorders, and mobile phones. To overcome the very large quantity of test cases required when the number of elements increases, the authors proposed to suppress test cases considering the relation happens-before between local blocks (those that do not include operating shared resources) and focus the testing activity in the external operation blocks instead (i.e., those that operate on shared resources).…”