Abstract | ||
---|---|---|
We address the problem of synthesizing specifications for composite Web services, starting from those of their component services. Unlike related work in programming languages, we assume the definition of the component services (i.e. their code) to be unavailable --- at best, they are known by a specification which (safely) approximates their functional behavior. Within this scenario, we deduce general formula schemes to derive specifications for basic constructs such as sequential, parallel compositions and conditionals and provide details on how to handle the special cases of loops and asynchronous execution. The resulting specifications facilitate service verification and service evolution as well as auditing processes, promoting trust between the involved partners. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/COMPSAC.2012.64 | COMPSAC |
Keywords | Field | DocType |
deriving specifications,composite web services,asynchronous execution,composite web service,parallel composition,service verification,general formula scheme,component service,functional behavior,service evolution,involved partner,basic construct,web services,formal verification,formal specification,computer science,programming languages,semantics | Asynchronous communication,Services computing,Programming language,Software engineering,Computer science,WS-I Basic Profile,Formal specification,Web service,Semantics,WS-Policy,Formal verification | Conference |
ISSN | Citations | PageRank |
0730-3157 | 2 | 0.38 |
References | Authors | |
8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
George Baryannis | 1 | 44 | 6.78 |
Manuel Carro | 2 | 5 | 1.21 |
Dimitris Plexousakis | 3 | 2586 | 326.38 |