Effectively Checking the Finite Variant Property
From MaRDI portal
Publication:3522010
DOI10.1007/978-3-540-70590-1_6zbMATH Open1145.68444OpenAlexW2120977678MaRDI QIDQ3522010FDOQ3522010
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
Cites Work
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Conditional rewriting logic as a unified model of concurrency
- Equational rules for rewriting logic
- Title not available (Why is that?)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Effectively Checking the Finite Variant Property
- Variant Narrowing and Equational Unification
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Term Rewriting and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Twenty years of rewriting logic
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Effectively Checking the Finite Variant Property
- Variant Narrowing and Equational Unification
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- An integrated framework for the diagnosis and correction of rule-based programs
- State space reduction in the Maude-NRL protocol analyzer
- Termination Modulo Combinations of Equational Theories
Recommendations
This page was built for publication: Effectively Checking the Finite Variant Property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522010)
