A New Approach to Deterministic Execution Testing for Concurrent Programs

In Sang CHUNG; Byeong Man KIM

A New Approach to Deterministic Execution Testing for Concurrent Programs

In Sang CHUNG, Byeong Man KIM

Full Text Views

0

Cite this

Summary :

Deterministic execution testing has been considered a promising way for concurrent program testing because of its ability to replay a program's execution. Since, however, deterministic execution requires that a synchronization event sequence to be replayed be feasible and valid, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. Resolving this problem is very important because a program may still meet its specification although the feasibility of all valid sequences is not satisfied. In this paper, we present a new approach to deterministic execution for testing concurrent systems. The proposed approach makes use of the notion of event independence and constructs an automation which accepts all the sequences semantically equivalent to a given event sequence to be replayed. Consequently, we can allow a program to be executed according to event sequences other than the given (possible infeasible) sequence if they can be accepted by the automation.

Publication: IEICE TRANSACTIONS on Information Vol.E84-D No.12 pp.1756-1766

Publication Date: 2001/12/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Software Engineering

Cite this

Copy

In Sang CHUNG, Byeong Man KIM, "A New Approach to Deterministic Execution Testing for Concurrent Programs" in IEICE TRANSACTIONS on Information, vol. E84-D, no. 12, pp. 1756-1766, December 2001, doi: .
Abstract: Deterministic execution testing has been considered a promising way for concurrent program testing because of its ability to replay a program's execution. Since, however, deterministic execution requires that a synchronization event sequence to be replayed be feasible and valid, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. Resolving this problem is very important because a program may still meet its specification although the feasibility of all valid sequences is not satisfied. In this paper, we present a new approach to deterministic execution for testing concurrent systems. The proposed approach makes use of the notion of event independence and constructs an automation which accepts all the sequences semantically equivalent to a given event sequence to be replayed. Consequently, we can allow a program to be executed according to event sequences other than the given (possible infeasible) sequence if they can be accepted by the automation.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_12_1756/_p

Copy

@ARTICLE{e84-d_12_1756,
author={In Sang CHUNG, Byeong Man KIM, },
journal={IEICE TRANSACTIONS on Information},
title={A New Approach to Deterministic Execution Testing for Concurrent Programs},
year={2001},
volume={E84-D},
number={12},
pages={1756-1766},
abstract={Deterministic execution testing has been considered a promising way for concurrent program testing because of its ability to replay a program's execution. Since, however, deterministic execution requires that a synchronization event sequence to be replayed be feasible and valid, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. Resolving this problem is very important because a program may still meet its specification although the feasibility of all valid sequences is not satisfied. In this paper, we present a new approach to deterministic execution for testing concurrent systems. The proposed approach makes use of the notion of event independence and constructs an automation which accepts all the sequences semantically equivalent to a given event sequence to be replayed. Consequently, we can allow a program to be executed according to event sequences other than the given (possible infeasible) sequence if they can be accepted by the automation.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - A New Approach to Deterministic Execution Testing for Concurrent Programs
T2 - IEICE TRANSACTIONS on Information
SP - 1756
EP - 1766
AU - In Sang CHUNG
AU - Byeong Man KIM
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2001
AB - Deterministic execution testing has been considered a promising way for concurrent program testing because of its ability to replay a program's execution. Since, however, deterministic execution requires that a synchronization event sequence to be replayed be feasible and valid, it is not directly applicable to a situation in which synchronization sequences, being valid but infeasible, are taken into account. Resolving this problem is very important because a program may still meet its specification although the feasibility of all valid sequences is not satisfied. In this paper, we present a new approach to deterministic execution for testing concurrent systems. The proposed approach makes use of the notion of event independence and constructs an automation which accepts all the sequences semantically equivalent to a given event sequence to be replayed. Consequently, we can allow a program to be executed according to event sequences other than the given (possible infeasible) sequence if they can be accepted by the automation.
ER -