Pages that link to "Item:Q2849863"

The following pages link to Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q2849863):

Displaying 9 items.

• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
• Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
• A simple framework for real-time cryptographic protocol analysis with compositional proof rules (Q1887729) (← links)
• Twenty years of rewriting logic (Q1931904) (← links)
• Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
• Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption (Q5418723) (← links)
• Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
• Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method (Q6487294) (← links)