Stochastic Voting Algorithms for Web Services Group Testing
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Automating property-based testing of evolving web services
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
| Hi-index | 0.00 |
Web Services (WS) need to be trustworthy to be used in critical applications. A technique called WS Group Testing has been proposed which can significantly reduce the cost of testing and ranking a large number of WS. A main feature of WS group testing is that it is able to establish the test oracles for the given test inputs from multiple WS and infer the oracles by plural voting. Efficient voting of complex and large number of data is critical to the success of group testing. Current voting techniques are not designed to deal with such a situation. This paper presents efficient voting algorithms that determine the plural value on multi-dimensional data and large number of data. The algorithm uses a clustering method to classify data into regions to identify the plural value. Experiments are designed and performed to concept-prove the algorithms and their applications with group testing.