scientific article
From MaRDI portal
Publication:2723425
zbMath0963.94016MaRDI QIDQ2723425
Publication date: 5 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Alternating two-way AC-tree automata ⋮ Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy ⋮ Descendants of a recognizable tree language for sets of linear monadic term rewrite rules ⋮ The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols ⋮ Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols ⋮ Complete symbolic reachability analysis using back-and-forth narrowing ⋮ Injective synchronisation: An extension of the authentication hierarchy ⋮ A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties ⋮ Tree pattern matching from regular tree expressions ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ Towards more precise rewriting approximations ⋮ Tree automata with equality constraints modulo equational theories ⋮ On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings ⋮ Tree automata for rewrite strategies ⋮ Symbol different term rewrite systems ⋮ Transducer-based analysis of cryptographic protocols ⋮ Reachability in Conditional Term Rewriting Systems ⋮ A theoretical limit for safety verification techniques with regular fix-point computations ⋮ On the relationships between models in protocol verification ⋮ Match-bounded string rewriting systems ⋮ Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically ⋮ Equational approximations for tree automata completion ⋮ Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives ⋮ Rigid tree automata and applications ⋮ Reachability analysis over term rewriting systems ⋮ Rigid Tree Automata ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems ⋮ Handling Left-Quadratic Rules When Completing Tree Automata ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Information based reasoning about security protocols ⋮ Closure properties and decision problems of dag automata ⋮ Towards an Efficient Implementation of Tree Automata Completion
Uses Software
This page was built for publication:
