Skip to Main content Skip to Navigation
Conference papers

Certifying a Termination Criterion Based on Graphs, without Graphs

Pierre Courtieu 1 Julien Forest 1 Xavier Urbain 1 
1 CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : This paper presents a extention of the matrix interpretation ordering for term rewriting system termination.
Document type :
Conference papers
Complete list of metadata
https://hal.archives-ouvertes.fr/hal-01125530
Contributor : Laboratoire CEDRIC Connect in order to contact the contributor
Submitted on : Friday, March 6, 2015 - 11:12:38 AM
Last modification on : Friday, August 5, 2022 - 2:54:00 PM

Identifiers

  • HAL Id : hal-01125530, version 1

Collections

CNAM | CEDRIC-CNAM

Citation

Pierre Courtieu, Julien Forest, Xavier Urbain. Certifying a Termination Criterion Based on Graphs, without Graphs. TPHOLs'08 Theorem Proving in Higher Order Logics, Montr?al, Canada, Jan 2008, Montreal, Canada. pp.183-198. ⟨hal-01125530⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

19