Matching, unification and complexity
ACM SIGSAM Bulletin
Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Semantic unification for convergent systems
Semantic unification for convergent systems
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Decidable Matching for Convergent Systems (Preliminary Version)
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
Higher-Order and Symbolic Computation
Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic model checking of infinite-state systems using narrowing
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Lazy narrowing with simplification
Computer Languages
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Combining theorem proving and narrowing for rewriting-logic specifications
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Protocol analysis modulo combination of theories: a case study in Maude-NPA
STM'10 Proceedings of the 6th international conference on Security and trust management
Learning-based testing for reactive systems using term rewriting technology
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Hi-index | 0.00 |
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E=@D@?B with B a set of axioms for which a finitary unification algorithm exists, and @D a set of confluent, terminating, and B-coherent rewrite rules. However, when B@A, effective narrowing strategies such as basic narrowing easily fail to be complete and cannot be used. This poses two challenges to narrowing-based equational unification: (i) finding effective narrowing strategies that are complete modulo B under mild assumptions on B, and (ii) finding sufficient conditions under which such narrowing strategies yield finitary E-unification algorithms. Inspired by Comon and Delaune's notion of E-variant for a term, we propose a new narrowing strategy called variant narrowing that has a search space potentially much smaller than full narrowing, is complete, and yields a finitary E-unification algorithm when E has the finite variant property. We also discuss applications to symbolic reachability analysis of concurrent systems specified as rewrite theories, and in particular to the formal analysis of cryptographic protocols modulo the algebraic properties of the underlying cryptographic functions.