FASER (Formal and Automatic Security Enforcement by Rewriting) by BPA algebra with test
by Guangye Sui; Mohamed Mejri
International Journal of Grid and Utility Computing (IJGUC), Vol. 4, No. 2/3, 2013

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.

Online publication date: Thu, 18-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com