@inproceedings{e7477063685b4847b85888e802d21f7f,
title = "Canonical Narrowing with Irreducibility Constraints as a Symbolic Protocol Analysis Method",
abstract = "This work proposes canonical constrained narrowing, a new symbolic reachability analysis technique applicable to topmost rewrite theories where the equational theory has the finite variant property. Our experiments suggest that canonical constrained narrowing is more efficient than both standard narrowing and the previously studied contextual narrowing. These results are relevant not only for Maude-NPA, but also for symbolically analyzing many other concurrent systems specified by means of rewrite theories.",
author = "Santiago Escobar and Jos{\'e} Meseguer",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; Catherine Meadows Festschrift Symposium, 2019 ; Conference date: 22-05-2019 Through 23-05-2019",
year = "2019",
doi = "10.1007/978-3-030-19052-1_4",
language = "English (US)",
isbn = "9783030190514",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "15--38",
editor = "Guttman, {Joshua D.} and Landwehr, {Carl E.} and Jos{\'e} Meseguer and Dusko Pavlovic",
booktitle = "Foundations of Security, Protocols, and Equational Reasoning - Essays Dedicated to Catherine A. Meadows",
address = "Germany",
}