Authors: Guangye Sui; Mohamed Mejri
Addresses: Laboratory of Computer Security, Laval University, Quebec, Canada ' Laboratory of Computer Security, Laval University, Quebec, Canada
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.
Keywords: formal method; security enforcement; program rewriting; basic process algebra; security policies; information systems; linear systems.
International Journal of Grid and Utility Computing, 2013 Vol.4 No.2/3, pp.204 - 211
Received: 25 Aug 2012
Accepted: 23 Sep 2012
Published online: 18 Sep 2014 *