Secure information flow in a multi-threaded imperative language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Complexity of Nesting Analysis in Mobile Ambients
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
On abstract interpretation of mobile ambients
Information and Computation
Behind BANANA: Design and Implementation of a Tool for Nesting Analysis of Mobile Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
A proof system for information flow security
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
BANANA: a tool for boundary ambients nesting analysis
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A parametric model for the analysis of mobile ambients
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Security boundaries in mobile ambients
Computer Languages, Systems and Structures
Nesting analysis of mobile ambients
Computer Languages, Systems and Structures
Hi-index | 0.00 |
A multilevel security policy is considered in the scenario of mobile systems, and modeled within "pure" Mobile Ambients calculus, in which no communication channels are present and the only possible actions are represented by the moves performed by mobile processes. The information flow property of interest is defined in terms of the possibility for a confidential ambient/data to move outside a security boundary. In a previous paper, we gave a very simple syntactic property that is sufficient to imply the absence of unwanted information flows. In this paper, a control flow analysis is defined, as a refinement of the Hansen-Jensen-Nielsons's CFA, that allows to capture boundary crossings with better accuracy.