Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325725 | Journal of Symbolic Computation | 2011 | 20 Pages |
Abstract
This paper introduces a formal and modular technique allowing to automatically enforce a security policy on a given concurrent system. Given a concurrent program P and a security policy Ï, we automatically generate another program Pâ² that satisfies Ï and behaves like P, except that it stops when P tries to violate the security policy Ï. We use extended version of process algebra ACP (Algebra of Communicating Process) and BPA (Basic Process Algebra) as formal languages to specify both concurrent system and security policy.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Mahjoub Langar, Mohamed Mejri, Kamel Adi,