Santiago Escobar

According to our database1, Santiago Escobar authored at least 100 papers between 1999 and 2019.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

Bibliography

2019
Symbolic Analysis of Maude Theories with Narval.
TPLP, 2019

Most General Variant Unifiers.
CoRR, 2019

Symbolic Analysis of Maude Theories with Narval.
CoRR, 2019

Strand Spaces with Choice via a Process Algebra Semantics.
CoRR, 2019

$${\textsf {ACUOS}}^\mathbf {2}$$ : A High-Performance System for Modular ACU Generalization with Subtyping and Inheritance.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Canonical Narrowing with Irreducibility Constraints as a Symbolic Protocol Analysis Method.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018
Homeomorphic Embedding modulo Combinations of Associativity and Commutativity Axioms.
CoRR, 2018

Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA.
CoRR, 2018

Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Associative Unification and Symbolic Reasoning Modulo Associativity in Maude.
Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Modular Verification of Sequential Composition for Private Channels in Maude-NPA.
Proceedings of the Security and Trust Management - 14th International Workshop, 2018

Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2018

2017
Inspecting Maude variants with GLINTS.
TPLP, 2017

Inspecting Maude Variants with GLINTS.
CoRR, 2017

2016
Rewriting logic and its applications (extended selected papers from WRLA 2014).
J. Log. Algebr. Meth. Program., 2016

Effective Sequential Protocol Composition in Maude-NPA.
CoRR, 2016

Partial Evaluation of Order-sorted Equational Programs modulo Axioms.
CoRR, 2016

Strand spaces with choice via a process algebra semantics.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

Built-in Variant Generation and Unification, and Their Applications in Maude 2.7.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015
Constrained narrowing for conditional equational theories modulo axioms.
Sci. Comput. Program., 2015

Analysis of the PKCS#11 API Using the Maude-NPA Tool.
Proceedings of the Security Standardisation Research - Second International Conference, 2015

Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories.
Proceedings of the Programming Languages with Applications to Biology and Security, 2015

Proceedings of the Logic, Rewriting, and Concurrency, 2015

2014
State space reduction in the Maude-NRL Protocol Analyzer.
Inf. Comput., 2014

Functional and (Constraint) Logic Programming.
Inf. Comput., 2014

A modular order-sorted equational generalization algorithm.
Inf. Comput., 2014

A Formal Definition of Protocol Indistinguishability and Its Verification Using Maude-NPA.
Proceedings of the Security and Trust Management - 10th International Workshop, 2014

Analysis of the IBM CCA Security API Protocols in Maude-NPA.
Proceedings of the Security Standardisation Research - First International Conference, 2014

Theories of Homomorphic Encryption, Unification, and the Finite Variant Property.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

A rewriting-based forwards semantics for Maude-NPA.
Proceedings of the 2014 Symposium and Bootcamp on the Science of Security, 2014

Functional Logic Programming in Maude.
Proceedings of the Specification, Algebra, and Software, 2014

2013
Unification and Anti-unification modulo Equational Theories.
Proceedings of the 27th International Workshop on Unification, 2013

Abstract Logical Model Checking of Infinite-State Systems Using Narrowing.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Detecting Modular ACU Structural Symmetries.
Proceedings of the 27th International Workshop on Unification, 2013

Incremental and Adaptive Software Systems Development of Natural Language Applications.
Proceedings of the Information System Development, 2013

Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
Folding variant narrowing and optimal variant termination.
J. Log. Algebr. Program., 2012

Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions.
Proceedings of the Computer Security - ESORICS 2012, 2012

The use of types in designing unification algorithms: two case studies.
Proceedings of the UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, 2012

2011
Modular termination of basic narrowing and equational unification.
Logic Journal of the IGPL, 2011

State Space Reduction in the Maude-NRL Protocol Analyzer
CoRR, 2011

Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Protocol analysis in Maude-NPA using unification modulo homomorphic encryption.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

2010
On-demand strategy annotations revisited: An improved on-demand evaluation strategy.
Theor. Comput. Sci., 2010

A compact fixpoint semantics for term rewriting systems.
Theor. Comput. Sci., 2010

Abstract Certification of Global Non-Interference in Rewriting Logic
CoRR, 2010

Folding Variant Narrowing and Optimal Variant Termination.
Proceedings of the Rewriting Logic and Its Applications - 8th International Workshop, 2010

Approximating Non-interference and Erasure in Rewriting Logic.
Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2010

Protocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA.
Proceedings of the Security and Trust Management - 6th International Workshop, 2010

Sequential Protocol Composition in Maude-NPA.
Proceedings of the Computer Security, 2010

2009
Termination of narrowing revisited.
Theor. Comput. Sci., 2009

A Graphical User Interface for Maude-NPA.
Electr. Notes Theor. Comput. Sci., 2009

Variant Narrowing and Equational Unification.
Electr. Notes Theor. Comput. Sci., 2009

Preface.
Electr. Notes Theor. Comput. Sci., 2009

Preface.
Electr. Notes Theor. Comput. Sci., 2009

Order-Sorted Generalization.
Electr. Notes Theor. Comput. Sci., 2009

A Tool for Automated Certification of Java Source Code in Maude.
Electr. Notes Theor. Comput. Sci., 2009

Unification and Narrowing in Maude 2.4.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Abstract Certification of Global Non-interference in Rewriting Logic.
Proceedings of the Formal Methods for Components and Objects - 8th International Symposium, 2009

2008
Preface.
Electr. Notes Theor. Comput. Sci., 2008

Effectively Checking the Finite Variant Property.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Modular Termination of Basic Narrowing.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Directed-Logical Testing for Functional Verification of Microprocessors.
Proceedings of the 6th ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2008), 2008

A Modular Equational Generalization Algorithm.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

Termination of Narrowing Using Dependency Pairs.
Proceedings of the Logic Programming, 24th International Conference, 2008

Automated Certification of Non-Interference in Rewriting Logic.
Proceedings of the Formal Methods for Industrial Critical Systems, 2008

State Space Reduction in the Maude-NRL Protocol Analyzer.
Proceedings of the Computer Security, 2008

2007
Removing redundant arguments automatically.
TPLP, 2007

Narrowing and Rewriting Logic: from Foundations to Applications.
Electr. Notes Theor. Comput. Sci., 2007

Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer.
Electr. Notes Theor. Comput. Sci., 2007

Symbolic Model Checking of Infinite-State Systems Using Narrowing.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties.
Proceedings of the Foundations of Security Analysis and Design V, 2007

Automatic Certification of Java Source Code in Rewriting Logic.
Proceedings of the Formal Methods for Industrial Critical Systems, 2007

2006
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties.
Theor. Comput. Sci., 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

Removing Redundant Arguments Automatically
CoRR, 2006

2005
On-demand Evaluation for Maude.
Electr. Notes Theor. Comput. Sci., 2005

New Evaluation Commands for Maude Within Full Maude.
Electr. Notes Theor. Comput. Sci., 2005

Preface.
Proceedings of the First International Workshop on Automated Specification and Verification of Web Sites (WWV 2005), 2005

Natural Narrowing for General Term Rewriting Systems.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

A rewriting-based inference system for the NRL protocol analyzer: grammar generation.
Proceedings of the 2005 ACM workshop on Formal methods in security engineering, 2005

2004
Thesis: Strategies and analysis techniques in functional program optimization.
AI Commun., 2004

Natural Rewriting for General Term Rewriting Systems.
Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Implementing Natural Rewriting and Narrowing Efficiently.
Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

2003
On-demand Evaluation by Program Transformation.
Electr. Notes Theor. Comput. Sci., 2003

OnDemandOBJ: A Laboratory for Strategy Annotations.
Electr. Notes Theor. Comput. Sci., 2003

Abstract correction of first-order functional programs.
Electr. Notes Theor. Comput. Sci., 2003

Refining weakly outermost-needed rewriting and narrowing.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

Abstract Correction of OBJ-like Programs.
Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002
Correct and Complete (Positive) Strategy Annotations for OBJ.
Electr. Notes Theor. Comput. Sci., 2002

Redundancy of Arguments Reduced to Induction.
Electr. Notes Theor. Comput. Sci., 2002

Improving On-Demand Strategy Annotations.
Proceedings of the Logic for Programming, 2002

Abstract Diagnosis of Functional Programs.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Removing Redundant Arguments of Functions.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2000
Redundancy Analyses in Term Rewriting.
Proceedings of the 9th International Workshop on Functional and Logic Programming, 2000

1999
UPV-CURRY: An Incremental CURRY Interpreter.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

An Incremental Needed Narrowing Calculus for Curry.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999