Termination by Completion
Identifieur interne : 003C08 ( Crin/Checkpoint ); précédent : 003C07; suivant : 003C09Termination by Completion
Auteurs : F. Bellegarde ; Pierre Lescanne [France]Source :
- Applicable Algebra in Engineering, Communication and Computer Science ; 1990.
Abstract
This paper presents a completion procedure for proving termination of term rewrite systems. It works as follows. Given a term rewrite system R supposed to terminate and a term rewrite system T used to transform R, the completion builds an auxiliary term rewrite system S, the system transformed of R by T. The termination of S and T associated with a property called local cooperation implies the termination of R. If the process terminates this provides a mechanical proof of the termination of R.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:bellegarde90aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="298">Termination by Completion</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:bellegarde90a</idno>
<date when="1990" year="1990">1990</date>
<idno type="wicri:Area/Crin/Corpus">000871</idno>
<idno type="wicri:Area/Crin/Curation">000871</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000871</idno>
<idno type="wicri:Area/Crin/Checkpoint">003C08</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003C08</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Termination by Completion</title>
<author><name sortKey="Bellegarde, F" sort="Bellegarde, F" uniqKey="Bellegarde F" first="F." last="Bellegarde">F. Bellegarde</name>
</author>
<author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name>
<affiliation><country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName>
<orgName type="university">Université de Lorraine</orgName>
<orgName type="institution">Centre national de la recherche scientifique</orgName>
<orgName type="institution">Institut national de recherche en informatique et en automatique</orgName>
</affiliation>
</author>
</analytic>
<series><title level="j">Applicable Algebra in Engineering, Communication and Computer Science</title>
<imprint><date when="1990" type="published">1990</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1157">This paper presents a completion procedure for proving termination of term rewrite systems. It works as follows. Given a term rewrite system R supposed to terminate and a term rewrite system T used to transform R, the completion builds an auxiliary term rewrite system S, the system transformed of R by T. The termination of S and T associated with a property called local cooperation implies the termination of R. If the process terminates this provides a mechanical proof of the termination of R.</div>
</front>
</TEI>
<BibTex type="article"><ref>bellegarde90a</ref>
<crinnumber>90-R-028</crinnumber>
<category>1</category>
<equipe>EURECA</equipe>
<author><e>Bellegarde, F.</e>
<e>Lescanne, P.</e>
</author>
<title>Termination by Completion</title>
<journal>Applicable Algebra in Engineering, Communication and Computer Science</journal>
<year>1990</year>
<volume>1</volume>
<number>2</number>
<pages>79-96</pages>
<month>Dec</month>
<abstract>This paper presents a completion procedure for proving termination of term rewrite systems. It works as follows. Given a term rewrite system R supposed to terminate and a term rewrite system T used to transform R, the completion builds an auxiliary term rewrite system S, the system transformed of R by T. The termination of S and T associated with a property called local cooperation implies the termination of R. If the process terminates this provides a mechanical proof of the termination of R.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003C08 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 003C08 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Checkpoint |type= RBID |clé= CRIN:bellegarde90a |texte= Termination by Completion }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |