Publication: Research - peer-review › Article in proceedings – Annual report year: 2008
Coordination languages are often used to describe open ended systems. This makes it challenging to develop tools for guaranteeing security of the coordinated systems and 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 to combine these two approaches to obtain a static type system for describing secure access to tuple spaces and safe process migration for a dialect of the language Klaim.
|Title||Coordination Models and Languages : 10th International Conference, COORDINATION 2008|
|Conference||10th International Conference Coordination Models and Languages|
|Period||04-06-08 → 06-06-08|
|Name||Lecture Notes in Computer Science|
This work has been supported by the EU project SENSORIA, IST-2005-016004.
|Citations||Web of Science® Times Cited: No match on DOI|
Loading map data...