Safe Equivalences for Security Properties

DOI10.1007/978-3-642-15240-5_5zbMath1202.68217DBLPconf/ifipTCS/AlvimAPR10OpenAlexW2133712643WikidataQ62043012 ScholiaQ62043012MaRDI QIDQ3163873

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

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)

Related Items (3)

Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Information hiding in probabilistic concurrent systems

This page was built for publication: Safe Equivalences for Security Properties