Lift arbitrary natural-language conversations to the formal authorization language

Establish a lifting theorem that maps arbitrary natural-language conversations to the formal authorization action language while preserving the relevant authorization semantics and future-validity distinctions.

Background

The paper develops its residual-state results for a formal action language consisting of grant, revoke, and use operations over direct delegation graphs. Its theoretical state-complexity bounds and benchmark constructions therefore apply directly only to that formalized setting.

A broader result would connect the formal authorization model to unrestricted natural-language interactions, showing that the same residual distinctions or an appropriate semantic abstraction can be preserved when authorization-relevant actions are expressed through arbitrary language conversations. The paper explicitly leaves this lifting result unproved.