Algebra and Coalgebra in Computer Science

DOI10.1007/11548133zbMATH Open1151.68452OpenAlexW249899439MaRDI QIDQ5492833FDOQ5492833

Authors: Prasannaa Thati, José Meseguer 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11548133

Recommendations

• Complete symbolic reachability analysis using back-and-forth narrowing
• 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
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Termination of narrowing revisited

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (6)

• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Complete symbolic reachability analysis using back-and-forth narrowing
• 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
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Algebra and Coalgebra in Computer Science

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