Toward a complete transformational toolkit for compilers
ACM Transactions on Programming Languages and Systems (TOPLAS)
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
On finite alphabets and infinite bases
Information and Computation
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
RAPT: a program transformation system based on term rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
On finite alphabets and infinite bases III: simulation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.01 |