Date of Original Version

7-15-2011

Type

Conference Proceeding

Rights Management

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-22444-7_14

Abstract or Description

We present the design, proof theory and metatheory of a logic for representing and reasoning about authorization policies. A salient feature of the logic, BL, is its support for system state in the form of interpreted predicates, upon which authorization policies often rely. In addition, BL includes Abadi et al.’s “says” connective and explicit time. BL is illustrated through a case study of policies for sharing sensitive information created in the U.S. intelligence community. We discuss design choices in the interaction between state and other features of BL and validate BL’s proof theory by proving standard metatheoretic properties like admissibility of cut.

DOI

10.1007/978-3-642-22444-7_14

Share

COinS
 

Published In

Lecture Notes in Computer Science, 6710, 210-225.