Confined Mobile Functions

Kirli, Zeliha Dilsun

doi:10.1007/978-1-4615-1007-9_4

Cited by 8 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This enables us to check confidentiality properties, e.g., that critical data such as credit card information are shared only with authorized partners. The type system has been obtained by tailoring to COWS the type-based approach for protecting data in distributed systems put forward in [12], in the context of a higher-order functional programming language, and drawn on in [6], in that of languages for global computing.…”

Section: A Type System For Checking Confidentiality Propertiesmentioning

confidence: 99%

Specifying and Analysing SOC Applications with COWS

Lapadula

Pugliese

Tiezzi

2008

Concurrency, Graphs and Models

View full text Add to dashboard Cite

Abstract. COWS is a recently defined process calculus for specifying and combining service-oriented applications, while modelling their dynamic behaviour. Since its introduction, a number of methods and tools have been devised to analyse COWS specifications, like e.g. a type system to check confidentiality properties, a logic and a model checker to express and check functional properties of services. In this paper, by means of a case study in the area of automotive systems, we demonstrate that COWS, with some mild linguistic additions, can model all the phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, orchestration, deployment, reconfiguration and execution. We also provide a flavour of the properties that can be analysed by using the tools mentioned above.

show abstract

Section: A Type System For Checking Confidentiality Propertiesmentioning

confidence: 99%

Specifying and Analysing SOC Applications with COWS

Lapadula

Pugliese

Tiezzi

2008

Concurrency, Graphs and Models

View full text Add to dashboard Cite

show abstract

“…We deeply drew inspiration from Confined-λ [13], a higher-order functional language that supports distributed computing by allowing expressions at different localities to communicate via channels. Authors of code can assign regions (i.e.…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, our annotations are only associated to the relevant data. In [13], a programmer must declare a type (i.e. a region) for any constant, function and channel; this is clearly heavier.…”

Section: Related Workmentioning

confidence: 99%

“…Finally, when compiling a net, we do not rely on any form of global knowledge of the system; only the annotations in the process are considered. On the contrary, the type system in [13] assumes a global typing environment for handling shared channels; this somehow contrasts with the features a global computing scenario.…”

Section: Related Workmentioning

confidence: 99%

“…The approach we propose, that is inspired by Confined-λ [13], exploits program annotations with regions, i.e. sets of node addresses, as follows.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Controlling data movement in global computing applications

Gorla

Pugliese

2004

Proceedings of the 2004 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

We present a programming notation aiming at protecting the secrecy of both host and agent data in global computing applications. The approach exploits annotations with sets of node addresses, called regions. A datum can be annotated with a region that specifies the network nodes that are allowed to interact with it. Network nodes come equipped with two region annotations specifying the nodes that can send data and spawn processes over them. The language semantics guarantees that computation proceeds according to these region constraints. To minimize the overhead of runtime checks, a static compilation phase is exploited. The proposed approach is largely independent of a specific programming language; however, to put it in concrete form, here we focus on its integration within the process language µKLAIM. We prove that in compiled µKLAIM nets, data can be manipulated only by authorized users. We also give a more local formulation of this property, where only a subnet is compiled. Finally, we use our theory to model the secure behaviour of a UNIX-like multiuser system.

show abstract

Mobile Computation with Functions

Kirli¹

2002

Advances in Information Security

Self Cite

View full text Add to dashboard Cite

Confined Mobile Functions

Cited by 8 publications

References 27 publications

Specifying and Analysing SOC Applications with COWS

Specifying and Analysing SOC Applications with COWS

Controlling data movement in global computing applications

Mobile Computation with Functions

Contact Info

Product

Resources

About