Symbolic Testing Approach of Composite Web Services

Web services are gaining industry-wide acceptance and usage by fostering the developmentof distributed applications out of the composition of simpler entities calledservices. In complement to verification, testing allows one to check for the correctnessof a binary (no source code) service implementation with reference to a specification.In this thesis, we propose black box conformance testing approach for centralizedservice compositions (orchestrations). With reference to the state of the art, wedevelop a symbolic approach in order to avoid state space explosion issues due to theXML data being largely used in Web services. This approach is based on symbolicmodels (STS), symbolic execution, and the use of a satisfiability modulo theory(SMT) solver. Further, we propose a comprehensive end-to-end approach that goesfrom specification using a standard orchestration language (ABPEL), and the possibledescription of test purposes, to the online realization and execution of symbolic testcases against an implementation. A crucial point is a model transformation fromABPEL to STS that we have defined and that takes into account the peculiarities ofABPEL semantics. The automation of our approach is supported by a tool-chainthat we have developed.

Data and Resources

Additional Info

Field Value
Source https://theses.hal.science/tel-00675918
Author Bentakouk, Lina
Maintainer CCSD
Last Updated May 26, 2026, 00:41 (UTC)
Created May 26, 2026, 00:41 (UTC)
Identifier NNT: 2011PA112348
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire de Recherche en Informatique (LRI) ; Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
creator Bentakouk, Lina
date 2011-12-16T00:00:00
harvest_object_id 93d3774d-0ca3-4c55-b14f-0352fc006761
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-03-30T00:00:00
set_spec type:THESE