Automated analysis of rule-based access control policies

  • Authors:
  • Clara Bertolissi;Worachet Uttha

  • Affiliations:
  • LIF, CNRS UMR 7279 & AMU, Marseille, France;LIF, CNRS UMR 7279 & AMU, Marseille, France

  • Venue:
  • PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we show how access control policies can be specified using a general metamodel whose operational semantics is based on term rewriting systems. The choice of the specification language aims at easing the verification task, since essential properties of access control (e.g. every request by an individual of accessing a resource always receives an answer, and this answer is unique) can be formalized and proved using rewriting techniques. We show that automated analysis of rewrite-based security policies can be done using the CiME rewriting tool which is able to produce mechanically checkable traces of security policy properties, for instance through the Coq proof assistant.