Système réécriture And NotEnrica Nicolini
List of bibliographic references
Number of relevant bibliographic references: 43.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000227 | Keiichirou Kusakari [Japon] ; Yasuo Isogai [Japon] ; Masahiko Sakai [Japon] ; Frédéric Blanqui [France] | Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems |
| 000335 | Florent Jacquemard [France] ; Michael Rusinowitch [France] ; Laurent Vigneron [France] | Tree automata with equality constraints modulo equational theories |
| 000356 | Olivier Bournez [France] ; Florent Garnier [France] | Proving positive almost sure termination under strategies |
| 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 |
| 000527 | Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France] | A proof of weak termination providing the right way to terminate |
| 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 |
| 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 |
| 000690 | Christophe Ringeissen [France] | Matching in a class of combined non-disjoint theories |
| 000705 | Jürgen Stuber [France] ; Mark Van Den Brand [Pays-Bas] | Extracting mathematical semantics from LATEX documents |
| 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 |
| 000723 | J. Y. Marion [France] | Analysing the implicit complexity of programs |
| 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 |
| 000732 | Alessandro Armando [Italie] ; Silvio Ranise [Italie, France] ; Michaël Rusinowitch [France] | A rewriting approach to satisfiability procedures |
| 000803 | David Deharbe [Brésil] ; Anamaria Martins Moreira [Brésil] ; Christophe Ringeissen [France] | Improving symbolic model checking by rewriting temporal logic formulae |
| 000874 | Alessandro Armando [Italie] ; Silvio Ranise [Italie, France] ; Michaël Rusinowitch [France] | Uniform derivation of decision procedures by superposition |
| 000899 | Christophe Ringeissen [France] | Matching with free function symbols : A simple extension of matching? |
| 000900 | Horatiu Cirstea [France] ; Claude Kirchner [France] ; Luigi Liquori [France] | Matching power |
| 000980 | G. Kucherov [France] ; M. Rusinowitch [France] | Patterns in words versus patterns in trees : A brief survey and new results |
| 000A17 | L. Bachmair [États-Unis] ; I. V. Ramakrishnan [États-Unis] ; A. Tiwari [États-Unis] ; L. Vigneron [France] | Congruence closure modulo associativity and commutativity |
| 000A27 | M. G. J. Van Den Brand [France] ; C. Ringeissen [Pays-Bas] | ASF+SDF parsing tools applied to ELAN |
| 000A32 | C. Castro [France] ; E. Monfroy [Pays-Bas] | A control language for designing constraint solvers |
| 000A68 | P. Narendran [États-Unis] ; M. Rusinowitch [France] ; R. Verma [États-Unis] | RPO constraint solving is in NP |
| 000A69 | P. De Groote [France] | On the strong normalisation of natural deduction with permutation-conversions |
| 000A76 | H. Kirchner [France] ; P.-E. Moreau [France] | Non-deterministic computations in ELAN |
| 000A82 | G. Dowek [France] ; T. Hardin [France] ; C. Kirchner [France] | Hol-λσ : An intentional first-order expression of higher-order logic |
| 000A92 | V. Cortier [France] ; H. Ganzinger [Allemagne] ; F. Jacquemard [France] ; M. Veanes [Allemagne] | Decidable fragments of simultaneous rigid reachability |
| 000A97 | G. Bonfante [France] ; A. Cichon [France] ; J. Y. Marion [France] ; H. Touzet [France] | Complexity classes and rewrite systems with polynomial interpretation |
| 000B38 | M. Hermann [France] ; G. Salzer [Autriche] | On the word, subsumption, and complement problem for recurrent term schematizations |
| 000B41 | N. Berregeb [France] ; A. Bouhoula [France] ; M. Rusinowitch [France] | Observational proofs with critical contexts |
| 000B44 | B. Gramlich [France] | Modular aspects of rewrite-based specifications |
| 000B55 | H. Touzet [France] | Encoding the Hydra battle as a rewrite system |
| 000B56 | T. Genet [France] | Decidable approximations of sets of descendants and sets of normal forms |
| 000B59 | C. Castro [France] | COLETTE, prototyping CSP solvers using a rule-based language |
| 000B62 | C. Lynch [États-Unis] ; C. Scharff [France] | Basic Completion with E-cycle Simplification |
| 000B71 | H. Touzet [France] | A complex example of a simplifying rewrite system |
| 000D25 | V. M. Antimirov [France] ; P. D. Mosses | Rewriting extended regular expressions |
| This area was generated with Dilib version V0.6.33. |  |