Linear logic as a foundation for service-oriented computing
Résumé
We present a calculus that provides formal and unified foundations to service- oriented computing. Service-oriented computing allows network-based software applica- tions to be developed by resorting to services as primitive components. To date, there are two popular – and often antagonistic – models for service-oriented computing. On the first hand, the computation-oriented model, illustrated by WS* Web services, considers services as sets of operations. On the other hand, the resource-oriented model, illustrated by Restful Web services, considers services as interfaces to resources. The lack of unified models leads to adaptation, integration and coordination problems, three major concerns in this field. Our calculus restores unity to service-oriented computing, by reconciling both points of view. We give the operational semantics of the calculus using chemical solutions, and illustrate its expressive power not only as a query language over resources with sup- port for recursion and aggregation, but also as a concurrent process language. Finally, we show that our calculus is also meaningful in logic programming since computation can be interpreted as proof search in focused linear logic with resource modalities: affine, contractible and exponential.
Domaines
Théorie et langage formel [cs.FL]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...