Certification extends Termination Techniques

There are termination proofs that are produced by termination tools for which certifiers are not powerful enough. However, a similar situation also occurs in the other direction. We have formalized termination techniques in a more general setting as they have been introduced. Hence, we can certify p...

Full description

Bibliographic Details
Main Authors: Sternagel, Christian, Thiemann, René
Format: Text
Language:unknown
Published: 2012
Subjects:
lang
info
Arctic
Online Access:http://arxiv.org/abs/1208.1594
id fttriple:oai:gotriple.eu:10670/1.8fm9a8
record_format openpolar
spelling fttriple:oai:gotriple.eu:10670/1.8fm9a8 2023-05-15T14:57:35+02:00 Certification extends Termination Techniques Extended Certification Technical Termination Sternagel, Christian Thiemann, René 2012-08-08 http://arxiv.org/abs/1208.1594 undefined unknown 10670/1.8fm9a8 http://arxiv.org/abs/1208.1594 undefined arXiv lang info Text https://vocabularies.coar-repositories.org/resource_types/c_18cf/ 2012 fttriple 2023-01-22T17:35:23Z There are termination proofs that are produced by termination tools for which certifiers are not powerful enough. However, a similar situation also occurs in the other direction. We have formalized termination techniques in a more general setting as they have been introduced. Hence, we can certify proofs using techniques that no termination tool supports so far. In this paper we shortly present two of these formalizations: Polynomial orders with negative constants and Arctic termination. Comment: 5 pages, International Workshop on Termination 2010 Text Arctic Unknown Arctic
institution Open Polar
collection Unknown
op_collection_id fttriple
language unknown
topic lang
info
spellingShingle lang
info
Sternagel, Christian
Thiemann, René
Certification extends Termination Techniques
topic_facet lang
info
description There are termination proofs that are produced by termination tools for which certifiers are not powerful enough. However, a similar situation also occurs in the other direction. We have formalized termination techniques in a more general setting as they have been introduced. Hence, we can certify proofs using techniques that no termination tool supports so far. In this paper we shortly present two of these formalizations: Polynomial orders with negative constants and Arctic termination. Comment: 5 pages, International Workshop on Termination 2010
format Text
author Sternagel, Christian
Thiemann, René
author_facet Sternagel, Christian
Thiemann, René
author_sort Sternagel, Christian
title Certification extends Termination Techniques
title_short Certification extends Termination Techniques
title_full Certification extends Termination Techniques
title_fullStr Certification extends Termination Techniques
title_full_unstemmed Certification extends Termination Techniques
title_sort certification extends termination techniques
publishDate 2012
url http://arxiv.org/abs/1208.1594
geographic Arctic
geographic_facet Arctic
genre Arctic
genre_facet Arctic
op_source arXiv
op_relation 10670/1.8fm9a8
http://arxiv.org/abs/1208.1594
op_rights undefined
_version_ 1766329684398702592

Similar Items