Abstract
A correct and a cheap enforcement of security policies on information systems is a major problem for most of our institutions. In previous works, we introduced a program rewriting approach that can automatically and formally enforce security policies on untrusted programs. The program and the security policy are specified as processes in an extended version of BPA Basic Process Algebra. After that, the enforcement problem is turned to the resolution of a linear system. In this paper, we extend the expressiveness of the algebra by adding tests which is an important step towards enforcing security policies on more real interesting systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Grid and Utility Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
