Conceptio › Archive › HAL (France)
HAL (France)open access

Automated Termination Proving : contributions to Graph Rewriting via Extended Weighted Type Graphs and Morphism Counting

Qi Qiu
HAL (France) · Papers · License: Open Access
Open Source ↗
termination
Terminaison, 0, Méthodes formelles, Graph rewriting system, Formal methods, Système de réécriture de graphes, Termination
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 370840
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.