Pages that link to "Item:Q5716815"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716815):
Displaying 15 items.
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- Intruder deducibility constraints with negation. Decidability and application to secured service compositions (Q507348) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Compiling and securing cryptographic protocols (Q990127) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Being careful about theory combination (Q2441773) (← links)
- Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
- (Q4808733) (← links)
- Foundations of Software Science and Computation Structures (Q5308437) (← links)
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols (Q5458828) (← links)