38 search results - page 1 / 8 » Probabilistic Noninterference in a Concurrent Language |
CSFW
1998
IEEE
13 years 8 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
JCS
2006
13 years 4 months ago
2006
IFIP
2009
Springer
13 years 11 months ago
2009
Springer
CSFW
2003
IEEE
13 years 10 months ago
2003
IEEE
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
CCS
2004
ACM
13 years 10 months ago
2004
ACM
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...