Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Le cluster surréduction - terminaison

Terms

9surréduction
13terminaison
31réécriture
226rewriting
86termination
7ordering
5contraintes d'ordre
13confluence

Associations

Freq.WeightAssociation
50.462surréduction - terminaison
80.399réécriture - terminaison
60.359réécriture - surréduction
100.299terminaison - termination
550.395rewriting - termination
210.251rewriting - réécriture
60.245ordering - termination
50.241contraintes d'ordre - termination
100.184rewriting - terminaison
50.180surréduction - termination
50.150confluence - termination
50.149contraintes d'ordre - rewriting
70.136réécriture - termination
60.133rewriting - surréduction
Documents par ordre de pertinence
009195 (2001) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]Induction for termination with local strategies
009638 (2001) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]Induction for termination with local strategies - Extended version -
009639 (2001) Isabelle Gnaedig [France] ; Hélène Kirchner [France] ; Olivier Fissore [France]Induction for innermost and outermost ground termination
007F45 (2002-10) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]CARIBOO: An Induction Based Proof Tool for Termination with Strategies
00AC92 (1999) Isabelle Gnaedig [France] ; Hélène Kirchner [France] ; Thomas GenetInduction for Termination
007095 (2004) Frédéric Blanqui [France]A type-based termination criterion for dependently-typed higher-order rewrite systems
008A91 (2002) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]Outermost ground termination
00AD82 (1998-08) Hélène Touzet [France]Encoding the Hydra battle as a rewrite system
00B595 (1998) Paliath Narendran [France] ; Michaël Rusinowitch ; Rakesh VermaRPO constraint solving is in NP
005832 (2006) Frédéric Blanqui [France](HO)RPO Revisited
006F07 (2004) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak termination also provides the right way to terminate - Extended version -
007E55 (2003) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]CARIBOO: A Multi-Strategy Termination Proof Tool Based on Induction
008A92 (2002) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]Outermost ground termination - Extended version
00AC84 (1999) Jean-Yves Marion [France]Light Multiset path ordering and Ptime - Two is better than one
003413 (2009-09-07) Frédéric Blanqui [République populaire de Chine] ; Cody Roux [France]On the relation between sized-types based termination and semantic labelling
003E48 (2008-09-15) Frédéric Blanqui [République populaire de Chine] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]The computability path ordering: the end of a quest
004738 (2007-09-17) Florent Garnier [France]Termination within a finite mean time of probabilistic rules based systems
005038 (2006-08-15) Frédéric Blanqui [France]Higher-order dependency pairs
005039 (2006-08-15) Frédéric Blanqui [France] ; Solange Coupet-Grimal [France] ; William Delobel [France] ; Sébastien Hinderer [France] ; Adam Koprowski [Pays-Bas]CoLoR: a Coq library on rewriting and termination
005470 (2006) Frédéric Blanqui [France] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]Higher-Order Termination: From Kruskal to Computability
005923 (2005-09) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Termination of rewriting strategies: a generic approach
005C37 (2005) Frédéric Blanqui [France]Inductive types in the Calculus of Algebraic Constructions
005D07 (2005) Frédéric BlanquiDecidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations
005E34 (2005) Frederic BlanquiDefinitions by Rewriting in the Calculus of Constructions
005F28 (2005) Isabelle Gnaedig ; Hélène KirchnerTermination of rewriting strategies : a generic approach
006114 (2005) Frédéric Blanqui [France]Definitions by rewriting in the Calculus of Constructions
006271 (2005) Frédéric Blanqui [France]Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
006778 (2004) Frederic BlanquiA type-based termination criterion for dependently-typed higher-order rewrite systems
006E68 (2004) Benjamin Wack [France]The Simply-typed Pure Pattern Type System Ensures Strong Normalization
006E96 (2004) Horatiu Cirstea [France] ; Pierre-Etienne Moreau [France] ; Antoine Reilles [France]Rule based programming in Java for protocol verification
007098 (2004) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]A proof of weak termination providing the right way to terminate
007256 (2003-06) Olivier Bournez [France] ; Guy-Marie Côme [France] ; Valérie Conraud [France] ; Hélène Kirchner [France] ; Mariana-Liliana Ibanescu [France]A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms
007454 (2003) Hubert Comon-Lundh [France] ; Paliath Narendran [États-Unis] ; Robert Nieuwenhuis ; Michaël Rusinowitch [France]Deciding the Confluence of Ordered Term Rewrite Systems
007510 (2003) Jean-Yves MoyenAnalyse de la complexité et transformation de programmes
007559 (2003) Olivier Fissore ; Isabelle Gnaedig ; Helene KirchnerCARIBOO : A Multi-Strategy Termination Proof Tool Based on Induction
007572 (2003) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerSimplification and Termination of Strategies in Rule-Based Languages
007630 (2003) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerTermination of ELAN strategies by simplification - Extended version -
007827 (2003) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerOutermost ground termination
007846 (2003) Issam ChebbiAide à la preuve et à la validation en programmation par règles
007E95 (2003) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian VittekA Pattern Matching Compiler for Multiple Target Languages
008010 (2002-07) Olivier Bournez [France] ; Claude Kirchner [France]Probabilistic rewrite strategies. Applications to ELAN
008015 (2002-07) David Déharbe ; Anamaria Martins Moreira ; Christophe Ringeissen [France]Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
008020 (2002-07) Eric Deplagne [France] ; Claude Kirchner [France]Deduction versus Computation: the Case of Induction
008353 (2002) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerCARIBOO : An Induction Based Proof Tool for Termination with Strategies -- Extended version--
008377 (2002) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerCARIBOO : An Induction Based Proof Tool for Termination with Strategies
008580 (2002) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerOutermost ground termination - Extended version
008622 (2002) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerOutermost ground termination
008D21 (2001-03) Horatiu Cirstea [France]Specifying Authentication Protocols Using Rewriting and Strategies
008F59 (2001) Isabelle Gnaedig ; Hélène Kirchner ; Olivier FissoreInduction for innermost and outermost ground termination
008F65 (2001) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerInduction for termination with local strategies - Extended version -
008F88 (2001) Olivier Fissore ; Isabelle Gnaedig ; Hélène KirchnerInduction for termination with local strategies
009620 (2001) Christophe Ringeissen [France]Matching with Free Function Symbols -- A Simple Extension of Matching?
009693 (2001) Rakesh Verma [États-Unis] ; Michaël Rusinowitch [France] ; Denis LugiezAlgorithms and Reductions for Rewriting Problems
009A81 (2000) Hélène Kirchner ; Isabelle GnaedigTermination and normalisation under strategies--Proofs in ELAN
009B35 (2000) Isabelle Gnaedig ; Hélène Kirchner ; Olivier FissoreInduction for termination
00A123 (2000) Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]The theory of total unary RPO is decidable
00A158 (2000) Pierre-Etienne Moreau [France]REM (Reduce Elan Machine): Core of the New ELAN Compiler
00A714 (1999) Isabelle Gnaedig ; Hélène Kirchner ; Thomas GenetInduction for Termination
00A723 (1999) Jean-Yves MarionLight Multiset path ordering and Ptime - Two is better than one
00B023 (1998) Hélène TouzetEncoding the Hydra battle as a rewrite system
00B070 (1998) Paliath Narendran ; Michael Rusinowitch ; Rakesh VermaRPO constraint solving is in NP
00BD49 (1997) Bernhard Gramlich [France]On Semi-Completeness of Term Rewriting Systems
00BD51 (1997) Bernhard Gramlich [France]Modular Aspects of Rewrite-Based Specifications
00CF25 (1993) M. Navarro ; F. Orejas ; J.-L. RémyContextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications
00D412 (1992) E. A. Cichon ; Pierre Lescanne [France]Polynomial Interpretations and the Complexity of Algorithms
00D476 (1992) Pierre Lescanne [France]Termination of Rewrite Systems by Elementary Interpretations
00D731 (1991) J. RouyerPreuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm
00D746 (1991) J. RouyerCalcul formel en géométrie algébrique réelle appliqué à la terminaison des systèmes de réécriture
00D907 (1991) I. GnaedigTermination of Rewriting in Order-Sorted Algebras
00D925 (1991) Pierre Lescanne [France]Termination of Rewrite Systems by Elementary Interpretations
00DF63 (1989) C. Kirchner ; H. KirchnerRewriting : Theory and Applications
00E434 (1987) Pierre Lescanne [France] ; A. LazrekProving inductive properties of functions defined by rewriting systems in presence of relations among constructors. A description of an actual implementation, based on proofs by consistency
00E448 (1987) A. Ben Cherifa ; Pierre Lescanne [France]Termination of rewriting systems by polynomial. Interpretations and its implementation
00E454 (1987) I. GnaedigInvestigations on termination of equational rewriting
00E516 (1987) Pierre Lescanne [France] ; T. Heuillard ; M. Dauchet ; S. TisonDecidability of the confluence of ground term rewriting systems
00E526 (1987) M. RusinowitchOn termination of the direct sum of term rewriting systems
00E647 (1986) I. GnaedigPreuves de terminaison des systèmes de réécriture associatifs commutatifs : une méthode fondée sur la réécriture elle-même
00E660 (1986) A. Ben CherifaPreuves de terminaison des systèmes de réécriture : un outil fondé sur les interprétations polynomiales
00E693 (1986) A. Ben Cherifa ; I. Gnaedig ; Pierre Lescanne [France]Les outils de preuve de terminaison dans REVE
00E705 (1986) I. Gnaedig ; Pierre Lescanne [France]Rewriting systems for proving termination of rewriting systems - Application to associative commutative rewriting
00E763 (1986) M. RusinowitchOn termination of the direct sum of term rewriting systems
00EA89 (1984) Itle Equipe EurecaOutils techniques pour la validation et la spécification des types abstraits algébriques
00EB82 (1984) M. Munoz ; J.-P. JouannaudTermination of a set of rules modulo a set of equations
000686 (2015) Guillaume Bonfante [France] ; Florian Deloup [France] ; Antoine Henrot [France]Real or Natural numbers interpretations and their effect on complexity
000952 (2014-09-12) Jean-Christophe Bach [France]A formal Island for qualifiable model transformations
001C17 (2012-03-02) Cláudia Tavares [France]A type system for embedded rewriting programming
001F65 (2011-12-09) Guillaume Bonfante [France]Implicit computational complexity : program interpretations
002004 (2011-11-14) Philippe Beaucamps [France]Analysis of Malware by Behavior Abstraction
002805 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
002905 (2010-12-13) Guillaume Hoffmann [France]Reasoning Tasks for Hybrid Logics
002979 (2010-11-01) Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France]Behavior Abstraction in Malware Analysis
002B39 (2010-08-12) Philippe Beaucamps [France] ; Isabelle Gnaedig [France] ; Jean-Yves Marion [France]Behavior Abstraction in Malware Analysis - Extended Version
002D97 (2010-03-12) Clément Houtmann [France]Representation and interaction of proofs in superdeduction modulo
003171 (2010) Guillaume Burel [France] ; Claude Kirchner [France]Regaining cut admissibility in deduction modulo using abstract completion
003317 (2009-11-27) Christophe Ringeissen [France]Equational reasoning and combination methods: from programs to proofs
003325 (2009-11-18) Véronique Cortier [France]Analysis of cryptographic protocols: from symbolic to computational models
003335 (2009-11-06) Paul Bedaride [France] ; Claire Gardent [France]Noun/Verb Inference
003674 (2009-03-11) Emilie Balland [France]Design of a programming language dedicated to program analysis and transformation
003743 (2009) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Termination of Rewriting under Strategies
003767 (2009) Yves Guiraud [France] ; Philippe Malbos [France]Higher-dimensional categories with finite derivation type
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022