An Efficient Canonical Narrowing Implementation for Protocol Analysis - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Raúl López-Rueda, Santiago Escobar 0001, José Meseguer. An Efficient Canonical Narrowing Implementation for Protocol Analysis. In Kyungmin Bae, editor, Rewriting Logic and Its Applications - 14th International Workshop, WRLA@ETAPS 2022, Munich, Germany, April 2-3, 2022, Revised Selected Papers. Volume 13252 of Lecture Notes in Computer Science, pages 151-170, Springer, 2022. [doi]

The following publications are possibly variants of this publication:

An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysisRaúl López-Rueda, Santiago Escobar 0001, Julia Sapiña. jlap, 135:100895, October 2023. [doi]

Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic ProtocolsJosé Meseguer, Prasanna Thati. ENTCS, 117:153-182, 2005. [doi]

Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocolsJosé Meseguer, Prasanna Thati. lisp, 20(1-2):123-160, 2007. [doi]

Canonical Narrowing with Irreducibility Constraints as a Symbolic Protocol Analysis MethodSantiago Escobar, José Meseguer. BIRTHDAY 2019: 15-38 [doi]

Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis MethodRaúl López-Rueda, Santiago Escobar 0001. WRLA 2022: 45-64 [doi]

runs on WebDSL