A theory of runtime enforcement, with results

  • Authors:
  • Jay Ligatti;Srikar Reddy

  • Affiliations:
  • University of South Florida, Department of Computer Science and Engineering;University of South Florida, Department of Computer Science and Engineering

  • Venue:
  • ESORICS'10 Proceedings of the 15th European conference on Research in computer security
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a theory of runtime enforcement based on mechanism models called MRAs (Mandatory Results Automata). MRAs can monitor and transform security-relevant actions and their results. Because previous work could not model monitors transforming results, MRAs capture realistic behaviors outside the scope of previous models. MRAs also have a simple but realistic operational semantics that makes it straightforward to define concrete MRAs. Moreover, the definitions of policies and enforcement with MRAs are significantly simpler and more expressive than those of previous models. Putting all these features together, we argue that MRAs make good general models of runtime mechanisms, upon which a theory of runtime enforcement can be based. We develop some enforceability theory by characterizing the policies MRAs can and cannot enforce.