Termination by Completion
Identifieur interne : 000871 ( Crin/Corpus ); précédent : 000870; suivant : 000872Termination by Completion
Auteurs : F. Bellegarde ; P. LescanneSource :
- 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 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></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">P. Lescanne</name></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/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000871 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 000871 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:bellegarde90a
|texte= Termination by Completion
}}
| This area was generated with Dilib version V0.6.33. |  |