On Asymmetric Unification and the Combination Problem in Disjoint Theories

Abstract : Asymmetric unification is a new paradigm for unification modulo theories that introduces irreducibility constraintson one side of a unification problem. It has important applications in symbolic cryptographic protocol analysis, for which itis often necessary to put irreducibility constraints on portions of a state. However many facets of asymmetricunification thatare of particular interest, includingits behavior under combinations of disjoint theories, remain poorly understood.In this paper we give a new formulation of the method for unificationin the combination of disjoint equational theories developed by Baader and Schulz that bothgives additional insights into the disjoint combination problem in general, and furthermore allowsus to extend the method to asymmetric unification, giving the first unification method for asymmetric unification in the combination of disjoint theories.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01087065
Contributor : Christophe Ringeissen <>
Submitted on : Tuesday, November 25, 2014 - 2:34:40 PM
Last modification on : Wednesday, June 26, 2019 - 3:18:22 PM

Links full text

Identifiers

Citation

Serdar Erbatur, Deepak Kapur, Andrew Marshall, Catherine Meadows, Paliath Narendran, et al.. On Asymmetric Unification and the Combination Problem in Disjoint Theories. Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS, Apr 2014, Grenoble, France. pp.15, ⟨10.1007/978-3-642-54830-7_18⟩. ⟨hal-01087065⟩

Share

Metrics

Record views

260