Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Stateful Authorization Logic Proof Theory and a Case Study
 

Summary: Stateful Authorization Logic
Proof Theory and a Case Study
Deepak Garg
CyLab
Carnegie Mellon University
dg@cs.cmu.edu
Frank Pfenning
Computer Science Department
Carnegie Mellon University
fp@cs.cmu.edu
July 15, 2011
Abstract
We present the design, proof theory and metatheory of a logic for represent-
ing 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 com-
munity. We discuss design choices in the interaction between state and other
features of BL and validate BL's proof theory by proving standard properties

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University
Pfenning, Frank - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences; Mathematics