Projet : PROTHEO - protheo

<body bgcolor="#FFFFFF" text="#000000" link="#9944EE" vlink= "#0000FF" alink="#00FF00"> <h1 align="center">Contraintes, Déduction automatique et Preuves de Propriétés de Logiciels</h1> <p align="center"><strong>PROTHEO<br /> <br /> <br /> Rapport d'activité de l'année 2000<br /> <br /> <br /> <i><a name="tex2html1" href= "http://www.inria.fr/inria/organigramme/fiche_ur-lor.fr.html" target="_top" id="tex2html1">Nancy</a></i><br /> <br /> <br /> Thème : <a name="tex2html2" href= "http://www.inria.fr/recherche/equipes/projets_theme2.fr.html" target="_top" id="tex2html2">2a</a><br /> <br /> <br /> <a name="tex2html3" href= "http://www.inria.fr/recherche/equipes/protheo.fr.html" target="_top" id="tex2html3">Page de présentation du projet</a> - Rapport d'activité au format <a name="tex2html4" href= "http://www.inria.fr/rapportsactivite/RA2000/protheo/protheo.ps.gz" target="_top" id="tex2html4">PostScript</a> ou <a name= "tex2html5" href= "http://www.inria.fr/rapportsactivite/RA2000/protheo/protheo.pdf" target="_top" id="tex2html5">PDF</a></strong></p> <blockquote> PROTHEO est un projet du LORIA (UMR 7503) commun au CNRS, à l'INRIA, à l'Université Henri P<small>OINCARÉ</small> - Nancy I, à l'Université Nancy 2 et à l'Institut National Polytechnique de Lorraine. </blockquote><br /> <hr />  <a name="CHILD_LINKS" id="CHILD_LINKS"></a> <ul> <li> <a name="tex2html22" href="compo_mn.html" target="main" id="tex2html22"><small>Composition de l'équipe</small></a> <ul> <li><a name="tex2html23" href= "compo_mn.html#SECTION00010100000000000000" target= "main" id="tex2html23"><small>Responsable scientifique</small></a></li> <li><a name="tex2html24" href= "compo_mn.html#SECTION00010200000000000000" target= "main" id="tex2html24"><small>Responsable permanent</small></a></li> <li><a name="tex2html25" href= "compo_mn.html#SECTION00010300000000000000" target= "main" id="tex2html25"><small>Assistante de projet</small></a></li> <li><a name="tex2html26" href= "compo_mn.html#SECTION00010400000000000000" target= "main" id="tex2html26"><small>Personnel INRIA</small></a></li> <li><a name="tex2html27" href= "compo_mn.html#SECTION00010500000000000000" target= "main" id="tex2html27"><small>Personnel CNRS</small></a></li> <li><a name="tex2html28" href= "compo_mn.html#SECTION00010600000000000000" target= "main" id="tex2html28"><small>Personnel Université</small></a></li> <li><a name="tex2html29" href= "compo_mn.html#SECTION00010700000000000000" target= "main" id="tex2html29"><small>Acceuil Jeune</small></a></li> <li><a name="tex2html30" href= "compo_mn.html#SECTION00010800000000000000" target= "main" id="tex2html30"><small>Chercheurs doctorants</small></a></li> <li><a name="tex2html31" href= "compo_mn.html#SECTION00010900000000000000" target= "main" id="tex2html31"><small>Chercheurs post-doctorants</small></a></li> <li><a name="tex2html32" href= "compo_mn.html#SECTION000101000000000000000" target= "main" id="tex2html32"><small>Conseillers extérieurs</small></a></li> <li><a name="tex2html33" href= "compo_mn.html#SECTION000101100000000000000" target= "main" id="tex2html33"><small>Collaborateur extérieur</small></a></li> <li><a name="tex2html34" href= "compo_mn.html#SECTION000101200000000000000" target= "main" id="tex2html34"><small>Chercheurs invités</small></a></li> <li><a name="tex2html35" href= "compo_mn.html#SECTION000101300000000000000" target= "main" id= "tex2html35"><small>Contractuels</small></a></li> <li><a name="tex2html36" href= "compo_mn.html#SECTION000101400000000000000" target= "main" id= "tex2html36"><small>Stagiaires</small></a></li> </ul> </li> <li><a name="tex2html37" href="prese_mn.html" target="main" id="tex2html37"><small>Présentation et objectifs généraux</small></a></li> <li> <a name="tex2html38" href="fonde_mn.html" target="main" id="tex2html38"><small>Fondements scientifiques</small></a> <ul> <li><a name="tex2html39" href= "fonde_contraintes_mn.html" target="main" id= "tex2html39"><small>Contraintes</small></a></li> <li><a name="tex2html40" href= "fonde_reecriture-str_mn.html" target="main" id= "tex2html40"><small>Réécriture et stratégies</small></a></li> <li><a name="tex2html41" href= "fonde_deduction-auto_mn.html" target="main" id= "tex2html41"><small>Démonstration automatique</small></a></li> </ul> </li> <li><a name="tex2html42" href="domai_mn.html" target="main" id="tex2html42"><small>Domaines d'applications</small></a></li> <li> <a name="tex2html43" href="logic_mn.html" target="main" id="tex2html43"><small>Logiciels</small></a> <ul> <li><a name="tex2html44" href="logic_casrul_mn.html" target="main" id="tex2html44"><small><span class= "textsf">CASRUL</span></small></a></li> <li><a name="tex2html45" href="logic_datac_mn.html" target="main" id="tex2html45"><small><span class= "textsf">daTac</span></small></a></li> <li><a name="tex2html46" href="logic_elan_mn.html" target="main" id="tex2html46"><small><span class= "textsf">ELAN</span></small></a></li> <li><a name="tex2html47" href="logic_spike_mn.html" target="main" id="tex2html47"><small><span class= "textsf">SPIKE</span></small></a></li> </ul> </li> <li> <a name="tex2html48" href="resul_mn.html" target="main" id="tex2html48"><small>Résultats nouveaux</small></a> <ul> <li> <a name="tex2html49" href="resul_reecr_mn.html" target="main" id="tex2html49"><small>Réécriture et stratégies</small></a> <ul> <li><a name="tex2html50" href= "resul_reecr_mn.html#SECTION00061100000000000000" target="main" id="tex2html50"><small>Compilation de règles de réécriture et de stratégies non-déterministes</small></a></li> <li><a name="tex2html51" href= "resul_reecr_mn.html#SECTION00061200000000000000" target="main" id="tex2html51"><small>Syntaxes abstraites comme formats d'échange</small></a></li> <li><a name="tex2html52" href= "resul_reecr_mn.html#SECTION00061300000000000000" target="main" id="tex2html52"><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="tex2html53" href= "resul_reecr_mn.html#SECTION00061400000000000000" target="main" id="tex2html53"><small>Réécriture Objets</small></a></li> <li><a name="tex2html54" href= "resul_reecr_mn.html#SECTION00061500000000000000" target="main" id="tex2html54"><small>Règles de production en <span class= "textsf">ELAN</span></small></a></li> </ul> </li> <li> <a name="tex2html55" href="resul_contr_mn.html" target="main" id= "tex2html55"><small>Contraintes</small></a> <ul> <li><a name="tex2html56" href= "resul_contr_mn.html#SECTION00062100000000000000" target="main" id="tex2html56"><small>Génération de règles pour la résolution de contraintes dans les domaines finis</small></a></li> <li><a name="tex2html57" href= "resul_contr_mn.html#SECTION00062200000000000000" target="main" id="tex2html57"><small>Théorie des plans de coupe en programmation entière</small></a></li> <li><a name="tex2html58" href= "resul_contr_mn.html#SECTION00062300000000000000" target="main" id="tex2html58"><small>Application à l'optimisation de la chaîne logistique globale</small></a></li> <li><a name="tex2html59" href= "resul_contr_mn.html#SECTION00062400000000000000" target="main" id="tex2html59"><small>Applications à la bioinformatique</small></a></li> </ul> </li> <li> <a name="tex2html60" href="resul_deduc_mn.html" target="main" id="tex2html60"><small>Déduction automatique</small></a> <ul> <li><a name="tex2html61" href= "resul_deduc_mn.html#SECTION00063100000000000000" target="main" id="tex2html61"><small>Déduction modulo</small></a></li> <li><a name="tex2html62" href= "resul_deduc_mn.html#SECTION00063200000000000000" target="main" id="tex2html62"><small>Spécifications algébriques, types d'ordre supérieur et modèles ensemblistes</small></a></li> <li><a name="tex2html63" href= "resul_deduc_mn.html#SECTION00063300000000000000" target="main" id="tex2html63"><small>Preuve automatique par récurrence : ensemble couvrant contextuel</small></a></li> <li><a name="tex2html64" href= "resul_deduc_mn.html#SECTION00063400000000000000" target="main" id="tex2html64"><small>Intégration de procédures de décision</small></a></li> <li><a name="tex2html65" href= "resul_deduc_mn.html#SECTION00063500000000000000" target="main" id="tex2html65"><small>Preuve automatique par récurrence sur des théories contraintes</small></a></li> <li><a name="tex2html66" href= "resul_deduc_mn.html#SECTION00063600000000000000" target="main" id="tex2html66"><small>ClÔture par congruence</small></a></li> <li><a name="tex2html67" href= "resul_deduc_mn.html#SECTION00063700000000000000" target="main" id="tex2html67"><small>Contraintes d'ordre</small></a></li> <li><a name="tex2html68" href= "resul_deduc_mn.html#SECTION00063800000000000000" target="main" id="tex2html68"><small>Coopération de techniques de preuve</small></a></li> </ul> </li> <li> <a name="tex2html69" href="resul_preuve_mn.html" target="main" id="tex2html69"><small>Preuve de propriétés de programmes</small></a> <ul> <li><a name="tex2html70" href= "resul_preuve_mn.html#SECTION00064100000000000000" target="main" id="tex2html70"><small>Preuves de terminaison par induction</small></a></li> <li><a name="tex2html71" href= "resul_preuve_mn.html#SECTION00064200000000000000" target="main" id="tex2html71"><small>Preuves de terminaison</small></a></li> <li><a name="tex2html72" href= "resul_preuve_mn.html#SECTION00064300000000000000" target="main" id="tex2html72"><small>Vérification simultanée de la complétude et de la confluence sur les termes clos</small></a></li> <li><a name="tex2html73" href= "resul_preuve_mn.html#SECTION00064400000000000000" target="main" id="tex2html73"><small>Preuves de propriétés observables</small></a></li> </ul> </li> <li> <a name="tex2html74" href="resul_verif_mn.html" target="main" id= "tex2html74"><small>Vérification</small></a> <ul> <li><a name="tex2html75" href= "resul_verif_mn.html#SECTION00065100000000000000" target="main" id="tex2html75"><small>Structures de données pour la vérification</small></a></li> <li><a name="tex2html76" href= "resul_verif_mn.html#SECTION00065200000000000000" target="main" id="tex2html76"><small>Vérification de protocoles d'authentification</small></a></li> <li><a name="tex2html77" href= "resul_verif_mn.html#SECTION00065300000000000000" target="main" id="tex2html77"><small>Vérification de protocoles ABR</small></a></li> <li><a name="tex2html78" href= "resul_verif_mn.html#SECTION00065400000000000000" target="main" id="tex2html78"><small>Automates temporisés et calcul de réécriture</small></a></li> <li><a name="tex2html79" href= "resul_verif_mn.html#SECTION00065500000000000000" target="main" id="tex2html79"><small>Preuve de systèmes réactifs</small></a></li> </ul> </li> <li> <a name="tex2html80" href="resul_compl_mn.html" target="main" id= "tex2html80"><small>Complexité</small></a> <ul> <li><a name="tex2html81" href= "resul_compl_mn.html#SECTION00066100000000000000" target="main" id="tex2html81"><small>Impossibilité d'une méthode de combinaison polynomiale pour les algorithmes d'unification</small></a></li> <li><a name="tex2html82" href= "resul_compl_mn.html#SECTION00066200000000000000" target="main" id="tex2html82"><small>Décidabilité des propriétés de stabilité des systèmes hybrides</small></a></li> <li><a name="tex2html83" href= "resul_compl_mn.html#SECTION00066300000000000000" target="main" id="tex2html83"><small>Réduction <span class="textit">substractive</span> et problèmes complets pour les classes de comptage</small></a></li> <li><a name="tex2html84" href= "resul_compl_mn.html#SECTION00066400000000000000" target="main" id="tex2html84"><small>Base de Hilbert</small></a></li> </ul> </li> </ul> </li> <li> <a name="tex2html85" href="contr_mn.html" target="main" id="tex2html85"><small>Contrats industriels (nationaux, européens et internationaux)</small></a> <ul> <li><a name="tex2html86" href="contr_gihp_mn.html" target="main" id="tex2html86"><small>Planification de transport porte-à-porte à la demande pour le GIHP</small></a></li> <li><a name="tex2html87" href= "contr_planification_mn.html" target="main" id= "tex2html87"><small>Application à un problème de transport</small></a></li> <li><a name="tex2html88" href="contr_calife_mn.html" target="main" id= "tex2html88"><small>CALIFE</small></a></li> </ul> </li> <li> <a name="tex2html89" href="inter_mn.html" target="main" id="tex2html89"><small>Actions régionales, nationales et internationales</small></a> <ul> <li><a name="tex2html90" href="inter_regional_mn.html" target="main" id="tex2html90"><small>Actions régionales</small></a></li> <li><a name="tex2html91" href="inter_national_mn.html" target="main" id="tex2html91"><small>Actions nationales</small></a></li> <li><a name="tex2html92" href="inter_europe_mn.html" target="main" id="tex2html92"><small>Actions européennes</small></a></li> <li><a name="tex2html93" href= "inter_international_mn.html" target="main" id= "tex2html93"><small>Réseaux et groupes de travail internationaux</small></a></li> <li><a name="tex2html94" href="inter_bilateral_mn.html" target="main" id="tex2html94"><small>Relations bilatérales internationales</small></a></li> <li><a name="tex2html95" href="inter_visites_mn.html" target="main" id="tex2html95"><small>Accueils de chercheurs étrangers</small></a></li> </ul> </li> <li> <a name="tex2html96" href="diffu_mn.html" target="main" id="tex2html96"><small>Diffusion de résultats</small></a> <ul> <li><a name="tex2html97" href="diffu_animation_mn.html" target="main" id="tex2html97"><small>Animation de la Communauté scientifique</small></a></li> <li><a name="tex2html98" href= "diffu_enseignementun_mn.html" target="main" id= "tex2html98"><small>Enseignement universitaire</small></a></li> <li> <a name="tex2html99" href="diffu_colloques_mn.html" target="main" id="tex2html99"><small>Participation à des colloques, séminaires, invitations</small></a> <ul> <li><a name="tex2html100" href= "diffu_colloques_mn.html#SECTION00093100000000000000" target="main" id="tex2html100"><small>Colloques, tutoriels, conférences et séminaires invités</small></a></li> <li><a name="tex2html101" href= "diffu_colloques_mn.html#SECTION00093200000000000000" target="main" id="tex2html101"><small>Séjours de chercheurs</small></a></li> </ul> </li> <li><a name="tex2html102" href= "diffu_jurythese_mn.html" target="main" id= "tex2html102"><small>Jurys de thèses et jurys divers</small></a></li> </ul> </li> <li><a name="tex2html103" href="bibliographie_mn.html" target="main" id= "tex2html103"><small>Bibliographie</small></a></li> </ul> </body>