Term Rewriting and Applications

DOI10.1007/B135673zbMath1078.68034OpenAlexW2504734884MaRDI QIDQ5703858

Pascal Lafourcade, Denis Lugiez, Ralf Treinen

Publication date: 11 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b135673

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (18)

Reachability in Succinct and Parametric One-Counter Automata ⋮ Deciding knowledge in security protocols under equational theories ⋮ Unnamed Item ⋮ Intruder deduction for the equational theory of abelian groups with distributive encryption ⋮ Average-energy games ⋮ Deciding Knowledge in Security Protocols for Monoidal Equational Theories ⋮ Unnamed Item ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Decidability and combination results for two notions of knowledge in security protocols ⋮ Unnamed Item ⋮ On parametric timed automata and one-counter machines ⋮ Intruder deduction problem for locally stable theories with normal forms and inverses ⋮ Boundedness problems for Minsky counter machines ⋮ Hierarchical combination of intruder theories ⋮ Shortest Paths in One-Counter Systems ⋮ Deciding knowledge in security protocols under some e-voting theories ⋮ The Complexity of Flat Freeze LTL ⋮ Easy intruder deduction problems with homomorphisms

This page was built for publication: Term Rewriting and Applications