Automated Generation of Web Service Stubs Using LTL Satisfiability Solving (WS-FM 2010)

  • 504 views
Uploaded on

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 behavior is represented by a logic formula φ, S can use a …

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 behavior 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.

  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
    Be the first to like this
No Downloads

Views

Total Views
504
On Slideshare
0
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
3
Comments
0
Likes
0

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide