Service Description and Analysis From a Type Theoretic Approach

In this paper, we have presented a formalism to model data sources and services in SOA from a type-theoretic approach. The benefit of our framework is that we are able to statically analyze the type correctness of complex service compositions involving services and data queries. The central technique used for type analysis is unification. The computational complexity results of several different kinds of unification are shown: ranging from restricted but tractable cases to the most general but intractable cases. Finally, we have shown that many advanced features found modern types systems can be simulated by our type system without additional constructs.