Results 1 - 10
of
23
The Conversation Calculus: a Model of Service-Oriented Computation
"... We present a process-calculus model for expressing and analyzing service-based systems. Our approach addresses central features of the service-oriented computational model such as distribution, process delegation, communication and context sensitiveness, and loose coupling. Distinguishing aspects of ..."
Abstract
-
Cited by 11 (4 self)
- Add to MetaCart
We present a process-calculus model for expressing and analyzing service-based systems. Our approach addresses central features of the service-oriented computational model such as distribution, process delegation, communication and context sensitiveness, and loose coupling. Distinguishing aspects of our model are the notion of conversation context, the adoption of a context sensitive, message-passing-based communication, and of a simple yet expressive mechanism for handling exceptional behavior. We instantiate our model by extending a fragment of the π-calculus, illustrate its expressiveness by means of many examples, and study its basic behavioral theory; in particular, we establish that bisimilarity is a congruence. 1
Disciplining Orchestration and Conversation in Service-Oriented Computing
- In Proceedings of SEFM’07
, 2007
"... ..."
Sessions and session types: an overview
- In 6th International Workshop on Web Services and Formal Methods (WS-FM’09
, 2010
"... Abstract. We illustrate the concepts of sessions and session types as they have been developed in the setting of the π-calculus. Motivated by the goal of obtaining a formalisation closer to existing standards and aiming at their enhancement and strengthening, several extensions of the original core ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
Abstract. We illustrate the concepts of sessions and session types as they have been developed in the setting of the π-calculus. Motivated by the goal of obtaining a formalisation closer to existing standards and aiming at their enhancement and strengthening, several extensions of the original core system have been proposed, which we survey together with the embodying of sessions into functional and object-oriented languages, as well as some implementations.
Regulating data exchange in service oriented applications
- IN FSEN, VOLUME 4767 OF LNCS
, 2007
"... We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining data exchanges in terms of sets of service partner names attachable to each single datum. Service programmers explicitly wri ..."
Abstract
-
Cited by 8 (6 self)
- Add to MetaCart
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining data exchanges in terms of sets of service partner names attachable to each single datum. Service programmers explicitly write only the annotations necessary to specify the wanted policies for communicable data, while a type inference system (statically) derives the minimal additional annotations that ensure consistency of services initial configuration. Then, the language dynamic semantics only performs very simple checks to authorize or block communication. We prove that the type system and the operational semantics are sound. As a consequence, we have the following data protection property: services always comply with the policies regulating the exchange of data among interacting services. We illustrate our approach through a simplified but realistic scenario for a service-based electronic marketplace.
Secure Service Orchestration
, 2007
"... We present a framework for designing and composing services in a secure manner. Services can enforce security policies locally, and can invoke other services in a “call-by-contract” fashion. This mechanism offers a significant set of opportunities, each driving secure ways to compose services. We di ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
We present a framework for designing and composing services in a secure manner. Services can enforce security policies locally, and can invoke other services in a “call-by-contract” fashion. This mechanism offers a significant set of opportunities, each driving secure ways to compose services. We discuss how to correctly plan service orchestrations in some relevant classes of services and security properties. To this aim, we propose both a core functional calculus for services and a graphical design language. The core calculus is called λ req [10]. It features primitives for selecting and invoking services that respect given behavioural requirements. Critical code can be enclosed in security framings, with a possibly nested, local scope. These framings enforce safety properties on execution histories. A type and effect system over-approximates the actual run-time behaviour of services. Effects include the actions with possible security concerns, as well as information about which services may be selected at run-time. A verification step on these effects allows for detecting the viable plans that drive the selection of those services that match the security requirements on demand.
The Conversation Calculus: a Model of Service Oriented Computation
- In Proc. of ESOP’08, LNCS
, 2008
"... We present a process calculus model for expressing and analyzing service based systems. Our approach addresses central features of the service oriented computational model such as distribution, process delegation, communication and context sensitiveness, and loose coupling. Distinguishing aspects of ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
We present a process calculus model for expressing and analyzing service based systems. Our approach addresses central features of the service oriented computational model such as distribution, process delegation, communication and context sensitiveness, and loose coupling. Distinguishing aspects of our model are the notion of conversation context, the adoption of a context sensitive, message passing based communication, and of a simple yet expressive mechanism for handling exceptional behavior. We instantiate our model by extending a fragment of the π-calculus, illustrate its expressiveness by means of many examples, and study its basic behavioral theory. 1
Planning and verifying service composition
, 2007
"... A static approach is proposed to study secure composition of services. We extend the λ-calculus with primitives for selecting and invoking services that respect given security requirements. Security-critical code is enclosed in policy framings with a possibly nested, local scope. Policy framings enf ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
A static approach is proposed to study secure composition of services. We extend the λ-calculus with primitives for selecting and invoking services that respect given security requirements. Security-critical code is enclosed in policy framings with a possibly nested, local scope. Policy framings enforce safety and liveness properties. The actual run-time behaviour of services is over-approximated by a type and effect system. Types are standard, and effects include the actions with possible security concerns — as well as information about which services may be invoked at run-time. An approximation is model-checked to verify policy framings within their scopes. This allows for removing any run-time execution monitor, and for determining the plans driving the selection of those services that match the security requirements on demand. 1
Formal Methods for Service Composition
"... Abstract — Current approaches to service composition In this paper, we first describe and compare these range from industrial standards (like BPEL and OWL-S) to formal methods (like Petri nets and process algebras). In this paper, we survey a number of such approaches and compare them with respect t ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract — Current approaches to service composition In this paper, we first describe and compare these range from industrial standards (like BPEL and OWL-S) to formal methods (like Petri nets and process algebras). In this paper, we survey a number of such approaches and compare them with respect to a carefully selected set of characteristics (like exception handling and quality approaches to service composition w.r.t. a selected set of main characteristics to assess their quality, much in the style of [49]. We then survey the increasing use of formal methods (mainly state-action models like Petri of services). We conclude that formal methods, often nets or process models like the π-calculus) to formally including tool support, are ideal to assist designers and developers because their use leads to increased confidence in the obtained compositions. specify, compose and verify service compositions, and also compare these w.r.t. the selected set of characteristics. Finally, we discuss the expected advantage of using
Service discovery and negotiation with COWS
"... To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider.
A formal account of WS-BPEL
"... We introduce Blite, a lightweight language for web services orchestration designed around some of WS-BPEL peculiar features like partner links, process termination, message correlation, long-running business transactions and compensation handlers. Blite formal presentation helps clarifying some amb ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We introduce Blite, a lightweight language for web services orchestration designed around some of WS-BPEL peculiar features like partner links, process termination, message correlation, long-running business transactions and compensation handlers. Blite formal presentation helps clarifying some ambiguous aspects of the WS-BPEL specification, which have led to engines implementing different semantics and, thus, undermined portability of WS-BPEL programs over different platforms. We illustrate the main features of Blite by means of many examples, some of which are also exploited to test and compare with each other the behaviour of three of the most known free WS-BPEL engines.

