Pages that link to "Item:Q1770429"
From MaRDI portal
The following pages link to Tree automata with one memory set constraints and cryptographic protocols (Q1770429):
Displaying 14 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Bounding messages for free in security protocols -- extension to various security properties (Q476179) (← links)
- Rigid tree automata and applications (Q553317) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
- An undecidability result for AGh (Q859845) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405) (← links)
- Rigid Tree Automata (Q3618602) (← links)
- Nested Sibling Tree Automata (Q3625699) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- Bounding Messages for Free in Security Protocols (Q5458850) (← links)