2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2008
DOI: 10.1109/synasc.2008.38
|View full text |Cite
|
Sign up to set email alerts
|

A Theory of Adaptable Contract-Based Service Composition

Abstract: Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a cost: the software architect must ensure that the off-the-shelf components interact safely and in ways that conform with the specification. We develop a new theory for adaptable service compositions. The theory provides an effective framework for analyzing the conformance of contract-based service compositions, and for enforcing their… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(15 citation statements)
references
References 15 publications
0
15
0
Order By: Relevance
“…This is proved by Bernardi et al [2008] who extend our work (more precisely the version in ) for dealing with choreographies of Web services. Apart from a few technical differences-Bernardi et al disallow different summands of an external choice guarded by the same action and uses a fair variant of compliance- [Bernardi et al 2008] shows how filters provide a new interesting solution to the problem of Web service composition [Traverso and Pistore 2004;Berardi et al 2003;Hull et al 2003;Pistore et al 2005; De Giacomo and Sardiña [Berardi et al 2003;De Giacomo and Sardiña 2007].…”
Section: Related Workmentioning
confidence: 61%
See 1 more Smart Citation
“…This is proved by Bernardi et al [2008] who extend our work (more precisely the version in ) for dealing with choreographies of Web services. Apart from a few technical differences-Bernardi et al disallow different summands of an external choice guarded by the same action and uses a fair variant of compliance- [Bernardi et al 2008] shows how filters provide a new interesting solution to the problem of Web service composition [Traverso and Pistore 2004;Berardi et al 2003;Hull et al 2003;Pistore et al 2005; De Giacomo and Sardiña [Berardi et al 2003;De Giacomo and Sardiña 2007].…”
Section: Related Workmentioning
confidence: 61%
“…Apart from a few technical differences-Bernardi et al disallow different summands of an external choice guarded by the same action and uses a fair variant of compliance- [Bernardi et al 2008] shows how filters provide a new interesting solution to the problem of Web service composition [Traverso and Pistore 2004;Berardi et al 2003;Hull et al 2003;Pistore et al 2005; De Giacomo and Sardiña [Berardi et al 2003;De Giacomo and Sardiña 2007]. In [Bernardi et al 2008] both contracts and filters are associated with locations and can be composed for describing and constraining the participants interacting in a choreography. The notion of compliance is extended to compositions of located contracts and an algorithm is defined that infers the greatest relevant composite filter (cf.…”
Section: Related Workmentioning
confidence: 99%
“…Besides investigating the relationships between the existing definitions of compliance, we have also shown how to obtain compliance preorders for multiparty service compositions, by recasting and generalizing the theory of behavioral coercions from [8,9] to this setting. Our present endeavor continues on the line of work we initiated in [2]. There, we used filters to provide a new solution to the problem of web service adaptation within service compositions [18,1,10].…”
Section: Resultsmentioning
confidence: 99%
“…We conclude that σ C s , against the hypothesis. Thus the only possible case is (2): there exists at least one ρ = ρ n such that ρ n C n =⇒ ρ C and moreover for every ρ such that ρ n C n =⇒ ρ C it holds ρ = ρ i for some i < n. Thus for every ρ such that ρ n C n =⇒ ρ C it holds: ρ Since (σ C s ) there exists a computation σ n C n =⇒ σ * C * such that (σ * C * ) . In particular σ n w * =⇒ σ * .…”
Section: Definition 12 (Coinductive Safe-preorder)mentioning
confidence: 99%
“…§3.4.1 in this work) that makes a composition of located contracts satisfy compliance (which corresponds to our Corollary 3.24). Additionally Bernardi et al [2008] propose a new usage of filters, which can be seen as a specification of the roles occupied by the participants of a choreography.…”
Section: Related Workmentioning
confidence: 99%