Model checking usage policies

DOI10.1017/S096012951200093XMaRDI QIDQ5740636zbMATH OpenFDO

Authors Massimo Bartoletti, Roberto Zunino, Pierpaolo Degano, Gian Luigi Ferrari

Publication date 27 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096012951200093X

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Usage Automata
• Nominal automata for resource usage control
• Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
• Resource usage verification.
• Information Security

Cites work

• A calculus of mobile processes. I
• Algebra of communicating processes with abstraction
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Finite-memory automata
• Finite-state unification automata and relational languages
• Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
• Recognizing safety and liveness
• Usage Automata
• Variable automata over infinite alphabets

Cited in

(9)

• Matching Trace Patterns with Regular Policies
• Regular and context-free nominal traces
• Pierpaolo Degano
• Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
• Resource usage verification.
• Usage Automata
• There are two sides to every question. Controller versus attacker
• Policy monitor model based on Mealy automata
• Nominal automata for resource usage control

Describes a project that uses

Uses Software

• SAFKASI
• PRISM

This page was built for publication: Model checking usage policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740636)