Matchbox
From MaRDI portal
Software:22084
No author found.
Source code repository: https://github.com/jwaldmann/matchbox/
Related Items (23)
Termination of string rewriting proved automatically ⋮ Certification of Termination Proofs Using CeTA ⋮ Termination proofs for string rewriting systems via inverse match-bounds ⋮ On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems ⋮ Tyrolean termination tool: techniques and features ⋮ 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 ⋮ Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems ⋮ Implementation and Application of Automata ⋮ Term Rewriting and Applications ⋮ Loop detection in term rewriting using the eliminating unfoldings ⋮ Frontiers of Combining Systems ⋮ Matrix Interpretations for Proving Termination of Term Rewriting ⋮ Loops under Strategies ⋮ Transforming SAT into Termination of Rewriting ⋮ Match-bounds revisited ⋮ Increasing interpretations ⋮ Unnamed Item
This page was built for software: Matchbox
