Pages that link to "Item:Q1283776"

The following pages link to A calculus for cryptographic protocols: The spi calculus (Q1283776):

Displaying 50 items.

• The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
• Compositional reasoning for shared-variable concurrent programs (Q2024370) (← links)
• A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
• A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
• Processes against tests: on defining contextual equivalences (Q2079681) (← links)
• A constraint-based language for multiparty interactions (Q2229145) (← links)
• Static analysis of topology-dependent broadcast networks (Q2266988) (← links)
• Invariant-based reasoning about parameterized security protocols (Q2268473) (← links)
• Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
• Update semantics of security protocols (Q2386105) (← links)
• Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
• Universally composable symbolic security analysis (Q2429708) (← links)
• A formal semantics for protocol narrations (Q2463562) (← 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)
• Open bisimulation, revisited (Q2465030) (← links)
• Automated verification of selected equivalences for security protocols (Q2474047) (← links)
• Behavioural equivalences for dynamic web data (Q2474049) (← links)
• A game semantics of names and pointers (Q2474444) (← links)
• Cryptographic logical relations (Q2481976) (← links)
• A framework for compositional verification of security protocols (Q2482454) (← links)
• Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
• Contract signing, optimism, and advantage (Q2484408) (← links)
• A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
• Logics for reasoning about cryptographic constructions (Q2490263) (← links)
• Pattern-matching spi-calculus (Q2500522) (← links)
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus (Q2566037) (← links)
• Type-based information flow analysis for the \(\pi\)-calculus (Q2581011) (← links)
• Simulation and analysis of cryptographic protocols (Q2765456) (← links)
• Abstract interpretation for proving secrecy properties in security protocols (Q2841216) (← links)
• Information based reasoning about security protocols (Q2841219) (← links)
• Cryptographic analysis in cubic time (Q2841271) (← links)
• Techniques for security checking: non-interference vs control flow analysis (Q2841279) (← links)
• On the expressive power of polyadic synchronisation in \(\pi \)-calculus (Q2842599) (← links)
• Modal logics for cryptographic processes (Q2842609) (← links)
• Deciding framed bisimilarity (Q2842870) (← links)
• A denotational approach to the static analysis of cryptographic processes (Q2849549) (← links)
• Protocol composition logic (PCL) (Q2864155) (← links)
• A process algebra for reasoning about quantum security (Q2864166) (← links)
• A uniform framework for security and trust modeling and analysis with crypto-CCS (Q2866730) (← links)
• Applying spi-calculus for PayWord (Q2909014) (← links)
• A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
• Cryptographic Verification by Typing for a Sample Protocol Implementation (Q3092172) (← links)
• The λ-calculus in the π-calculus (Q3094164) (← links)
• SPEC: An Equivalence Checker for Security Protocols (Q3179281) (← links)
• Formalising Observer Theory for Environment-Sensitive Bisimulation (Q3183528) (← links)
• Employing Costs in Multiagent Systems with Timed Migration and Timed Communication (Q3297779) (← links)
• On Communication Models When Verifying Equivalence Properties (Q3304813) (← links)
• (Q3384076) (← links)