Model checking usage policies

DOI10.1017/S096012951200093XzbMath1361.68133MaRDI QIDQ5740636

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

Publication date: 27 July 2016

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

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)

Related Items (3)

There are Two Sides to Every Question ⋮ Regular and context-free nominal traces ⋮ Pierpaolo Degano

Uses Software

• PRISM
• SAFKASI

Cites Work

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

This page was built for publication: Model checking usage policies