Effectively Checking the Finite Variant Property
From MaRDI portal
Publication:3522010
Recommendations
Cites work
- scientific article; zbMATH DE number 1722701 (Why is no real title available?)
- scientific article; zbMATH DE number 3817070 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Conditional rewriting logic as a unified model of concurrency
- Effectively Checking the Finite Variant Property
- Equational rules for rewriting logic
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Term Rewriting and Applications
- Termination of term rewriting using dependency pairs
- Variant narrowing and equational unification
Cited in
(8)- Variant narrowing and equational unification
- State space reduction in the Maude-NRL protocol analyzer
- Effectively Checking the Finite Variant Property
- 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
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Twenty years of rewriting logic
- Termination Modulo Combinations of Equational Theories
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)