<body bgcolor="#FFFFFF" text="#000000" link="#9944EE" vlink= "#0000FF" alink="#00FF00"> <h1><a name="SECTION00060000000000000000" id= "SECTION00060000000000000000"></a> <a name= "PROTHEO_resultats_" id="PROTHEO_resultats_"></a><br /> Résultats nouveaux</h1><a name="PROTHEO_resultats_resultats" id="PROTHEO_resultats_resultats"></a> <p><br /></p> <hr /> <!--Table of Child-Links--> <a name="CHILD_LINKS" id= "CHILD_LINKS"><strong>Sous-sections</strong></a> <ul> <li> <a name="tex2html277" href="resul_reecr_mn.html" target= "main" id="tex2html277"><small>Réécriture et stratégies</small></a> <ul> <li><a name="tex2html278" href= "resul_reecr_mn.html#SECTION00061100000000000000" target="main" id="tex2html278"><small>Compilation de règles de réécriture et de stratégies non-déterministes</small></a></li> <li><a name="tex2html279" href= "resul_reecr_mn.html#SECTION00061200000000000000" target="main" id="tex2html279"><small>Syntaxes abstraites comme formats d'échange</small></a></li> <li><a name="tex2html280" href= "resul_reecr_mn.html#SECTION00061300000000000000" target="main" id="tex2html280"><small>Le <span class= "MATH"><img width="9" height="22" align="middle" border="0" src="img1.png" alt= "$\rho$" /></span>-calcul - calcul de réécriture</small></a></li> <li><a name="tex2html281" href= "resul_reecr_mn.html#SECTION00061400000000000000" target="main" id="tex2html281"><small>Réécriture Objets</small></a></li> <li><a name="tex2html282" href= "resul_reecr_mn.html#SECTION00061500000000000000" target="main" id="tex2html282"><small>Règles de production en <span class= "textsf">ELAN</span></small></a></li> </ul> </li> <li> <a name="tex2html283" href="resul_contr_mn.html" target= "main" id="tex2html283"><small>Contraintes</small></a> <ul> <li><a name="tex2html284" href= "resul_contr_mn.html#SECTION00062100000000000000" target="main" id="tex2html284"><small>Génération de règles pour la résolution de contraintes dans les domaines finis</small></a></li> <li><a name="tex2html285" href= "resul_contr_mn.html#SECTION00062200000000000000" target="main" id="tex2html285"><small>Théorie des plans de coupe en programmation entière</small></a></li> <li><a name="tex2html286" href= "resul_contr_mn.html#SECTION00062300000000000000" target="main" id="tex2html286"><small>Application à l'optimisation de la chaîne logistique globale</small></a></li> <li><a name="tex2html287" href= "resul_contr_mn.html#SECTION00062400000000000000" target="main" id="tex2html287"><small>Applications à la bioinformatique</small></a></li> </ul> </li> <li> <a name="tex2html288" href="resul_deduc_mn.html" target= "main" id="tex2html288"><small>Déduction automatique</small></a> <ul> <li><a name="tex2html289" href= "resul_deduc_mn.html#SECTION00063100000000000000" target="main" id="tex2html289"><small>Déduction modulo</small></a></li> <li><a name="tex2html290" href= "resul_deduc_mn.html#SECTION00063200000000000000" target="main" id="tex2html290"><small>Spécifications algébriques, types d'ordre supérieur et modèles ensemblistes</small></a></li> <li><a name="tex2html291" href= "resul_deduc_mn.html#SECTION00063300000000000000" target="main" id="tex2html291"><small>Preuve automatique par récurrence : ensemble couvrant contextuel</small></a></li> <li><a name="tex2html292" href= "resul_deduc_mn.html#SECTION00063400000000000000" target="main" id="tex2html292"><small>Intégration de procédures de décision</small></a></li> <li><a name="tex2html293" href= "resul_deduc_mn.html#SECTION00063500000000000000" target="main" id="tex2html293"><small>Preuve automatique par récurrence sur des théories contraintes</small></a></li> <li><a name="tex2html294" href= "resul_deduc_mn.html#SECTION00063600000000000000" target="main" id="tex2html294"><small>ClÔture par congruence</small></a></li> <li><a name="tex2html295" href= "resul_deduc_mn.html#SECTION00063700000000000000" target="main" id="tex2html295"><small>Contraintes d'ordre</small></a></li> <li><a name="tex2html296" href= "resul_deduc_mn.html#SECTION00063800000000000000" target="main" id="tex2html296"><small>Coopération de techniques de preuve</small></a></li> </ul> </li> <li> <a name="tex2html297" href="resul_preuve_mn.html" target= "main" id="tex2html297"><small>Preuve de propriétés de programmes</small></a> <ul> <li><a name="tex2html298" href= "resul_preuve_mn.html#SECTION00064100000000000000" target="main" id="tex2html298"><small>Preuves de terminaison par induction</small></a></li> <li><a name="tex2html299" href= "resul_preuve_mn.html#SECTION00064200000000000000" target="main" id="tex2html299"><small>Preuves de terminaison</small></a></li> <li><a name="tex2html300" href= "resul_preuve_mn.html#SECTION00064300000000000000" target="main" id="tex2html300"><small>Vérification simultanée de la complétude et de la confluence sur les termes clos</small></a></li> <li><a name="tex2html301" href= "resul_preuve_mn.html#SECTION00064400000000000000" target="main" id="tex2html301"><small>Preuves de propriétés observables</small></a></li> </ul> </li> <li> <a name="tex2html302" href="resul_verif_mn.html" target= "main" id="tex2html302"><small>Vérification</small></a> <ul> <li><a name="tex2html303" href= "resul_verif_mn.html#SECTION00065100000000000000" target="main" id="tex2html303"><small>Structures de données pour la vérification</small></a></li> <li><a name="tex2html304" href= "resul_verif_mn.html#SECTION00065200000000000000" target="main" id="tex2html304"><small>Vérification de protocoles d'authentification</small></a></li> <li><a name="tex2html305" href= "resul_verif_mn.html#SECTION00065300000000000000" target="main" id="tex2html305"><small>Vérification de protocoles ABR</small></a></li> <li><a name="tex2html306" href= "resul_verif_mn.html#SECTION00065400000000000000" target="main" id="tex2html306"><small>Automates temporisés et calcul de réécriture</small></a></li> <li><a name="tex2html307" href= "resul_verif_mn.html#SECTION00065500000000000000" target="main" id="tex2html307"><small>Preuve de systèmes réactifs</small></a></li> </ul> </li> <li> <a name="tex2html308" href="resul_compl_mn.html" target= "main" id="tex2html308"><small>Complexité</small></a> <ul> <li><a name="tex2html309" href= "resul_compl_mn.html#SECTION00066100000000000000" target="main" id="tex2html309"><small>Impossibilité d'une méthode de combinaison polynomiale pour les algorithmes d'unification</small></a></li> <li><a name="tex2html310" href= "resul_compl_mn.html#SECTION00066200000000000000" target="main" id="tex2html310"><small>Décidabilité des propriétés de stabilité des systèmes hybrides</small></a></li> <li><a name="tex2html311" href= "resul_compl_mn.html#SECTION00066300000000000000" target="main" id="tex2html311"><small>Réduction <span class="textit">substractive</span> et problèmes complets pour les classes de comptage</small></a></li> <li><a name="tex2html312" href= "resul_compl_mn.html#SECTION00066400000000000000" target="main" id="tex2html312"><small>Base de Hilbert</small></a></li> </ul> </li> </ul><!--End of Table of Child-Links--> <hr /> </body>