Complete symbolic reachability analysis using back-and-forth narrowing
type: Item
instance of: scholarly article
title: Complete symbolic reachability analysis using back-and-forth narrowing
zbMATH Open document ID: 1110.68058
author: Prasannaa Thati
author: José Meseguer
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5083524
zbMATH Keywords: narrowing
zbMATH Keywords: soundness
zbMATH Keywords: completeness
zbMATH Keywords: rewrite systems
zbMATH Keywords: reachability
describes a project that uses: NRL
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.008
OpenAlex ID: W4249555655
cites work: A needed narrowing strategy
cites work: Conditional narrowing modulo a set of equations
cites work: Q4804924
cites work: Verification on infinite structures.
cites work: On the security of public key protocols
cites work: Functional and Logic Programming
cites work: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
cites work: Term Rewriting and Applications
cites work: Well-structured transition systems everywhere!
cites work: Q2723425
cites work: Q3883561
cites work: Q3664457
cites work: The NRL Protocol Analyzer: An Overview
cites work: Q3046721
cites work: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
cites work: Completeness results for basic narrowing
cites work: Lazy narrowing: strong completeness and eager variable elimination
cites work: Linear unification
cites work: Programming in equational logic: Beyond strong sequentiality
cites work: Algebra and Coalgebra in Computer Science
cites work: Rewriting Techniques and Applications
cites work: Q2723905
DOI: 10.1016/J.TCS.2006.07.008
description: scientific article; zbMATH DE number 5083524