2012
DOI: 10.1007/978-3-642-27660-6_47
|View full text |Cite
|
Sign up to set email alerts
|

Securing the Future — An Information Flow Analysis of a Distributed OO Language

Abstract: Abstract. We present an information-flow type system for a distributed object-oriented language with active objects, asynchronous method calls and futures. The variables of the program are classified as high and low. We allow while cycles with high guards to be used but only if they are not followed (directly or through synchronization) by an assignment to a low variable. To ensure the security of synchronization, we use a high and a low lock for each concurrent object group (cog). In some cases, we must allow… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…The typing rule for getting a future, checks that if a future variable is high, then the class is classified as unsafe. Alternatively, we could have used another sound static analysis, for instance (the relevant parts of) the static analysis defined for ABS in [64], and adapt it to our setting. We categorize safe and unsafe classes for the example in Fig.…”
Section: Iii41 Static Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The typing rule for getting a future, checks that if a future variable is high, then the class is classified as unsafe. Alternatively, we could have used another sound static analysis, for instance (the relevant parts of) the static analysis defined for ABS in [64], and adapt it to our setting. We categorize safe and unsafe classes for the example in Fig.…”
Section: Iii41 Static Analysismentioning
confidence: 99%
“…Our approach is a dynamic technique, which is more permissive and precise and supports futures confidentiality. In [64], Pettai and Laud present a type system for ABS to ensure non-interference by means of over-approximation. E.g., a future's security level is the upper bound of the tasks' levels that the future refers to, while our run-time system does not use over-approximation (assuming the labels are exact).…”
Section: Ia Appendixmentioning
confidence: 99%