Matchbox

MaRDI QIDQ22084swMATHFDO

Official website http://link.springer.com/chapter/10.1007/978-3-540-25979-4_6

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

Cited in

(41)

• Match-bounds revisited
• Increasing interpretations
• Automatic synthesis of logical models for order-sorted first-order theories
• CeTA
• Tyrolean
• AProVE
• CoLoR
• CiME
• MU-TERM
• Jambox
• TPDB
• TPA
• Tsukuba
• TORPA
• Lower bounds for runtime complexity of term rewriting
• Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
• HSL_MC64
• Certification of Termination Proofs Using CeTA
• Nagoya Termination Tool
• ConCon
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
• Weighted automata for proving termination of string rewriting
• Termination of String Rewriting with Matrix Interpretations
• Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
• Matrix Interpretations for Proving Termination of Term Rewriting
• Loops under Strategies
• term-rewriting
• Matchbox
• Transforming SAT into termination of rewriting
• Implementation and Application of Automata
• Frontiers of Combining Systems
• Term Rewriting and Applications
• NaTT
• WANDA
• Termination of string rewriting proved automatically
• Termination proofs for string rewriting systems via inverse match-bounds
• Proving termination of context-sensitive rewriting by transformation
• Tyrolean termination tool: techniques and features
• On tree automata that certify termination of left-linear term rewriting systems
• Termination of just/fair computations in term rewriting
• Loop detection in term rewriting using the eliminating unfoldings

This page was built for software: Matchbox