Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-sensitive rewriting strategies
Information and Computation
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
Complexity of Linear Standard Theories
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
On the Modularity of Deciding Call-by-Need
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Transfinite Rewriting Semantics for Term Rewriting Systems
RTA '01 Proceedings of the 12th 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
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Homomorphisms and Concurrent Term Rewriting
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Strong and NV-sequentiality of constructor systems
Information Processing Letters
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Decidable call-by-need computations in term rewriting
Information and Computation
Removing redundant arguments automatically
Theory and Practice of Logic Programming
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters
Information Processing Letters
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Closure of Tree Automata Languages under Innermost Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Decidable call-by-need computations in term rewriting
Information and Computation
Approximation-based tree regular model-checking
Nordic Journal of Computing
Tree automata for rewrite strategies
Journal of Symbolic Computation
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Levels of undecidability in rewriting
Information and Computation
Symbolic analysis of network security policies using rewrite systems
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
Reachability analysis of mobile ambients in fragments of AC term rewriting
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Reduction strategies for left-linear term rewriting systems
Processes, Terms and Cycles
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |