Testing and verification in service‐oriented architecture: a survey

Bozkurt, Mustafa; Harman, Mark; Hassoun, Youssef

doi:10.1002/stvr.1470

Cited by 96 publications

(90 citation statements)

References 189 publications

(347 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Generally speaking, dynamic techniques cannot distinguish the feasibility of path precisely. Dynamic techniques are not suitable for the detection of path feasibility of BPEL process because of the cost of testing [7].…”

Section: Related Workmentioning

confidence: 99%

“…Generally speaking, dynamic techniques cannot distinguish the feasibility of path precisely. Therefore, dynamic techniques are not suitable for the detection of path feasibility of BPEL processes because of the following reasons [7]: The cost of using a service (for services with access quotas or per-use basis); Service disruptions that might be caused by massive testing; Effects of testing in some systems, such as stock-exchange systems, where each usage of the service means a business transaction.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Wang

Xing

Li³

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWeb Service Business Process Execution Language (BPEL) has become the de facto standard for developing instant serviceoriented workflow applications in open environment. The correctness and reliability of BPEL processes have gained increasing concerns. However, the unique features (e.g., dead path elimination (DPE) semantics, parallelism, etc.) of BPEL language have raised enormous problems to it, especially in path feasibility analysis of BPEL processes. Path feasibility analysis of BPEL processes is the basis of BPEL testing, for it relates to the test case generation. Since BPEL processes support both parallelism and DPE semantics, existing techniques can't be directly applied to its path feasibility analysis. To address this problem, we present a novel technique to analyze the path feasibility for BPEL processes. First, to tackle unique features mentioned above, we transform a BPEL process into an intermediary model -BPEL control flow graph, which is proposed to abstract the execution flow of BPEL processes. Second, based on this abstraction, we symbolically encode every path of BPEL processes as some Satisfiability formulas. Finally, we solve these formulas with the help of Satisfiability Modulo Theory (SMT) solvers and the feasible paths of BPEL processes are obtained. We illustrate the applicability and feasibility of our technique through a case study.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Wang

Xing

Li³

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Thus, the application of this technique to C++ WS can be fruitful, taking into account that errors in ScS are difficult to locate once deployed. Regarding the reliability measurement of these ScS, a considerable amount of research have been undertaken [2]. However, much of the testing work developed is specificationbased as access to the service code is generally limited or simply non-existing.…”

Section: C++ and Web Servicesmentioning

confidence: 99%

“…Moreover, class mutation operators can be applied to any OO system. Thus, one of the areas where this technique can be really useful is Service-centric Systems (ScS) [2]. On one hand, mutation testing has been performed on Web Service (WS) compositions [1,6], black-box testing them at the interface level.…”

mentioning

confidence: 99%

Class mutation operators for C++ object-oriented systems

et al. 2014

View full text Add to dashboard Cite

Mutation testing is a fault injection testing technique around which a great variety of studies and tools for different programming languages have been developed. Nevertheless, the mutation testing research with respect to C++ is pending. This paper proposes a set of class mutation operators related to this language and its particular object-oriented (OO) features. In addition, an implementation technique to apply mutation testing based on the traversal of the abstract syntax tree (AST) is presented. Finally, an experiment is conducted to study the operator behaviour with different C++ programs, suggesting their usefulness in the creation of complete test suites. The analysis includes a Web Service (WS) library, one of the domains where this technique can prove useful, considering its challenging testing phase and that C++ is still a reference language for critical distributed systems WS.

show abstract

“…One of the potential solutions for establishing trust among different stakeholders is testing, which potentially provides the necessary assurance in correct functioning of ScS. Not surprisingly, this pressing need has led to a dramatic recent increase in the number of publications on ScS testing [6].…”

Section: Introductionmentioning

confidence: 99%

Optimised Realistic Test Input Generation Using Web Services

Bozkurt

Harman

2012

Search Based Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. We introduce a multi-objective formulation of service-oriented testing, focusing on the balance between service price and reliability. We experimented with NSGA2 for this problem, investigating the effect on performance and quality of composition size, topology and the number of services discovered. For topologies small enough for exhaustive search we found that NSGA2 finds a pareto front very near (the fronts are a Euclidean distance of ∼ 0.00024 price-reliability points apart) the true pareto front. Regarding performance, we find that composition size has the strongest effect, with smaller topologies consuming more machine time; a curious effect we believe is due to the influence of crowding distance. Regarding result quality, our results reveal that size and topology have more effect on the front found than the number of service choices discovered. As expected the cost-reliability relationship (logarithmic, linear, exponential) is replicated in the front discovered when correlation is high, but as the price-reliability correlation decreases, we find fewer solutions on the front and the front becomes less smooth.

show abstract

Testing and verification in service‐oriented architecture: a survey

Cited by 96 publications

References 189 publications

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Class mutation operators for C++ object-oriented systems

Optimised Realistic Test Input Generation Using Web Services

Contact Info

Product

Resources

About