From Flow Logic to static type systems for coordination languages

Publication: Research - peer-reviewConference article – Annual report year: 2010

View graph of relations

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. (C) 2009 Elsevier B.V. All rights reserved.
Original languageEnglish
JournalScience of Computer Programming
Publication date2010
Volume75
Issue6
Pages376-397
ISSN0167-6423
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
CitationsWeb of Science® Times Cited: 0
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: 5162351