Automated generation of web service stubs using LTL satisfiability solving

  • Authors:
  • Sylvain Hallé

  • Affiliations:
  • Université du Québec à Chicoutimi, Canada

  • Venue:
  • WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a web service W, a stub is a simple service S intended to impersonate W and simulate some of its input-output patterns. When W's behaviour is represented by a logic formula ϕ, S can use a satisfiability solver to drive the simulation and generate valid messages compliant with ϕ. A satisfiability solver for a variant of first-order temporal logic, called LTL-FO+, is described. Using a chain of existing, off-the-shelf tools, a stub can be generated from a set of LTL-FO+ formulæ expressing a wide range of constraints, including message sequences, parameter values, and interdependencies between both. This, in turn, produces a faithful simulation of the original service that can be used for development and testing.