Matchbox

swMATH10115MaRDI QIDQ22084FDOQ22084

Author name not available (Why is that?)

Source code repository: https://github.com/jwaldmann/matchbox/

Cited In (23)

• Matrix Interpretations for Proving Termination of Term Rewriting
• Match-bounds revisited
• Title not available (Why is that?)
• Loops under Strategies
• Certification of Termination Proofs Using CeTA
• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• Automatic synthesis of logical models for order-sorted first-order theories
• Termination proofs for string rewriting systems via inverse match-bounds
• Frontiers of Combining Systems
• Proving termination of context-sensitive rewriting by transformation
• Term Rewriting and Applications
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
• Implementation and Application of Automata
• Increasing interpretations
• Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
• Tyrolean termination tool: techniques and features
• Lower bounds for runtime complexity of term rewriting
• On tree automata that certify termination of left-linear term rewriting systems
• Termination of String Rewriting with Matrix Interpretations
• Termination of just/fair computations in term rewriting
• Transforming SAT into Termination of Rewriting
• Loop detection in term rewriting using the eliminating unfoldings
• Termination of string rewriting proved automatically

This page was built for software: Matchbox