Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
New completeness results for lazy conditional narrowing
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Decidable call-by-need computations in term rewriting
Information and Computation
On modularity in infinitary term rewriting
Information and Computation
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
Transformation for Refining Unraveled Conditional Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Improving the Context-sensitive Dependency Graph
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of just/fair computations in term rewriting
Information and Computation
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Usable Rules for Context-Sensitive Rewrite Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Confluence by Decreasing Diagrams
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Completion after Program Inversion of Injective Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Electronic Notes in Theoretical Computer Science (ENTCS)
An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
VMTL---A Modular Termination Laboratory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
From Outermost to Context-Sensitive Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A Fully Abstract Semantics for Constructor Systems
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Termination of narrowing revisited
Theoretical Computer Science
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable call-by-need computations in term rewriting
Information and Computation
On modularity in infinitary term rewriting
Information and Computation
Operational termination of conditional term rewriting systems
Information Processing Letters
On equality predicates in algebraic specification languages
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Termination modulo combinations of equational theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Context-sensitive dependency pairs
Information and Computation
Proving termination in the context-sensitive dependency pair framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
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
Confluent Term Rewriting for Only-knowing Logics
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
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
Decreasing Diagrams and Relative Termination
Journal of Automated Reasoning
Context-sensitive dependency pairs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Goal-directed and relative dependency pairs for proving the termination of narrowing
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
From conditional to unconditional rewriting
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Computationally equivalent elimination of conditions
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
Proving injectivity of functions via program inversion in term rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Modularity in term rewriting revisited
Theoretical Computer Science
Determinization of conditional term rewriting systems
Theoretical Computer Science
| Hi-index | 0.00 |
This unique book offers a comprehensive and unified view of the subject that is suitable for all computer scientists, program designers, and software engineers who study and use term rewriting techniques. Practitioners, researchers and professionals will find the book an essential and authoritative resource and guide for the latest developments and results in the field.