All-du-path coverage for parallel programs

Yang, Cheer-Sun; Souter, Amie L.; Pollock, Lori

doi:10.1145/271771.271804

Cited by 73 publications

(43 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Using controlled execution, it is possible to force the order these executions. Considering to first execution (PCPC) the executed paths and their synchronizations are: 2,3,4,5,6,8,9,10,11,12} π 1 = {1, 2,3,4,5,6,8,9,10,11,3,4,5,6,7,8,9,10,11,12} π 2 = {1, 2,3,4,5,6,8,9,10,11,3,4,5,6,7,8,9,10,11 To illustrate a communication fault consider that avail was initialized with 1 (1 0 ) and all synchronizations are correct. This fault can be revealed with the execution of the required elements comm-c-use (7 2 , 7 2 , avail) and edge-s (9 2 , 5 2 ).…”

Section: Data Flow and Communication-based Criteriamentioning

confidence: 99%

“…In the literature there are some works that address testing of concurrent programs [4,5,6,7,8,9]. Most of these works propose a test model to represent the concurrent program and to support the testing application.…”

mentioning

confidence: 99%

“…PPFG (Parallel Program Flow Graph) is a graph where was inserted the concept of synchronization node to the CFG [5,10]. In the PPFG each process that composes the program has its own CFG.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Structural Testing for Semaphore-Based Multithread Programs

Sarmanho

Souza

et al. 2008

Computational Science – ICCS 2008

View full text Add to dashboard Cite

show abstract

Section: Data Flow and Communication-based Criteriamentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Structural Testing for Semaphore-Based Multithread Programs

Sarmanho

Souza

et al. 2008

Computational Science – ICCS 2008

View full text Add to dashboard Cite

show abstract

“…The all-inter-context-edges criterion subsumes the allbranches criterion because all-inter-context-edges covers controlflow edges in individual FGs of the application as well as the new kinds of edges captured by ICFGs. Table 2 Data-flow adequacy criteria [9][11] [20] [33] are remarkable for selecting test cases to expose faults related to improper data uses. Data-flow criteria require that test cases cause the application to exercise paths from locations that define variables to locations that subsequently use these variables.…”

Section: Criterion 1 a Test Suite T Satisfies The All-inter-context-mentioning

confidence: 99%

“…These calling contexts may interleave and share resources, such as CPU and memory, so that the application can use these resources economically because of tight resource constraints in sensor motes. 1 http://www.mail-archive.com/tinyos-help@millennium.berkeley.edu/msg13570.html Existing testing techniques for concurrent programs [20] [33] rely on the identification of synchronization primitives to analyze interleaving among concurrent subroutines. However, the number of possible interleaving for applications written in generalpurpose languages (e.g., Java) is often huge.…”

Section: Introductionmentioning

confidence: 99%

Inter-context control-flow and data-flow test adequacy criteria for nesC applications

Lai

Cheung

Chan

2008

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering

View full text Add to dashboard Cite

NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known as contexts, to perform its actions. However, a high degree of inter-context interleaving in an application can cause it to be error-prone. For instance, a context may mistakenly alter another context's data kept at a shared variable. Existing concurrency testing techniques target testing programs written in general-purpose programming languages, where a small scale of inter-context interleaving between program executions may make these techniques inapplicable. We observe that nesC blocks new context interleaving when handling interrupts, and this feature significantly restricts the scale of inter-context interleaving that may occur in a nesC application. This paper models how operations on different contexts may interleave as inter-context flow graphs. Based on these graphs, it proposes two test adequacy criteria, one on inter-context data-flows and another on intercontext control-flows. It evaluates the proposal by a real-life open-source nesC application. The empirical results show that the new criteria detect significantly more failures than their conventional counterparts.

show abstract

Structural testing criteria for message‐passing parallel programs

Souza¹,

Vergílio²,

Souza³

et al. 2008

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYParallel programs present some features such as concurrency, communication and synchronization that make the test a challenging activity. Because of these characteristics, the direct application of traditional testing is not always possible and adequate testing criteria and tools are necessary. In this paper we investigate the challenges of validating message-passing parallel programs and present a set of specific testing criteria. We introduce a family of structural testing criteria based on a test model. The model captures control and data flow of the message-passing programs, by considering their sequential and parallel aspects. The criteria provide a coverage measure that can be used for evaluating the progress of the testing activity and also provide guidelines for the generation of test data. We also describe a tool, called ValiPar, which supports the application of the proposed testing criteria. Currently, ValiPar is configured for parallel virtual machine (PVM) and message-passing interface (MPI). Results of the application of the proposed criteria to MPI programs are also presented and analyzed.

show abstract

All-du-path coverage for parallel programs

Cited by 73 publications

References 12 publications

Structural Testing for Semaphore-Based Multithread Programs

Structural Testing for Semaphore-Based Multithread Programs

Inter-context control-flow and data-flow test adequacy criteria for nesC applications

Structural testing criteria for message‐passing parallel programs

Contact Info

Product

Resources

About