DeepAI AI Chat
Log In Sign Up

First-Order Logic for Flow-Limited Authorization

by   Andrew K. Hirsch, et al.

We present the Flow-Limited Authorization First-Order Logic (FLAFOL), a logic for reasoning about authorization decisions in the presence of information-flow policies. We formalize the FLAFOL proof system, characterize its proof-theoretic properties, and develop its security guarantees. In particular, FLAFOL is the first logic to provide a non-interference guarantee while supporting all connectives of first-order logic. Furthermore, this guarantee is the first to combine the notions of non-interference from both authorization logic and information-flow systems. All theorems in this paper are proven in Coq.


page 1

page 2

page 3

page 4


A classical-logic view of a paraconsistent logic

This paper is concerned with the first-order paraconsistent logic LPQ^⊃,...

Complexity of correctness for pomset logic proof nets

We show that it is coNP-complete to decide whether a given proof structu...

Flavours of Sequential Information Flow

Information-flow policies prescribe which information is available to a ...

VST-Flow: Fine-grained low-level reasoning about real-world C code

We show how support for information-flow security proofs could be added ...

Mechanizing Matching Logic in Coq

Matching logic is a formalism for specifying and reasoning about structu...

Consistent ultrafinitist logic

Ultrafinitism postulates that we can only compute on relatively short ob...

Schematic Polymorphism in the Abella Proof Assistant

The Abella interactive theorem prover has proven to be an effective vehi...