Foundations of deductive databases and logic programming
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
On the Exponent of Periodicity of Minimal Solutions of Context Equation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A uniform approach to underspecification and parallelism
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Efficient memory representation of XML document trees
Information Systems
Computing procedure summaries for interprocedural analysis
ESOP'07 Proceedings of the 16th European conference on Programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Checking herbrand equalities and beyond
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Invariant Checking for Programs with Procedure Calls
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
The context unification problem is a generalization of standard term unification. It consists of finding a unifier for a set of term equations containing first-order variables and context variables. In this paper we analyze the special case of context unification where the use of at most one context variable is allowed and show that it is in NP. The motivation for investigating this subcase of context unification is interprocedural program analysis for programs described using arbitrary terms, generalizing the case where terms were restricted to using unary function symbols. Our results imply that the redundancy problem is in coNP, and that the finite redundancy property holds in this case. We also exhibit particular cases where one context unification is polynomial.