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 journalArticle

4 Citations (Scopus)

Abstract

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
Volume30
Issue number4
Publication statusPublished - 2014

Fingerprint

coverage
Testing

Keywords

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

ASJC Scopus subject areas

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

Cite this

Statement-coverage testing for concurrent programs in reachability testing. / Hwang, Gwan Hwan; Lin, Heng Yi; Lin, Shao Yan; Lin, Che Sheng.

In: Journal of Information Science and Engineering, Vol. 30, No. 4, 2014, p. 1095-1113.

Research output: Contribution to journalArticle

Hwang, Gwan Hwan ; Lin, Heng Yi ; Lin, Shao Yan ; Lin, Che Sheng. / Statement-coverage testing for concurrent programs in reachability testing. In: Journal of Information Science and Engineering. 2014 ; Vol. 30, No. 4. pp. 1095-1113.
@article{b7a8f5f299054865aec0f47b302165c3,
title = "Statement-coverage testing for concurrent programs in reachability testing",
abstract = "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.",
keywords = "Concurrent programs, Concurrent testing, Nondeterministic behavior, Reachability testing, Symbolic execution, Synsequence",
author = "Hwang, {Gwan Hwan} and Lin, {Heng Yi} and Lin, {Shao Yan} and Lin, {Che Sheng}",
year = "2014",
language = "English",
volume = "30",
pages = "1095--1113",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "4",

}

TY - JOUR

T1 - Statement-coverage testing for concurrent programs in reachability testing

AU - Hwang, Gwan Hwan

AU - Lin, Heng Yi

AU - Lin, Shao Yan

AU - Lin, Che Sheng

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Concurrent programs

KW - Concurrent testing

KW - Nondeterministic behavior

KW - Reachability testing

KW - Symbolic execution

KW - Synsequence

UR - http://www.scopus.com/inward/record.url?scp=84940243977&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940243977&partnerID=8YFLogxK

M3 - Article

VL - 30

SP - 1095

EP - 1113

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 4

ER -