This paper presents an approach to specification-based testing of concurrent programs with representative test sequences generated from Statecharts. Representative test sequences are a subset of all possible interleavings of concurrent events that define the behaviors of a concurrent program. Because a program's correctness may be determined by checking whether a program implemented all behaviors in its specification or not, the program can be regarded as being correct if it can supply an alternative execution that has the same effects as the program's behavior with each representative test sequence. Based on this observation, we employ each representative test sequence as a seed to generate an automaton that accepts its equivalent sequences to reveal the same behavior. In order to effectively test a concurrent program, the automaton such generated accepts all sequences equivalent to the representative test sequence and it is used to control test execution. This paper describes an automated process of generating automata from a Statecharts specification and shows how the proposed approach works on Statecharts specifications through some examples.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Heui-Seok SEO, In Sang CHUNG, Yong Rae KWON, "Generating Test Sequences from Statecharts for Concurrent Program Testing" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 4, pp. 1459-1469, April 2006, doi: 10.1093/ietisy/e89-d.4.1459.
Abstract: This paper presents an approach to specification-based testing of concurrent programs with representative test sequences generated from Statecharts. Representative test sequences are a subset of all possible interleavings of concurrent events that define the behaviors of a concurrent program. Because a program's correctness may be determined by checking whether a program implemented all behaviors in its specification or not, the program can be regarded as being correct if it can supply an alternative execution that has the same effects as the program's behavior with each representative test sequence. Based on this observation, we employ each representative test sequence as a seed to generate an automaton that accepts its equivalent sequences to reveal the same behavior. In order to effectively test a concurrent program, the automaton such generated accepts all sequences equivalent to the representative test sequence and it is used to control test execution. This paper describes an automated process of generating automata from a Statecharts specification and shows how the proposed approach works on Statecharts specifications through some examples.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.4.1459/_p
Copy
@ARTICLE{e89-d_4_1459,
author={Heui-Seok SEO, In Sang CHUNG, Yong Rae KWON, },
journal={IEICE TRANSACTIONS on Information},
title={Generating Test Sequences from Statecharts for Concurrent Program Testing},
year={2006},
volume={E89-D},
number={4},
pages={1459-1469},
abstract={This paper presents an approach to specification-based testing of concurrent programs with representative test sequences generated from Statecharts. Representative test sequences are a subset of all possible interleavings of concurrent events that define the behaviors of a concurrent program. Because a program's correctness may be determined by checking whether a program implemented all behaviors in its specification or not, the program can be regarded as being correct if it can supply an alternative execution that has the same effects as the program's behavior with each representative test sequence. Based on this observation, we employ each representative test sequence as a seed to generate an automaton that accepts its equivalent sequences to reveal the same behavior. In order to effectively test a concurrent program, the automaton such generated accepts all sequences equivalent to the representative test sequence and it is used to control test execution. This paper describes an automated process of generating automata from a Statecharts specification and shows how the proposed approach works on Statecharts specifications through some examples.},
keywords={},
doi={10.1093/ietisy/e89-d.4.1459},
ISSN={1745-1361},
month={April},}
Copy
TY - JOUR
TI - Generating Test Sequences from Statecharts for Concurrent Program Testing
T2 - IEICE TRANSACTIONS on Information
SP - 1459
EP - 1469
AU - Heui-Seok SEO
AU - In Sang CHUNG
AU - Yong Rae KWON
PY - 2006
DO - 10.1093/ietisy/e89-d.4.1459
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2006
AB - This paper presents an approach to specification-based testing of concurrent programs with representative test sequences generated from Statecharts. Representative test sequences are a subset of all possible interleavings of concurrent events that define the behaviors of a concurrent program. Because a program's correctness may be determined by checking whether a program implemented all behaviors in its specification or not, the program can be regarded as being correct if it can supply an alternative execution that has the same effects as the program's behavior with each representative test sequence. Based on this observation, we employ each representative test sequence as a seed to generate an automaton that accepts its equivalent sequences to reveal the same behavior. In order to effectively test a concurrent program, the automaton such generated accepts all sequences equivalent to the representative test sequence and it is used to control test execution. This paper describes an automated process of generating automata from a Statecharts specification and shows how the proposed approach works on Statecharts specifications through some examples.
ER -