The following pages link to Term Rewriting and Applications (Q5703858):
Displaying 18 items.
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- On parametric timed automata and one-counter machines (Q515666) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← 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)
- Easy intruder deduction problems with homomorphisms (Q1045939) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Average-energy games (Q2413482) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Shortest Paths in One-Counter Systems (Q2811358) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
- (Q4972731) (← links)
- (Q4993330) (← links)
- (Q5013874) (← links)
- The Complexity of Flat Freeze LTL (Q5111647) (← links)
- Boundedness problems for Minsky counter machines (Q5917948) (← links)
