statically assuring secrecy for dynamic concurrent processes
We propose a new algorithm of secrecy analysis in a framework integrating declarative programming and concurrency. The analysis of a program ensures that information can only flow from less sensitive levels toward more sensitive ones. Our algorithm uses a terminating abstract operational semantics which reduces the problem of secrecy to constraint solving within finite lattices. It departs in that from the previous works essentially based on type systems. Furthermore, our proposal is general and tackles a very large class of programs, featuring dynamic process creation, general sequential composition, recursive process calls and high level synchronization.
dynamic concurrency process algorithm analysis declarative programming program informal flow sensitive abstraction operational semantics constraint solving lattice type system general class compositing recursion synchronization abstract interpretation  framework  noninterference safety