Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Recognizability Problem for Tree Automata with Comparisons between Brothers
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Regular Sets of Descendants by Some Rewrite Strategies
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Homomorphisms and Concurrent Term Rewriting
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Abstracting cryptographic protocols with tree automata
Science of Computer Programming - Special issue on static analysis (SAS'99)
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Deriving the type flaw attacks in the Otway-Rees protocol by rewriting
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Alternating two-way AC-tree automata
Information and Computation
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Towards an Efficient Implementation of Tree Automata Completion
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Information and Computation
Formalizing and Analyzing the Needham-Schroeder Symmetric-Key Protocol by Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Tree automata for rewrite strategies
Journal of Symbolic Computation
Equational approximations for tree automata completion
Journal of Symbolic Computation
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Proving termination of rewrite systems using bounds
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
On tree automata that certify termination of left-linear term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Equational abstraction refinement for certified tree regular model checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Hi-index | 0.00 |