History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
Journal of Symbolic Computation
Equations, sets, and reduction semantics for functional and logic programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Constraints in computational logics
Completion of a set of rules modulo a set of equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Rewriting systems on FP expressions that reduce the number of sequences they yield
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Complete symbolic reachability analysis using back-and-forth narrowing
Theoretical Computer Science - Algebra and coalgebra in computer science
Higher-Order and Symbolic Computation
Narrowing and Rewriting Logic: from Foundations to Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Electronic Notes in Theoretical Computer Science (ENTCS)
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Proving safety properties of rewrite theories
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
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
Natural narrowing for general term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Complete symbolic reachability analysis using back-and-forth narrowing
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
| Hi-index | 0.00 |