Pages that link to "Item:Q5716777"

The following pages link to Automata, Languages and Programming (Q5716777):

Displaying 19 items.

• A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
• Compositional analysis of contract-signing protocols (Q860896) (← links)
• An anytime deduction algorithm for the probabilistic logic and entailment problems (Q962834) (← links)
• Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange (Q2463563) (← links)
• The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
• Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
• Protocol composition logic (PCL) (Q2864155) (← links)
• Exogenous probabilistic computation tree logic (Q2870286) (← links)
• Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol (Q3178248) (← links)
• (Q3384076) (← links)
• Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols (Q3631369) (← links)
• (Q4493893) (← links)
• A logical approach to multilevel security of probabilistic systems (Q5137350) (← links)
• Foundations of Software Science and Computation Structures (Q5308469) (← links)
• Unwinding Possibilistic Security Properties (Q5862302) (← links)
• Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos (Q5862527) (← links)
• Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes (Q5862528) (← links)
• Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)