Keywords
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Keywords » - entrée « Termination »
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.
Terminal < Termination < Termination orderings  Facettes :

List of bibliographic references indexed by Termination

Number of relevant bibliographic references: 21.
[0-20] [0 - 20][0 - 21][20-20][20-40]**** probable Xml problem ****
Ident.Authors (with country if any)Title
002481 (2011-01-05) Cody Roux [France]Refinement Types as Higher Order Dependency Pairs
002647 (2011) Carsten Fuhs [Allemagne] ; Jürgen Giesl [Allemagne] ; Michael Parting [Allemagne] ; Peter Schneider-Kamp [Danemark] ; Stephan Swiderski [Allemagne]Proving Termination by Dependency Pairs and Inductive Theorem Proving
002804 (2011) G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France]Quasi-interpretations a way to control resources
002805 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
002E27 (2010-02-01) Carlos Areces [France] ; Daniel Gorin [France]Resolution with Order and Selection for Hybrid Logics
003030 (2010) Michael Codish [Israël] ; Jürgen Giesl [Allemagne] ; Peter Schneider-Kamp [Danemark] ; René Thiemann [Autriche]SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
004841 (2007-07) Isabelle Gnaedig [France]Induction for Positive Almost Sure Termination
004E64 (2007) Isabelle Gnaedig [France]Induction for Positive Almost Sure Termination - Extended version -
005067 (2006-07-10) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Computing Constructor Forms with Non Terminating Rewrite Programs
005422 (2006) Salvador Lucas [Espagne]On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
005531 (2006) Solange Coupet-Grimal [France] ; William Delobel [France]An effective proof of the well-foundedness of the multiset path ordering
005793 (2006) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version -
00B205 (1998) Thomas GenetDecidable Approximations of Sets of Descendants and Sets of Normal forms
00B790