Workflow Global Computing with YML

Author(s):  
Olivier Delannoy ◽  
FranceNahid Emad ◽  
Serge Petiton
Keyword(s):  
Author(s):  
Rocco De Nicola ◽  
Michele Loreti

A new area of research, known as Global Computing, is by now well established. It aims at defining new models of computation based on code and data mobility over wide-area networks with highly dynamic topologies, and at providing infrastructures to support coordination and control of components originating from different, possibly untrusted, fault-prone, malicious or selfish sources. In this paper, we present our contribution to the field of Global Computing that is centred on Kernel Language for Agents Interaction and Mobility ( Klaim ). Klaim is an experimental language specifically designed to programme distributed systems consisting of several mobile components that interact through multiple distributed tuple spaces. We present some of the key notions of the language and discuss how its formal semantics can be exploited to reason about qualitative and quantitative aspects of the specified systems.


2011 ◽  
Vol 21 (6) ◽  
pp. 1111-1181
Author(s):  
ANA ALMEIDA MATOS ◽  
JAN CEDERQUIST

With the emergence of the new possibilities offered by global computing, new security issues follow from the fact that these possibilities can be equally exploited by parties with malicious intentions. Many attacks arise at the application level, and can be tackled by means of programming language techniques. For instance, confidentiality can be violated during the execution of programs that reveal secret information. This kind of program behaviour can be avoided by information flow analyses that detect the encoding of illegal flows.This paper studies information flows that occur in distributed programs with code mobility from a language-based security perspective. New forms of security leaks that are introduced by code mobility, which we callmigration leaks, are presented and compared with well-known forms of illegal flow. We propose an information flow property that is adequate for networks consisting of a generalisation of the non-disclosure policy. We design a type and effect system for enforcing it on an expressive distributed calculus, and explain a soundness proof methodology in detail.


2009 ◽  
Vol 236 ◽  
pp. 117-130 ◽  
Author(s):  
Antonio Bucchiarone ◽  
Greg Dennis ◽  
Stefania Gnesi

Sign in / Sign up

Export Citation Format

Share Document