activity
20062023
most citedEffective Sequential Protocol Composition in Maude-NPA

7 citations · 25 across the 16 of their papers we have counts for

collaborators

17 papers

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…

cs.LO2021

Symbolic Specialization of Rewriting Logic Theories with Presto

María Alpuente, Demis Ballis, Santiago Escobar +1

This paper introduces Presto, a symbolic partial evaluator for Maude's rewriting logic theories that can improve system analysis and verification. In Presto, the automated optimiza…

cs.CR2020

Protocol Analysis with Time

Damián Aparicio-Sánchez, Santiago Escobar, Catherine Meadows +2

We present a framework suited to the analysis of cryptographic protocols that make use of time in their execution. We provide a process algebra syntax that makes time information a…

cs.LO2020★ 2 cited

Variant-based Equational Unification under Constructor Symbols

Damián Aparicio-Sánchez, Santiago Escobar, Julia Sapiña

Equational unification of two terms consists of finding a substitution that, when applied to both terms, makes them equal modulo some equational properties. A narrowing-based equat…

cs.LO2019★ 2 cited

Most General Variant Unifiers

Santiago Escobar, Julia Sapiña

Equational unification of two terms consists of finding a substitution that, when applied to both terms, makes them equal modulo some equational properties. Equational unification…

cs.LO2019

Symbolic Analysis of Maude Theories with Narval

María Alpuente, Demis Ballis, Santiago Escobar +1

Concurrent functional languages that are endowed with symbolic reasoning capabilities such as Maude offer a high-level, elegant, and efficient approach to programming and analyzing…