TY  - JOUR
EP  - 397
N2  - 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.
TI  - From Flow Logic to static type systems for coordination languages
SN  - 0167-6423
VL  - 75
PB  - Elsevier
A1  - De Nicola, Rocco
A1  - Gorla, Daniele
A1  - Hansen, Rene Rydhof
A1  - Nielson, Flemming
A1  - Nielson, Hanne Riis
A1  - Probst, Christian W.
A1  - Pugliese, Rosario
N1  - 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].
UR  - http://www.sciencedirect.com/science/article/pii/S0167642309001130
IS  - 6
JF  - Science of Computer Programming
Y1  - 2010///
AV  - none
KW  - Global computing; Coordination languages; Formal methods; Flow Logic; Type systems
SP  - 376
ID  - eprints273
ER  -