The following pages link to Santiago Escobar (Q462490):
Displaying 50 items.
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- (Q987979) (redirect page) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Folding variant narrowing and optimal variant termination (Q1931909) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Order-sorted equational generalization algorithm revisited (Q2134938) (← links)
- Protocol analysis with time (Q2152027) (← links)
- Protocol analysis with time and space (Q2154006) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- \({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance (Q2296704) (← links)
- Canonical narrowing with irreducibility constraints as a symbolic protocol analysis method (Q2303359) (← links)
- Partial evaluation of order-sorted equational programs modulo axioms (Q2409722) (← links)
- A modular order-sorted equational generalization algorithm (Q2437800) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- Safety enforcement via programmable strategies in Maude (Q2693298) (← links)
- Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 (Q2817918) (← links)
- Abstract correction of first-order functional programs (Q2844059) (← links)
- Correct and complete (positive) strategy annotations for \textsf{OBJ} (Q2851049) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- Modular termination of basic narrowing and equational unification (Q2889572) (← links)
- ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance (Q2938523) (← links)
- Two Decades of Maude (Q2945709) (← links)
- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing (Q2958376) (← links)
- Removing Redundant Arguments of Functions* (Q2996146) (← links)
- Abstract Certification of Global Non-interference in Rewriting Logic (Q3066121) (← links)
- Abstract Diagnosis of Functional Programs (Q3079916) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- Removing redundant arguments automatically (Q3430663) (← links)
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories (Q3460872) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- A Modular Equational Generalization Algorithm (Q3617428) (← links)
- (Q4428288) (← links)
- (Q4832299) (← links)
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (Q4928441) (← links)
- Folding Variant Narrowing and Optimal Variant Termination (Q4933278) (← links)
- Order-Sorted Generalization (Q4982625) (← links)
- Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* (Q4988927) (← links)
- (Q5020553) (← links)
- (Q5020960) (← links)
- Symbolic Analysis of Maude Theories with Narval (Q5108507) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Functional and Logic Programming (Q5308019) (← links)
- Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6 (Q5389069) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- Symbolic Model Checking of Infinite-State Systems Using Narrowing (Q5432339) (← links)
