Termination by Completion
Identifieur interne : 00DC63 ( Main/Exploration ); précédent : 00DC62; suivant : 00DC64Termination 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.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 000871
- to stream Crin, to step Curation: 000871
- to stream Crin, to step Checkpoint: 003C08
- to stream Main, to step Merge: 00E543
- to stream Main, to step Curation: 00DC63
Le 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>
<idno type="wicri:Area/Main/Merge">00E543</idno>
<idno type="wicri:Area/Main/Curation">00DC63</idno>
<idno type="wicri:Area/Main/Exploration">00DC63</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>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
</settlement>
<orgName><li>Centre national de la recherche scientifique</li>
<li>Institut national de recherche en informatique et en automatique</li>
<li>Laboratoire lorrain de recherche en informatique et ses applications</li>
<li>Université de Lorraine</li>
</orgName>
</list>
<tree><noCountry><name sortKey="Bellegarde, F" sort="Bellegarde, F" uniqKey="Bellegarde F" first="F." last="Bellegarde">F. Bellegarde</name>
</noCountry>
<country name="France"><region name="Grand Est"><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00DC63 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00DC63 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= CRIN:bellegarde90a |texte= Termination by Completion }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |