From Flow Logic to Static Type Systems in Coordination Languages

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2008

View graph of relations

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.
Original languageEnglish
Title of host publicationCoordination Models and Languages : 10th International Conference, COORDINATION 2008
Volume5052
PublisherSpringer
Publication date2008
Pages100-116
ISBN (print)978-3-540-68264-6
DOIs
StatePublished

Conference

Conference10th International Conference Coordination Models and Languages
Number10
CountryNorway
CityOslo
Period04/06/0806/06/08
Internet addresshttp://www.informatik.uni-trier.de/~ley/db/conf/coordination/coordination2008.html
NameLecture Notes in Computer Science

Bibliographical note

This work has been supported by the EU project SENSORIA, IST-2005-016004.

CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5477939