Dynamic data-flow testing

Vivanti, Mattia

doi:10.1145/2591062.2591079

Cited by 3 publications

References 68 publications

(99 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Thread Scheduling Sequence Generation Based on All Synchronization Pair Coverage Criteria

Jun

Zheng

Shi

et al. 2020

Int. J. Soft. Eng. Knowl. Eng.

View full text Add to dashboard Cite

Testing multi-thread programs becomes extremely difficult because thread interleavings are uncertain, which may cause a program getting different results in each execution. Thus, Thread Scheduling Sequence (TSS) is a crucial factor in multi-thread program testing. A good TSS can obtain better testing efficiency and save the testing cost especially with the increase of thread numbers. Focusing on the above problem, in this paper, we discuss a kind of approach that can efficiently generate TSS based on the concurrent coverage criteria. First, we give a definition of Synchronization Pair (SP) as well as all Synchronization Pairs Coverage (ASPC) criterion. Then, we introduce the Synchronization Pair Thread Graph (SPTG) to describe the relationships between SPs and threads. Moreover, this paper presents a TSS generation method based on the ASPC according to SPTG. Finally, TSSs automatic generation experiments are conducted on six multi-thread programs in Java Library with the help of Java Path Finder (JPF) tool. The experimental results illustrate that our method not only generates TSSs to cover all SPs but also requires less state number, transition number as well as TSS number when satisfying ASPC, compared with other three widely used TSS generation methods. As a result, it is clear that the efficiency of TSS generation is obviously improved.

show abstract

Thread Scheduling Sequence Generation Based on All Synchronization Pair Coverage Criteria

Jun

Zheng

Shi

et al. 2020

Int. J. Soft. Eng. Knowl. Eng.

View full text Add to dashboard Cite

show abstract

A Survey on Data-Flow Testing

Miao

et al. 2017

ACM Comput. Surv.

View full text Add to dashboard Cite

Data-flow testing (DFT) is a family of testing strategies designed to verify the interactions between each program variable’s definition and its uses. Such a test objective of interest is referred to as a def-use pair . DFT selects test data with respect to various test adequacy criteria (i.e., data-flow coverage criteria ) to exercise each pair. The original conception of DFT was introduced by Herman in 1976. Since then, a number of studies have been conducted, both theoretically and empirically, to analyze DFT’s complexity and effectiveness. In the past four decades, DFT has been continuously concerned, and various approaches from different aspects are proposed to pursue automatic and efficient data-flow testing. This survey presents a detailed overview of data-flow testing, including challenges and approaches in enforcing and automating it: (1) it introduces the data-flow analysis techniques that are used to identify def-use pairs; (2) it classifies and discusses techniques for data-flow-based test data generation, such as search-based testing, random testing, collateral-coverage-based testing, symbolic-execution-based testing, and model-checking-based testing; (3) it discusses techniques for tracking data-flow coverage; (4) it presents several DFT applications, including software fault localization, web security testing, and specification consistency checking; and (5) it summarizes recent advances and discusses future research directions toward more practical data-flow testing.

show abstract

Dataflow approach to testing Java programs supported with DFC

Bluemke

Rembiszewski²

2015

E-Informatica Vol. IX

View full text Add to dashboard Cite

Dynamic data-flow testing

Cited by 3 publications

References 68 publications

Thread Scheduling Sequence Generation Based on All Synchronization Pair Coverage Criteria

Thread Scheduling Sequence Generation Based on All Synchronization Pair Coverage Criteria

A Survey on Data-Flow Testing

Dataflow approach to testing Java programs supported with DFC

Contact Info

Product

Resources

About