%P 69-86
%T Provably Correct Implementations of Services
%I Springer
%A Roberto Bruni
%A Rocco De Nicola
%A Michele Loreti
%A Leonardo Gaetano Mezzina
%S Lecture Notes in Computer Science
%L eprints282
%D 2009
%E Christos Kaklamanis
%E Flemming Nielson
%X A number of formalisms have been defined to support the specification and analysis of service oriented applications. These formalisms have been equipped with tools (types or logics) to guarantee the correct behavior of the specified services. Due to the semantic gap between the specification formalism and the programming languages of service oriented overlay computers a critical issue is guaranteeing that correctness is preserved when running the specified systems over available implementations. We have defined a service oriented abstract machine, equipped with a formal structural semantics, that can be used to implement service specification formalisms. We use our abstract machine to implement different service oriented formalisms that have been recently proposed, each posing specific challenges that we can address successfully. By exploiting the SOS semantics of the abstract machine and those of the considered service oriented formalisms we do prove that our implementations are correct (sound and complete). We also discuss possible implementations of other formalisms.

%B Trustworthy Global Computing (TGC 2008)
%N 5474
%R 10.1007/978-3-642-00945-7_5