%0 Journal Article %1 massink_06_testing %A Massink, Mieke %A Latella, Diego %A Gnesi, Stefania %D 2006 %J Journal of Logic and Algebraic Programming %K 2006 tests statecharts uml %N 1-2 %P 1--74 %R 10.1016/j.jlap.2006.03.001 %T On testing UML statecharts %U http://dx.doi.org/10.1016/j.jlap.2006.03.001 %V 69 %X We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one hand, upon formal testing and conformance theory that has originally been developed in the context of process algebras and Labeled Transition Systems (LTSs), and, on the other hand, upon our previous work on formal semantics for UMLSCs. The paper covers the development of proper extensional testing preorders and equivalence for UMLSCs. We present an algorithm for testing equivalence verification which is based on an intensional characterization of the testing relations. Testing equivalence verification is reduced to bisimulation equivalence verification. We also address the issue of conformance testing and present a formal conformance relation together with a test case generation algorithm which is proved sound and exhaustive w.r.t. the conformance relation. We show results on the formal relationship of the testing relations with the conformance one. The comprehensive and uniform approach presented in this paper sets the theoretical basis for UMLSCs testing frameworks and makes them available for practitioners in industry where the UML has become a de facto standard, in particular there where it is used for the development of complex concurrent systems.

@article{massink_06_testing, abstract = {We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one hand, upon formal testing and conformance theory that has originally been developed in the context of process algebras and Labeled Transition Systems (LTSs), and, on the other hand, upon our previous work on formal semantics for UMLSCs. The paper covers the development of proper extensional testing preorders and equivalence for UMLSCs. We present an algorithm for testing equivalence verification which is based on an intensional characterization of the testing relations. Testing equivalence verification is reduced to bisimulation equivalence verification. We also address the issue of conformance testing and present a formal conformance relation together with a test case generation algorithm which is proved sound and exhaustive w.r.t. the conformance relation. We show results on the formal relationship of the testing relations with the conformance one. The comprehensive and uniform approach presented in this paper sets the theoretical basis for UMLSCs testing frameworks and makes them available for practitioners in industry where the UML has become a de facto standard, in particular there where it is used for the development of complex concurrent systems.}, added-at = {2009-02-11T20:58:06.000+0100}, author = {Massink, Mieke and Latella, Diego and Gnesi, Stefania}, biburl = {https://www.bibsonomy.org/bibtex/2317fdacc3eb0f7f20c6c51ebad5022e5/leonardo}, citeulike-article-id = {812895}, doi = {10.1016/j.jlap.2006.03.001}, interhash = {a868b002fadc3876ebc762a78e3d79ee}, intrahash = {317fdacc3eb0f7f20c6c51ebad5022e5}, journal = {Journal of Logic and Algebraic Programming}, keywords = {2006 tests statecharts uml}, mrnumber = {MR2251237}, number = {1-2}, pages = {1--74}, posted-at = {2006-08-22 18:54:57}, priority = {2}, timestamp = {2009-02-11T20:58:06.000+0100}, title = {On testing UML statecharts}, url = {http://dx.doi.org/10.1016/j.jlap.2006.03.001}, volume = 69, year = 2006 }