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

Index « Keywords » - entrée « rewriting »
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.
rewrite systems < rewriting < rewriting and completion modulo equalities  Facettes :

List of bibliographic references indexed by rewriting

Number of relevant bibliographic references: 226.
[0-50] [0 - 20][0 - 50][50-70]
Ident.Authors (with country if any)Title
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
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
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
003674 (2009-03-11) Emilie Balland [France]Design of a programming language dedicated to program analysis and transformation
003767 (2009) Yves Guiraud [France] ; Philippe Malbos [France]Higher-dimensional categories with finite derivation type
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
004590 (2008) Najah Chridi [France] ; Mathieu Turuani [France] ; Michaël Rusinowitch [France]Constraints-based Verification of Parameterized Cryptographic Protocols.
004738 (2007-09-17) Florent Garnier [France]Termination within a finite mean time of probabilistic rules based systems
004B56 (2007) Guillaume Burel [France]Unbounded Proof-Length Speed-Up in Deduction Modulo
004B58 (2007) Yannick Chevalier [France] ; Denis Lugiez [France] ; Michaël Rusinowitch [France]Towards an Automatic Analysis of Web Service Security
004E20 (2007) Yannick Chevalier [France] ; Denis Lugiez [France] ; Michael Rusinowitch [France]Toward an Automatic Analysis of Web Service Security
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
005832 (2006) Frédéric Blanqui [France](HO)RPO Revisited
005883 (2005-10-07) Benjamin Wack [France]Type systems and deduction in the rewriting calculus
005923 (2005-09) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Termination of rewriting strategies: a generic approach
005951 (2005-08) Sébastien Hinderer [France]Certification of Termination Proofs Using Polynomial Interpretations
005C37 (2005) Frédéric Blanqui [France]Inductive types in the Calculus of Algebraic Constructions
005D06 (2005) Sébastien HindererCertification of Termination Proofs Using Polynomial Interpretations
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
006002 (2005) Hejer RejebPreuve inductive de terminaison faible : vers une implantation
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
006740 (2004) Liliana IbanescuProgrammation par règles et stratégies pour la génération automatique de mécanismes de combustion d'hydrocarbures polycycliques
006778 (2004) Frederic BlanquiA type-based termination criterion for dependently-typed higher-order rewrite systems
006875 (2004) Horatiu Cirstea ; Pierre-Etienne Moreau ; Antoine ReillesRule based programming in Java for protocol verification
006897 (2004) Yannick ChevalierA Simple Constraint-solving Decision Procedure for Protocols with Exclusive or
006B10 (2004) Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification Modulo ACUI Plus Distributivity Axioms
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
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 -
007095 (2004) Frédéric Blanqui [France]A type-based termination criterion for dependently-typed higher-order rewrite systems
007098 (2004) Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France]A proof of weak termination providing the right way to terminate
007109 (2004) Yannick Chevalier [France]A Simple Constraint-solving Decision Procedure for Protocols with Exclusive or
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
007291 (2003-01-15) Gilles Barthe [France] ; Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France]Pure Patterns Type Systems
007363 (2003) Olivier FissoreTerminaison de la réécriture sous stratégies
007402 (2003) Antoine ReillesRéécriture dans un cadre concurrent

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i -k "rewriting" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/KwdEn.i  \
                -Sk "rewriting" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    KwdEn.i
   |clé=    rewriting
}}

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