The following pages link to STACS 2004 (Q5309716):
Displaying 14 items.
- Compositions of extended top-down tree transducers (Q948090) (← links)
- Cryptanalysis on a finite automaton public key cryptosystem (Q1354575) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← links)
- Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol (Q3540086) (← links)
- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning (Q3602809) (← links)
- (Q4011769) (← links)
- (Q4900205) (← links)
- Deciding Security for Protocols with Recursive Tests (Q5200014) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711531) (← links)
