activity
20162023
most citedAn Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.SCShow all

1 paper · 1 filter

cs.SC2023★ 2 cited

An Efficient Canonical Narrowing Implementation with Irreducibility and SMT Constraints for Generic Symbolic Protocol Analysis

Raúl López-Rueda, Santiago Escobar, Julia Sapiña

Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their a…