Towards a Metamorphic Testing Methodology for Service-Oriented Software Applications

Chan, W. K.; Cheung, Shing-Chi; Leung, Kwok Wa

doi:10.1109/qsic.2005.67

Cited by 38 publications

(22 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After manually studying 70 MRs reported in the literature [38,12,47,68,83,14,70,58,59,71,44], we found that 43 (61.4%) MRs are polynomial, i.e., the relations between inputs and the relations between outputs are both polynomial equations. Therefore, in this paper, we focus on inferring only such polynomial MRs.…”

Section: Introductionmentioning

confidence: 95%

“…That is, our approach tries to find a set of parameter values that characterize the analyzed executions in the form of an MR. Furthermore, to improve the quality of MRs, our approach applies statistics based filtering to the inferred MRs. Based on our study on the literature of MRs [38,47,68,83,12,14,70,58,59,71,44], 23 (53.5%) polynomial MRs are simple polynomial MRs whose relations between inputs are linear equations and whose relations between outputs are linear or quadratic equations. Therefore, in the current stage our approach focuses on inferring these particular polynomial MRs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Search-based inference of polynomial metamorphic relations

Zhang

Chen

Hao

et al. 2014

Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering

102

View full text Add to dashboard Cite

Metamorphic testing (MT) is an effective methodology for testing those so-called "non-testable" programs (e.g., scientific programs), where it is sometimes very difficult for testers to know whether the outputs are correct. In metamorphic testing, metamorphic relations (MRs) (which specify how particular changes to the input of the program under test would change the output) play an essential role. However, testers may typically have to obtain MRs manually.In this paper, we propose a search-based approach to automatic inference of polynomial MRs for a program under test. In particular, we use a set of parameters to represent a particular class of MRs, which we refer to as polynomial MRs, and turn the problem of inferring MRs into a problem of searching for suitable values of the parameters. We then dynamically analyze multiple executions of the program, and use particle swarm optimization to solve the search problem.To improve the quality of inferred MRs, we further use MR filtering to remove some inferred MRs.We also conducted three empirical studies to evaluate our approach using four scientific libraries (including 189 scientific functions). From our empirical results, our approach is able to infer many high-quality MRs in acceptable time (i.e., from 9.87 seconds to 1231.16 seconds), which are effective in detecting faults with no false detection.

show abstract

Section: Introductionmentioning

confidence: 95%

Section: Introductionmentioning

confidence: 99%

Search-based inference of polynomial metamorphic relations

Zhang

Chen

Hao

et al. 2014

Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering

102

View full text Add to dashboard Cite

show abstract

“…To address this issue Gupta and Bajpai (2014) Chan et al (2007) proposed framework for testing SOA applications. This study is extension of Chan et al (2005). Proposed framework uses metamorphic testing approach.…”

Section: Literature Reviewmentioning

confidence: 99%

A scenario-based distributed testing model for software applications

Mehmood

Mahmood²,

Khan

et al. 2016

Int. j. adv. appl. sci

View full text Add to dashboard Cite

Modern software applications are getting more complex in order to provide better service and quality. This complexity has given birth too many challenges for software testing such as functional discontinuation and detection of system level defects. Existing testing techniques which are based on test cases are time consuming and unable to offer higher confidence on quality of products for these complex applications. Distributed testing frameworks could be used to test complex software but these frameworks do not provide a global picture of testing activities and application status. This poor visibility results in poor control over testing activities. In this study we have proposed a distributed testing model (DisTest) using scenario-based testing technique. DisTest could be used with any COTS test automation tool and could be employed at any testing level. Result shows DisTest provides better visibility and control on testing activities and view of application status.

show abstract

“…Chan et al [4] applied metamorphic relations to construct test cases for stateless web services. Li et al [10] studied unit testing problems for service orchestration.…”

Section: Related Workmentioning

confidence: 99%

“…Software built on top of the service-oriented architecture (SOA) is increasingly popular [4][14] [27], and yet testing such software remains tedious and ill-understood. In these applications, primary components are typically known as services.…”

Section: Introductionmentioning

confidence: 99%

Data flow testing of service choreography

Mei

Chan

Tse

2009

Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Found

View full text Add to dashboard Cite

Service computing has increasingly been adopted by the industry, developing business applications by means of orchestration and choreography. Choreography specifies how services collaborate with one another by defining, say, the message exchange, rather than via the process flow as in the case of orchestration. Messages sent from one service to another may require the use of different XPaths to manipulate or extract message contents. Mismatches in XML manipulations through XPaths (such as to relate incoming and outgoing messages in choreography specifications) may result in failures. In this paper, we propose to associate XPath Rewriting Graphs (XRGs), a structure that relates XPath and XML schema, with actions of choreography applications that are skeletally modeled as labeled transition systems. We develop the notion of XRG patterns to capture how different XRGs are related even though they may refer to different XML schemas or their tags. By applying XRG patterns, we successfully identify new data flow associations in choreography applications and develop new data flow testing criteria. Finally, we report an empirical case study that evaluates our techniques. The result shows our techniques are promising in detecting failures in choreography applications.

show abstract

Towards a Metamorphic Testing Methodology for Service-Oriented Software Applications

Cited by 38 publications

References 11 publications

Search-based inference of polynomial metamorphic relations

Search-based inference of polynomial metamorphic relations

A scenario-based distributed testing model for software applications

Data flow testing of service choreography

Contact Info

Product

Resources

About