Refinement in statechart testingA version of this paper was originally presented at SoftTest II: The Second U.K. Workshop on Software Testing Research, held at the University of York, U.K., 4–5 September 2003. It is reproduced here in modified form with the permission of the Workshop organizers
Saved in:
| Title: | Refinement in statechart testing |
|---|---|
| Authors: | Bogdanov, K.1 k.bogdanov@dcs.shef.ac.uk, Holcombe, M.1 |
| Source: | Software Testing: Verification & Reliability. Sep2004, Vol. 14 Issue 3, p189-211. 23p. |
| Subjects: | Statecharts (Computer science), Software engineering, Computer software development, Structured techniques of electronic data processing, Computer systems, Computer software industry |
| Abstract: | An existing statechart testing method developed by the authors allows a tester to show the equivalence of the behaviour of an implementation of some software system to its Harel statechart specification, by testing. This requires a rather large test set and satisfaction of certain requirements for both a specification and an implementation. Introduction of additional constraints permits reduction in a test set size, without weakening of the conclusions obtained by testing. This paper describes how a test set can be derived from a relatively big statechart and investigates the role of a few specific constraints in the reduction of test set size, depending on where in the system structure these constraints are used. The main contribution of the paper is a demonstration that enforcing relatively weak constraints in the right place of a system's structure makes it possible to reduce the size of a test set by many orders of magnitude. The practical use of the contribution is to help developers structure a system under construction in such a way that it is completely testable using the described testing method with few additional constraints. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
| Copyright of Software Testing: Verification & Reliability is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 14556304 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Refinement in statechart testing<FNR></FNR><FN>A version of this paper was originally presented at SoftTest II: The Second U.K. Workshop on Software Testing Research, held at the University of York, U.K., 4–5 September 2003. It is reproduced here in modified form with the permission of the Workshop organizers </FN> – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bogdanov%2C+K%2E%22">Bogdanov, K.</searchLink><relatesTo>1</relatesTo><i> k.bogdanov@dcs.shef.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Holcombe%2C+M%2E%22">Holcombe, M.</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Software+Testing%3A+Verification+%26+Reliability%22">Software Testing: Verification & Reliability</searchLink>. Sep2004, Vol. 14 Issue 3, p189-211. 23p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Statecharts+%28Computer+science%29%22">Statecharts (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Software+engineering%22">Software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+development%22">Computer software development</searchLink><br /><searchLink fieldCode="DE" term="%22Structured+techniques+of+electronic+data+processing%22">Structured techniques of electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+industry%22">Computer software industry</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: An existing statechart testing method developed by the authors allows a tester to show the equivalence of the behaviour of an implementation of some software system to its Harel statechart specification, by testing. This requires a rather large test set and satisfaction of certain requirements for both a specification and an implementation. Introduction of additional constraints permits reduction in a test set size, without weakening of the conclusions obtained by testing. This paper describes how a test set can be derived from a relatively big statechart and investigates the role of a few specific constraints in the reduction of test set size, depending on where in the system structure these constraints are used. The main contribution of the paper is a demonstration that enforcing relatively weak constraints in the right place of a system's structure makes it possible to reduce the size of a test set by many orders of magnitude. The practical use of the contribution is to help developers structure a system under construction in such a way that it is completely testable using the described testing method with few additional constraints. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Software Testing: Verification & Reliability is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=14556304 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/stvr.301 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 189 Subjects: – SubjectFull: Statecharts (Computer science) Type: general – SubjectFull: Software engineering Type: general – SubjectFull: Computer software development Type: general – SubjectFull: Structured techniques of electronic data processing Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Computer software industry Type: general Titles: – TitleFull: Refinement in statechart testing<FNR></FNR><FN>A version of this paper was originally presented at SoftTest II: The Second U.K. Workshop on Software Testing Research, held at the University of York, U.K., 4–5 September 2003. It is reproduced here in modified form with the permission of the Workshop organizers </FN> Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bogdanov, K. – PersonEntity: Name: NameFull: Holcombe, M. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2004 Type: published Y: 2004 Identifiers: – Type: issn-print Value: 09600833 Numbering: – Type: volume Value: 14 – Type: issue Value: 3 Titles: – TitleFull: Software Testing: Verification & Reliability Type: main |
| ResultId | 1 |
