Safe equivalences for security properties

DOI10.1007/978-3-642-15240-5_5MaRDI QIDQ3163873zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi, Peter van Rossum

Publication date 27 October 2010

Published in IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15240-5_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Bisimulation for Demonic Schedulers
• Deciding equivalence-based properties using constraint solving
• Making random choices invisible to the scheduler
• Making Random Choices Invisible to the Scheduler
• Context-sensitive equivalences for non-interference based protocol analysis.

Cited in

(9)

• Safety property-driven stubborn sets
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Robust and secure implementation: equivalence theorems
• Making Random Choices Invisible to the Scheduler
• Bisimulation for Demonic Schedulers
• scientific article; zbMATH DE number 1487487 (Why is no real title available?)
• scientific article; zbMATH DE number 7361813 (Why is no real title available?)
• Trace equivalence and epistemic logic to express security properties
• Information hiding in probabilistic concurrent systems

This page was built for publication: Safe equivalences for security properties

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