%0 Journal Article %1 seo_06_generatinga %A Seo, Heui S. %A Chung, In S. %A Kwon, Yong R. %D 2006 %J IEICE Trans Inf Syst %K _hardcopy 2006 tests statecharts %N 4 %P 1459--1469 %R 10.1093/ietisy/e89-d.4.1459 %T Generating Test Sequences from Statecharts for Concurrent Program Testing %U http://dx.doi.org/http://dx.doi.org/10.1093/ietisy/e89-d.4.1459 %V E89-D %X 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.

@article{seo_06_generatinga, 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.}, added-at = {2009-02-11T20:58:58.000+0100}, author = {Seo, Heui S. and Chung, In S. and Kwon, Yong R.}, biburl = {https://www.bibsonomy.org/bibtex/2f8d19e0cbd05785bd1f664a383ad4dcc/leonardo}, citeulike-article-id = {873550}, doi = {10.1093/ietisy/e89-d.4.1459}, interhash = {bf9d01e28ba123b97757358cc2c99afd}, intrahash = {f8d19e0cbd05785bd1f664a383ad4dcc}, journal = {IEICE Trans Inf Syst}, keywords = {_hardcopy 2006 tests statecharts}, number = 4, pages = {1459--1469}, posted-at = {2006-09-26 13:57:52}, priority = {2}, timestamp = {2009-02-11T20:58:58.000+0100}, title = {Generating Test Sequences from Statecharts for Concurrent Program Testing}, url = {http://dx.doi.org/http://dx.doi.org/10.1093/ietisy/e89-d.4.1459}, volume = {E89-D}, year = 2006 }