| Ident. | Authors (with country if any) | Title |
|---|
| 000125 |
Isabelle Gnaedig [France] ; Hélène Kirchner [France] | Proving weak properties of rewriting |
| 000170 |
Guillaume Burel [France] ; Claude Kirchner [France] | Regaining cut admissibility in deduction modulo using abstract completion |
| 000253 |
Guillaume Bonfante [France] ; Matthieu Kaczmarek [France] ; Jean-Yves Marion [France] | Architecture of a morphological malware detector : EICAR 2008 |
| 000343 |
Mathieu Turuani [France] | The CL-atse protocol analyser |
| 000356 |
Olivier Bournez [France] ; Florent Garnier [France] | Proving positive almost sure termination under strategies |
| 000363 |
Frédéric Blanqui ; Claude Kirchner ; Colin Riba | On the confluence of λ-calculus with conditional rewriting |
| 000367 |
Oana Andrei [France] ; Liliana Ibanescu [France] ; Hélène Kirchner [France] | Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application |
| 000378 |
Yannick Chevalier [France] ; Michaël Rusinowitch [France] | Hierarchical combination of intruder theories |
| 000381 |
Emilie Balland [France] ; Claude Kirchner [France] ; Pierre-Etienne Moreau [France] | Formal islands |
| 000397 |
Silvio Ghilardi [Italie] ; Enrica Nicolini [Italie] ; Silvio Ranise [Italie, France] ; Daniele Zucchelli [Italie, France] | Deciding extensions of the theory of arrays by integrating decision procedures and instantiation strategies |
| 000398 |
Maria Paola Bonacina [Italie] ; Silvio Ghilardi [Italie] ; Enrica Nicolini [Italie] ; Silvio Ranise [Italie, France] ; Daniele Zucchelli [Italie, France] | Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures |
| 000411 |
Nachum Dershowitz [Israël] ; Claude Kirchner [France] | Abstract canonical presentations |
| 000449 |
Clara Bertolissi [France] | The graph rewriting calculus : Confluence and expressiveness |
| 000455 |
Tomasz Truderung [France, Pologne] | Selecting theories and recursive protocols |
| 000462 |
Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and small space bounds |
| 000463 |
Olivier Bournez [France] ; Florent Garnier [France] | Proving positive almost-sure termination |
| 000473 |
Alessandro Armando [Italie] ; Maria Paola Bonacina [Italie] ; Silvio Ranise [France] ; Stephan Schulz [Italie] | On a rewriting approach to satisfiability procedures : Extension, combination of theories and an experimental appraisal |
| 000475 |
Silvio Ranise [France] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [France] | Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn |
| 000504 |
Frédéric Blanqui [France] | Decidability of type-checking in the calculus of algebraic constructions with size annotations |
| 000574 |
Horatiu Cirstea [France] ; Luigi Liquori [France] ; Benjamin Wack [France] | Rewriting calculus with fixpoints: Untyped and first-order systems |
| 000633 |
Frédéric Blanqui [France] | A type-based termination criterion for dependently-typed higher-order rewrite systems |
| 000677 |
Olivier Bournez [France] ; Mathieu Hoyrup [France] | Rewriting Logic and probabilities |
| 000679 |
Gilles Barthe [États-Unis, France] ; Horatiu Cirstea ; Claude Kirchner ; Luigi Liquori | Pure patterns Type systems |
| 000680 |
Michaël Rusinowitch [France] ; Mathieu Turuani [France] | Protocol insecurity with a finite number of sessions and composed keys is NP-complete |
| 000681 |
Eric Deplagne [France] ; Claude Kirchner [France] ; Hélène Kirchner [France] ; Quang Huy Nguyen [France] | Proof search and proof check for equational and inductive theorems |
| 000686 |
Sylvain Salvati [France] ; Philippe De Groote [France] | On the complexity of higher-order matching in the linear λ-Calculus |
| 000707 |
Mark Van Den Brand [Pays-Bas] ; Pierre-Etienne Moreau [France] ; Jurgen Vinju [Pays-Bas] | Environments for term rewriting engines for free! |
| 000721 |
Olivier Bournez [France] ; Guy-Marie Come [France] ; Valérie Conraud [France] ; Hélène Kirchner [France] ; Liliana Ibanescu [France] | Automated generation of kinetic chemical mechanisms using rewriting |
| 000731 |
Olivier Bournez [France] ; Guy-Marie Come [France] ; Valérie Conraud [France] ; Hélène Kirchner [France] ; Liliana Ibanescu [France] | A rule-based approach for automated generation of kinetic chemical mechanisms |
| 000767 |
M. G. J. Van Den Brand [Pays-Bas, France] ; P.-E. Moreau [France] ; C. Ringeissen [France] | The ELAN environment: a rewriting logic environment based on ASF+SDF technology: System demonstration |
| 000779 |
Olivier Bournez [France] ; Claude Kirchner [France] | Probabilistic rewrite strategies. Applications to ELAN |
| 000788 |
Adel Bouhoula [Tunisie] ; Michaël Rusinowitch [France] | Observational proofs by rewriting |
| 000808 |
Germain Faure [France] ; Claude Kirchner [France] | Exceptions in the rewriting calculus |
| 000809 |
Peter Borovansky [Slovaquie] ; Claude Kirchner [France] ; Hélène Kirchner [France] ; Pierre-Etienne Moreau [France] | ELAN from a rewriting logic point of view |
| 000813 |
Eric Deplagne [France] ; Claude Kirchner [France] | Deduction versus computation: The case of induction |
| 000822 |
Silvio Ranise [France] | Combining generic and domain specific Reasoning by using contexts |
| 000877 |
Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France] | The Rho cube |
| 000879 |
Alessandro Armando [Italie] ; Luca Compagna [Italie] ; Silvio Ranise [Italie, France] | System description : RDL rewrite and decision procedure laboratory |
| 000881 |
Horatiu Cirstea [France] | Specifying authentication protocols using rewriting and strategies |
| 000B29 |
H. Cirstea [France] ; C. Kirchner [France] | The rewriting calculus as a semantics of ELAN |
| 000B37 |
E. A. Cichon [France] ; E. T. Bittar [France] | Ordinal recursive bounds for Higman's theorem |
| 000B72 |
P.-E. Moreau [France] ; H. Kirchner [France] | A compiler for rewrite programs in associative-commutative theories |
| 000C01 |
M. Hermann [France] ; R. Galbavy [France] | Unification of infinite sets of terms schematized by primal grammars |
| 000C06 |
T. Genet [France] ; I. Gnaedig [France] | Termination proofs using gpo ordering constraints |
| 000C12 |
C. Ringeissen [France] | Prototyping combination of unification algorithms with the ELAN rule-based programming language |
| 000C73 |
A. Bouhoula [France] | Using induction and rewriting to verify and complete parameterized specifications |
| 000C75 |
I. Alouini [France] ; C. Kirchner [France] | Toward the concurrent implementation of computational systems |
| 000C92 |
C. Kirchner [France] ; C. Lynch [France] ; C. Scharff [France] | Fine-grained concurrent completion |
| 000D04 |
N. Berregeb [France] ; A. Bouhoula [France] ; M. Rusinowtich [France] | Automated verification by induction with associative-commutative operators |
| 000D09 |
M. Vittek [France] | A compiler for nondeterministic term rewriting systems |
| 000D20 |
G. Kucherov [France] ; M. Rusinowitch | Undecidability of ground reducibility for word rewriting systems with variables |
| 000D59 |
J. Rouyer [France] | Preuves 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 |
| 000D65 |
M. Hermann ; C. Kirchner ; H. Kirchner | Implementations of term rewriting systems |
| 000D66 |
N. Doggaz ; C. Kirchner | Completion for unification |
| 000D81 |
| Proceedings/2nd. International conference on rewriting techniques and applications, Bordeaux, France, May 25-27, 1987 |
| 000D85 |
F. Bellegarde ; M. Sintzoff | Rewriting systems on FP expressions to reduce the number of sequences yielded |
