Abstract. Web services utilize a standard communication infrastructure such as XML and SOAP to communicate through the Internet. Even though Web services are becoming more and more widespread as an emerging technology, it is hard to test Web services because they are distributed applications with numerous aspects of runtime behavior that are different from typical applications. This paper presents a new approach to testing Web services based on EFSM (Extended Finite State Machine). WSDL (Web Services Description Language) file alone does not provide dynamic behavior information. This problem can be overcome by augmenting it with a behavior specification of the service. Rather than domain partitioning or perturbation techniques, we choose EFSM because Web services have control flow as well as data flow like communication protocols. By appending this formal model of EFSM to standard WSDL, we can generate a set of test cases which has a better test coverage than other methods. Moreover, a procedure for deriving an EFSM model from WSDL specification is provided to help a service provider augment the EFSM model describing dynamic behaviors of the Web service. To show the efficacy of our approach, we applied our approach to Parlay-X Web services. In this way, we can test Web services with greater confidence in potential fault detection.
Given a vector field defined on a robot's configuration space, in which the vector field represents the system drift, e.g. a wind velocity field, water current flow, or gradient field for some potential function, we present a randomized path planning algorithm for reaching a desired goal configuration. Taking the premise that moving against the vector field requires greater control effort, and that minimizing the control effort is both physically meaningful and desirable, we propose an integral functional for control effort, called the upstream criterion, that measures the extent to which a path goes against the given vector field. The integrand of the upstream criterion is then used to construct a rapidly exploring random tree (RRT) in the configuration space, in a way such that random nodes are generated with an a priori specified bias that favors directions indicated by the vector field. The resulting planning algorithm produces better quality paths while preserving many of the desirable features of RRT-based planning, e.g. the Voronoi bias property, computational efficiency, algorithmic simplicity, and straightforward extension to constrained and nonholonomic problems. Extensive numerical experiments demonstrate the advantages of our algorithm vis-à-vis existing optimality criterion-based planning algorithms.
Software complexity has increased the need for automated software testing. Most research on automating testing, however, has focused on creating test input data. While careful selection of input data is necessary to reach faulty states in a system under test, test oracles are needed to actually detect failures. In this work, we describe Dodona, a system that supports the generation of test oracles. Dodona ranks program variables based on the interactions and dependencies observed between them during program execution. Using this ranking, Dodona proposes a set of variables to be monitored, that can be used by engineers to construct assertion-based oracles. Our empirical study of Dodona reveals that it is more effective and efficient than the current state-of-the-art approach for generating oracle data sets, and can often yield oracles that are almost as effective as oracles hand-crafted by engineers without support.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.