Results 1 
6 of
6
Proof search in an authorization logic
, 2009
"... We consider the problem of proof search in an expressive authorization logic that contains a “says ” modality and an ordering on principals. After a description of the proof system for the logic, we identify two fragments that admit complete goaldirected and saturating proof search strategies. A sm ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
(Show Context)
We consider the problem of proof search in an expressive authorization logic that contains a “says ” modality and an ordering on principals. After a description of the proof system for the logic, we identify two fragments that admit complete goaldirected and saturating proof search strategies. A smaller fragment is then presented, which supports both goaldirected and saturating search, and has a sound and complete translation to firstorder logic. We conclude with a brief description of our implementation of goaldirected search. This work was supported partially by the iCAST project sponsored by the National Science Council,
PCAL: Language support for proofcarrying authorization systems
 In European Symposium on Research in Computer Security
"... Abstract. By shifting the burden of proofs to the user, a proofcarrying authorization (PCA) system can automatically enforce complex access control policies. Unfortunately, managing those proofs can be a daunting task for the user. In this paper we develop a Bashlike language, PCAL, that can autom ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract. By shifting the burden of proofs to the user, a proofcarrying authorization (PCA) system can automatically enforce complex access control policies. Unfortunately, managing those proofs can be a daunting task for the user. In this paper we develop a Bashlike language, PCAL, that can automate correct and efficient use of a PCA interface. Given a PCAL script, the PCAL compiler tries to statically construct the proofs required for executing the commands in the script, while reusing proofs to the extent possible and rewriting the script to construct the remaining proofs dynamically. We obtain a formal guarantee that if the policy does not change between compile time and run time, then the compiled script cannot fail due to access checks at run time.
Progress in the Development of Automated Theorem Proving for Higherorder Logic
"... The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of firstorder Automated Theorem Proving (ATP) systems. Recently, the TPTP has been extended to include problems in higherorder log ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of firstorder Automated Theorem Proving (ATP) systems. Recently, the TPTP has been extended to include problems in higherorder logic, with corresponding infrastructure and resources. This paper describes the practical progress that has been made towards the goal of TPTP support for higherorder ATP systems.
Logic in Access Control (Tutorial Notes)
"... Abstract. Access control is central to security in computer systems. Over the years, there have been many efforts to explain and to improve access control, sometimes with logical ideas and tools. This paper is a partial survey and discussion of the role of logic in access control. It considers logic ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Access control is central to security in computer systems. Over the years, there have been many efforts to explain and to improve access control, sometimes with logical ideas and tools. This paper is a partial survey and discussion of the role of logic in access control. It considers logical foundations for access control and their applications, in particular in languages for security policies. It focuses on some specific logics and their properties. It is intended as a written counterpart to a tutorial given at the 2009 International School on Foundations of Security Analysis and Design. 1
The THFTPTP Project – An Infrastructure for Typed Higherorder Form Automated Theorem Proving
"... ..."
(Show Context)