Statement-coverage testing for concurrent programs in reachability testing

Gwan Hwan Hwang, Heng Yi Lin, Shao Yan Lin, Che Sheng Lin

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


In this paper we propose a scheme for reachability testing to achieve statement coverage in the dynamic testing of concurrent programs. Previous studies on reachability testing have only enumerated the feasible interleavings of a concurrent program for a given input. The proposed scheme derives inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program. We prove formally that the proposed method can achieve statement-coverage testing if all the path conditions derived from SYN-sequences can be solved and the concurrent program contains no dead code.

Original languageEnglish
Pages (from-to)1095-1113
Number of pages19
JournalJournal of Information Science and Engineering
Issue number4
Publication statusPublished - 2014 Jul


  • Concurrent programs
  • Concurrent testing
  • Nondeterministic behavior
  • Reachability testing
  • Symbolic execution
  • Synsequence

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics


Dive into the research topics of 'Statement-coverage testing for concurrent programs in reachability testing'. Together they form a unique fingerprint.

Cite this