An enhanced CFA for security policies
Chiara Bodei, Pierpaolo Degano, Corrado Priami, Nicola Zannone · TU/e Research Portal · 2003
We introduce a Control Flow Analysis, improving the one in [6], that statically approximates the dynamic behaviour of mobile processes, expressed in (a variant of) the -calculus. Our analysis of a system is able to describe the behaviour of each sub-system, tracking where and between whom communications may occur. To identify each sub-system, we use a syntactic encoding of its position inside the abstract syntax tree. Furthermore, our analysis is general enough to safely approximate the behaviour of a system plugged in a larger and mainly unknown context, without explicitly analysing it. Quite a lot of possible properties fan out, among which some related to security policies.