Local policies for resource usage analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Jalapa: Securing Java with Local Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Call-by-contract for service discovery, orchestration and recovery
Rigorous software engineering for service-oriented systems
Gate automata-driven run-time enforcement
Computers & Mathematics with Applications
| Hi-index | 0.00 |
Usage automata are an extension of finite stata automata, with some additional features (e.g. parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g. they can be model-checked against abstractions of program usages. We study here some foundational aspects of usage automata. In particular, we discuss about their expressive power, and about their effective use in run-time mechanisms for enforcing usage policies.