S-narrowing for constructor systems

DOI10.1007/978-3-642-32943-2_10MaRDI QIDQ2915104zbMATH OpenOpenAlexFDO

Authors Adrián Riesco, Juan Rodríguez-Hortalá

Publication date 21 September 2012

Published in Theoretical Aspects of Computing – ICTAC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32943-2_10

zbMATH Keywords

unificationMaudenarrowingconstructor systems

Mathematics Subject Classification ID

Cryptography (94A60) Grammars and rewriting systems (68Q42)

Recommendations

• Variant narrowing and equational unification
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Narrowing and rewriting logic: from foundations to applications
• Termination of Narrowing in Left-Linear Constructor Systems

Cited in

(9)

• Termination of Narrowing in Left-Linear Constructor Systems
• Enumerating outer narrowing derivations for constructor-based term rewriting systems
• Termination of narrowing via termination of rewriting
• Narrowing and rewriting logic: from foundations to applications
• Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method
• Variant narrowing and equational unification
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• scientific article; zbMATH DE number 4060700 (Why is no real title available?)
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

This page was built for publication: S-narrowing for constructor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915104)