scientific article; zbMATH DE number 7440203

zbMath1482.68121arXiv1609.03642MaRDI QIDQ5015375

Maria A. Schett, Georg Moser

Publication date: 7 December 2021

Full work available at URL: https://arxiv.org/abs/1609.03642

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Partial orders, general (06A06) Planar graphs; geometric and topological aspects of graph theory (05C10) Grammars and rewriting systems (68Q42)

Uses Software

• AProVE
• TcT
• Grez

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combination framework for complexity
• Orderings for term-rewriting systems
• Simple termination of rewrite systems
• Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
• Analysing the complexity of functional programs: higher-order meets first-order
• Termination Analysis for Graph Transformation Systems
• Proving Termination of Programs Automatically with AProVE
• Proving Termination and Memory Safety for Programs with Pointer Arithmetic
• Complexity of Acyclic Term Graph Rewriting.
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: