Patrick Felix

Automated Runtime Verification for Web Services

This paper presents a methodology to perform passive testing of behavioural conformance for the web services based on the security rule. The proposed methodology can be used either to check a trace (offline checking) or to runtime verification (online checking) with timing constraints, including future and past time. In order to perform this: firstly, we use the Nomad language to define the security rules. Secondly, we propose an algorithm that can check simultaneously multi instances. Afterwards, with each security rule, we propose a graphical statistics, with some fixed properties, that helps the tester to easy assess about the service. In addition to the theoretical framework we have developed a software tool, called RV4WS (Runtime Verification engine for Web Service), that helps in the automation of our passive testing approach. In particular the algorithm presented in this paper is fully implemented in the tool. We also present a mechanism to collect the observable trace in this paper.

WSOTF: An Automatic Testing Tool for Web Services Composition

This paper presents an automatic conformance testing tool with timing constraints from a formal specification (TEFSM: Timed Extended Finite State Machine) of web services composition (WSOTF: Web Service composition, Online Testing Framework), that is implemented by an online testing algorithm. This algorithm combines simultaneously idea of test execution and debug to generate and simultaneously execute the test cases. In this tool, the complete test scenario (timed test case suite and data) is built during test execution. This tool focus on unit testing, it means that only the service composition under test is tested and all its partners will be simulated by the WSOTF. This tool also considers the timing constraints and synchronous time delay. We can also use this tool for debug that is not easy while we develop a composite of Web services.

Testing Web Services Composition Using the TGSE Tool

This paper proposes an approach to test (actively and passively) Web services composition described in BPEL using TGSE (Test Generation, Simulation and Emulation), that is a tool for generating test cases for Communicating Systems (CS). TGSE implements a generic generation algorithm allowing either test cases derivation or traces checking. It supports the description of one or several components with data and temporal constraints. First, in order to model the BPEL behaviors, the timing constraints, and data variables, the BPEL specification is transformed into the Timed Extended Finite State Machines (TEFSM) model. As our framework can handle both active and passive testing, on the one hand test cases are obtained by stimulating the CS. In this case, the exploration is guided by the use of test purposes modeled by TEFSM (a test purpose is considered as a part of the CS). On the other hand, TGSE can check whether a trace is valid according the specification or not. Finally, the Loan Web Service is used as a case study.

Testing of Web Services: Tools and Experiments

Web services are the element based in SOA (i.e., Service Oriented Architecture) applications that are commonly used in software systems. However the validation problem on quality of web services via testing has to be improved. This paper presents two tools for conformance testing of web services. One tool for unit testing that is implemented by an on-line approach. This tool can be used to test a web service-based and/or an orchestration by simulating its partners. The other focuses on verification of a timed trace with respect to a set of constraints. Specially, we can use this tool to verify on-line or off-line a timed trace. Finally, we show our experiments on a real-life case study, Product Retriever, by combining the two tools.

Test case minimization for real-time systems using timed bound traces

Real-Time systems (RTS for short) are those systems whose behavior is time dependent. Reliability and safety are of paramount importance in designing and building RTS because a failure of an RTS puts the public and/or the environment at risk. For the purpose of effective error reporting and testing, this paper considers the trace inclusion problem for RTS: given a path ρ (resp. ρ′) of length n of a timed automaton A (resp. B), find whether the set of timed traces of ρ of length n are included in the set of timed traces of ρ′ of length n such that A is known but not B. We assume that the traces of ρ′ are only defined by a decision procedure. The proposed solution is based on the identification of a set of timed bound traces. The latter gives a finite representation of the trace space of a path. The number of these timed bounds varies between 1 and 2 × (n+1). The trace inclusion problem is then reduced to the inclusion of timed bound traces. The paper shows also how these results can be used to reduce the number of test cases for an RTS.