Complexity of nilpotent unification and matching problems

Authors:
Qing Guo;Paliath Narendran;D. A. Wolfram
Affiliations:
SUNY, Albany, New York;SUNY, Albany, New York;The Australian National Univ., Canberra, Australia
Venue:
Information and Computation
Year:
2000

Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures

Theoretical Computer Science
Symbolic protocol analysis in presence of a homomorphism operator and exclusive or

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Unification modulo chaining

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Hi-index	0.00