Web services composition verification using satisfiability solving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Web services composition verification using satisfiability solving

Olivier Perrin
  • Function : Author
  • PersonId : 830785
Claude Godart
  • Function : Author
  • PersonId : 830462
  • IdRef : 031091733


In this paper, we propose an approach for the verification of declarative Web services composition processes using satisfiability solving. The need for the satisfiability solving approach stems from the nature of declarative processes which are defined by only specifying the constraints that mark the boundary of the solution to the composition process. As a result the state space of a declarative process can be significantly large, as the process is only partially defined and all the transitions have not been explicitly defined. Further, as the conflict clauses returned by the SAT solver can be significantly large for complex processes and verification requirements, we propose a filtering criteria and defined patterns for identifying the clauses of interest for process verification.
No file

Dates and versions

hal-00764804 , version 1 (13-12-2012)



Ehtesham Zahoor, Olivier Perrin, Claude Godart. Web services composition verification using satisfiability solving. IEEE 19th International Conference on Web Services, Jun 2012, Honolulu, United States. pp.242-249, ⟨10.1109/ICWS.2012.75⟩. ⟨hal-00764804⟩
108 View
0 Download



Gmail Facebook X LinkedIn More