There are Two Sides to Every Question

DOI10.1007/978-3-319-25527-9_20zbMath1434.68332OpenAlexW2330918191MaRDI QIDQ3460874

Francesco Santini, Ilaria Matteucci, Fabio Martinelli

Publication date: 8 January 2016

Published in: Programming Languages with Applications to Biology and Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25527-9_20

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Which security policies are enforceable by runtime monitors? A survey
• Analysis of security protocols as open systems
• Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
• Enforceable Security Policies Revisited
• Compositionality Through an Operational Semantics of Contexts
• Semiring-based constraint satisfaction and optimization
• Model checking usage policies

This page was built for publication: There are Two Sides to Every Question