The following pages link to Yannick Chevalier (Q437029):
Displaying 20 items.
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← 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)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Compiling and securing cryptographic protocols (Q990127) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- (Q2848035) (← links)
- Verifying Cryptographic Protocols with Subterms Constraints (Q3498465) (← links)
- Towards an Automatic Analysis of Web Service Security (Q3525006) (← links)
- Hierarchical Combination of Intruder Theories (Q3527287) (← links)
- A Logical Approach to Dynamic Role-Based Access Control (Q3534661) (← links)
- (Q4804905) (← links)
- (Q4804908) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191511) (← links)
- Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption (Q5277813) (← links)
- Computer Science Logic (Q5292632) (← links)
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols (Q5458828) (← links)
- Automata, Languages and Programming (Q5716815) (← links)
