eprintid: 273
rev_number: 8
eprint_status: archive
userid: 32
dir: disk0/00/00/02/73
datestamp: 2011-05-24 08:47:29
lastmod: 2011-07-11 14:36:24
status_changed: 2011-05-24 08:47:29
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Gorla, Daniele
creators_name: Hansen, Rene Rydhof
creators_name: Nielson, Flemming
creators_name: Nielson, Hanne Riis
creators_name: Probst, Christian W.
creators_name: Pugliese, Rosario
creators_id: r.denicola@imtlucca.it
creators_id: 
creators_id: 
creators_id: 
creators_id: 
creators_id: 
creators_id: 
title: From Flow Logic to static type systems for coordination languages
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Global computing; Coordination languages; Formal methods; Flow Logic; Type systems
note: This work is partially based on two preliminary papers, [R. De Nicola, D. Gorla, R.R. Hansen, F. Nielson, H.R. Nielson, C.W.Probst, R. Pugliese, From flow logic to static type systems for coordination languages, in: D. Lea, G. Zavattaro (Eds.), Coordination Models and Languages, 10th International Conference, COORDINATION 2008, in: Lecture Notes in Computer Science, vol. 5052, Springer, 2008, pp. 100–116] and [R.R. Hansen, C.W. Probst, F. Nielson, Sandboxing in myKlaim, in: Proceedings of the First International Conference on Availability, Reliability and Security, ARES 2006, The International Dependability Conference — Bridging Theory and Practice, IEEE Computer Society, 2006, pp. 174–181].
abstract: Coordination languages are often used to describe open-ended systems. This makes it challenging to develop tools for guaranteeing the security of the coordinated systems and the correctness of their interaction. Successful approaches to this problem have been based on type systems with dynamic checks; therefore, the correctness properties cannot be statically enforced. By contrast, static analysis approaches based on Flow Logic usually guarantee properties statically. In this paper, we show how the insights from the Flow Logic approach can be used to construct a type system for statically ensuring secure access to tuple spaces and safe process migration for an extension of the language Klaim.
date: 2010
date_type: published
publication: Science of Computer Programming
volume: 75
number: 6
publisher: Elsevier
pagerange: 376-397
id_number: 10.1016/j.scico.2009.07.009
refereed: TRUE
issn: 0167-6423
official_url: http://www.sciencedirect.com/science/article/pii/S0167642309001130
funders: The work has been partially supported by the EU project SENSORIA, IST-2005-016004.
citation:   De Nicola, Rocco and Gorla, Daniele and Hansen, Rene Rydhof and Nielson, Flemming and Nielson, Hanne Riis and Probst, Christian W. and Pugliese, Rosario  From Flow Logic to static type systems for coordination languages.  Science of Computer Programming, 75 (6).  pp. 376-397.  ISSN 0167-6423      (2010)