Effectively Checking the Finite Variant Property

DOI10.1007/978-3-540-70590-1_6zbMath1145.68444OpenAlexW2120977678MaRDI QIDQ3522010

Santiago Escobar, Ralf Sasse, José Meseguer

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties, An integrated framework for the diagnosis and correction of rule-based programs, Twenty years of rewriting logic, Effectively Checking the Finite Variant Property, State space reduction in the Maude-NRL protocol analyzer, Variant Narrowing and Equational Unification, Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions, Termination Modulo Combinations of Equational Theories

Cites Work

• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Conditional rewriting logic as a unified model of concurrency
• Equational rules for rewriting logic
• Termination of term rewriting using dependency pairs
• Effectively Checking the Finite Variant Property
• Variant Narrowing and Equational Unification
• Term Rewriting and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item