Seminar: Nominal Automata for Resource Usage Control

Abstract. Two classes of nominal automata, namely Usage Automata (UAs) and Variable Finite Automata (VFAs) are considered to express resource control policies
over program execution traces expressed by a nominal calculus (Usages).

We first discuss some closure properties of UAs, and then show UAs less expressive than VFAs.

We finally carry over to VFAs the symbolic technique for model checking Usages against UAs, so making it possible to verify the compliance of a program with a larger class of security properties.