Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Prasanna Thati, José Meseguer. Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing. In José Luiz Fiadeiro, Neil Harman, Markus Roggenbach, Jan J. M. M. Rutten, editors, Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings. Volume 3629 of Lecture Notes in Computer Science, pages 379-394, Springer, 2005. [doi]

The following publications are possibly variants of this publication:

Complete symbolic reachability analysis using back-and-forth narrowingPrasanna Thati, José Meseguer. TCS, 366(1-2):163-179, 2006. [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]

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

runs on WebDSL