| 2009 |
|---|
| 87 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Termination of rewriting under strategies.
ACM Trans. Comput. Log. 10(2): (2009) |
| 86 | EE | Claude Kirchner,
Hélène Kirchner,
Anderson Santana de Oliveira:
Analysis of Rewrite-Based Access Control Policies.
Electr. Notes Theor. Comput. Sci. 234: 55-75 (2009) |
| 2008 |
|---|
| 85 | EE | Oana Andrei,
Hélène Kirchner:
A Rewriting Calculus for Multigraphs with Ports.
Electr. Notes Theor. Comput. Sci. 219: 67-82 (2008) |
| 2007 |
|---|
| 84 | | Hubert Comon-Lundh,
Claude Kirchner,
Hélène Kirchner:
Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday
Springer 2007 |
| 83 | EE | Daniel J. Dougherty,
Claude Kirchner,
Hélène Kirchner,
Anderson Santana de Oliveira:
Modular Access Control Via Strategic Rewriting.
ESORICS 2007: 578-593 |
| 82 | EE | Anderson Santana de Oliveira,
Eric Ke Wang,
Claude Kirchner,
Hélène Kirchner:
Weaving rewrite-based access control policies.
FMSE 2007: 71-80 |
| 81 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.
Rewriting, Computation and Proof 2007: 44-67 |
| 80 | EE | Oana Andrei,
Hélène Kirchner:
Graph Rewriting and Strategies for Modeling Biochemical Networks.
SYNASC 2007: 407-414 |
| 2006 |
|---|
| 79 | EE | Oana Andrei,
Liliana Ibanescu,
Hélène Kirchner:
Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application.
Essays Dedicated to Joseph A. Goguen 2006: 194-215 |
| 78 | EE | Hélène Kirchner,
Silvio Ranise,
Christophe Ringeissen,
Duc-Khanh Tran:
Automatic Combinability of Rewriting-Based Satisfiability Procedures.
LPAR 2006: 542-556 |
| 77 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Computing constructor forms with non terminating rewrite programs.
PPDP 2006: 121-132 |
| 76 | EE | Olivier Bournez,
Liliana Ibanescu,
Hélène Kirchner:
From Chemical Rules to Term Rewriting.
Electr. Notes Theor. Comput. Sci. 147(1): 113-134 (2006) |
| 75 | EE | Claude Kirchner,
Hélène Kirchner,
Anderson Santana:
Anchoring Modularity in HTML.
Electr. Notes Theor. Comput. Sci. 157(2): 133-146 (2006) |
| 2005 |
|---|
| 74 | EE | Hélène Kirchner,
Silvio Ranise,
Christophe Ringeissen,
Duc-Khanh Tran:
On Superposition-Based Satisfiability Procedures and Their Combination.
ICTAC 2005: 594-608 |
| 73 | | Claude Kirchner,
Hélène Kirchner,
Anderson Santana:
Anchoring modularity in HTML.
WWV 2005: 139-151 |
| 72 | EE | Isabelle Gnaedig,
Hélène Kirchner:
Termination of rewriting strategies: a generic approach
CoRR abs/cs/0507064: (2005) |
| 2004 |
|---|
| 71 | EE | Claude Kirchner,
Hélène Kirchner:
Rule-Based Programming and Proving: The ELAN Experience Outcomes.
ASIAN 2004: 363-379 |
| 70 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
A Proof of Weak Termination Providing the Right Way to Terminate.
ICTAC 2004: 356-371 |
| 2003 |
|---|
| 69 | EE | Eric Deplagne,
Claude Kirchner,
Hélène Kirchner,
Quang Huy Nguyen:
Proof Search and Proof Check for Equational and Inductive Theorems.
CADE 2003: 297-316 |
| 68 | EE | Olivier Bournez,
Guy-Marie Côme,
Valérie Conraud,
Hélène Kirchner,
Liliana Ibanescu:
Automated Generation of Kinetic Chemical Mechanisms Using Rewriting.
International Conference on Computational Science 2003: 367-376 |
| 67 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
Simplification and termination of strategies in rule-based languages.
PPDP 2003: 124-135 |
| 66 | EE | Olivier Bournez,
Guy-Marie Côme,
Valérie Conraud,
Hélène Kirchner,
Liliana Ibanescu:
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.
RTA 2003: 30-45 |
| 2002 |
|---|
| 65 | | Hélène Kirchner,
Christophe Ringeissen:
Algebraic Methodology and Software Technology, 9th International Conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9-13, 2002, Proceedings
Springer 2002 |
| 64 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies.
PPDP 2002: 62-73 |
| 63 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
Outermost ground termination.
Electr. Notes Theor. Comput. Sci. 71: (2002) |
| 62 | | Quang Huy Nguyen,
Claude Kirchner,
Hélène Kirchner:
External Rewriting for Skeptical Proof Assistants.
J. Autom. Reasoning 29(3-4): 309-336 (2002) |
| 61 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Pierre-Etienne Moreau:
ELAN from a rewriting logic point of view.
Theor. Comput. Sci. 285(2): 155-185 (2002) |
| 60 | | Egidio Astesiano,
Michel Bidoit,
Hélène Kirchner,
Bernd Krieg-Brückner,
Peter D. Mosses,
Donald Sannella,
Andrzej Tarlecki:
CASL: the Common Algebraic Specification Language.
Theor. Comput. Sci. 286(2): 153-196 (2002) |
| 2001 |
|---|
| 59 | EE | Olivier Fissore,
Isabelle Gnaedig,
Hélène Kirchner:
Termination of Rewriting with Local Strategies.
Electr. Notes Theor. Comput. Sci. 58(2): (2001) |
| 58 | | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Christophe Ringeissen:
Rewriting with Strategies in ELAN: A Functional Semantics.
Int. J. Found. Comput. Sci. 12(1): 69-95 (2001) |
| 57 | | Hélène Kirchner,
Pierre-Etienne Moreau:
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories.
J. Funct. Program. 11(2): 207-251 (2001) |
| 56 | EE | Hélène Kirchner,
Peter D. Mosses:
Algebraic Specifications, Higher-order Types and Set-theoretic Models.
J. Log. Comput. 11(3): 453-481 (2001) |
| 2000 |
|---|
| 55 | | Hélène Kirchner,
Christophe Ringeissen:
Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings
Springer 2000 |
| 54 | | Hélène Kirchner:
Combining assisted and automated deduction.
Ann. Math. Artif. Intell. 28(1-4): 21-26 (2000) |
| 53 | | Bernhard Gramlich,
Hélène Kirchner,
Frank Pfenning:
Editorial: Strategies in Automated Deduction.
Ann. Math. Artif. Intell. 29(1-4): (2000) |
| 52 | EE | Hélène Kirchner,
Isabelle Gnaedig:
Termination and normalisation under strategy Proofs in ELAN.
Electr. Notes Theor. Comput. Sci. 36: (2000) |
| 1999 |
|---|
| 51 | | Hélène Kirchner:
ELAN.
JFPLC 1999: 241-248 |
| 50 | EE | Hubert Dubois,
Hélène Kirchner:
Rule Based Programming with Constraints and Strategies.
New Trends in Constraints 1999: 274-297 |
| 1998 |
|---|
| 49 | | Claude Kirchner,
Hélène Kirchner:
Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings
Springer 1998 |
| 48 | EE | Hélène Kirchner,
Peter D. Mosses:
Algebraic Specifications, Higher-Order Types, and Set-Theoretic Models.
AMAST 1998: 373-388 |
| 47 | | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner:
A Functional View of Rewriting and Strategies for a Semantics of ELAN.
Fuji International Symposium on Functional and Logic Programming 1998: 143-166 |
| 46 | EE | Pierre-Etienne Moreau,
Hélène Kirchner:
A Compiler for Rewrite Programs in Associative-Commutative Theories.
PLILP/ALP 1998: 230-249 |
| 45 | EE | Hélène Kirchner,
Pierre-Etienne Moreau:
Non-deterministic Computations in ELAN.
WADT 1998: 168-182 |
| 44 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Pierre-Etienne Moreau,
Christophe Ringeissen:
An overview of ELAN.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 43 | EE | Claude Kirchner,
Hélène Kirchner:
Preface.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 42 | | Claus Hintermeier,
Claude Kirchner,
Hélène Kirchner:
Dynamically Typed Computations for Order-Sorted Equational Presentations.
J. Symb. Comput. 25(4): 455-526 (1998) |
| 1996 |
|---|
| 41 | | Hélène Kirchner:
Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings
Springer 1996 |
| 40 | EE | Hélène Kirchner,
Pierre-Etienne Moreau:
A reflective extension of ELAN.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 39 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner:
Controlling rewriting by rewriting.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 38 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner,
Pierre-Etienne Moreau,
Marian Vittek:
ELAN: A logical framework based on computational systems.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 1995 |
|---|
| 37 | | Claus Hintermeier,
Hélène Kirchner,
Peter D. Mosses:
Combining Algebraic and Set-Theoretic Specifications.
COMPASS/ADT 1995: 255-273 |
| 36 | | Claus Hintermeier,
Hélène Kirchner,
Peter D. Mosses:
Rn- and Gn-Logics.
HOA 1995: 90-108 |
| 35 | | Hélène Kirchner,
Pierre-Etienne Moreau:
Prototyping Completion with Constraints Using Computational Systems.
RTA 1995: 438-443 |
| 1994 |
|---|
| 34 | | Claus Hintermeier,
Claude Kirchner,
Hélène Kirchner:
Sort Inheritance for Order-Sorted Equational Presentations.
COMPASS/ADT 1994: 319-335 |
| 33 | | Hélène Kirchner:
On the Use of Constraints in Automated Deduction
Constraint Programming 1994: 128-146 |
| 32 | | Claus Hintermeier,
Claude Kirchner,
Hélène Kirchner:
Dynamically-Typed Computations for Order-Sorted Equational Presentations.
ICALP 1994: 450-461 |
| 31 | | Hélène Kirchner,
Christophe Ringeissen:
Constraint Solving by Narrowing in Combined Algebraic Domains.
ICLP 1994: 617-631 |
| 30 | | Hélène Kirchner,
Christophe Ringeissen:
Combining Symbolic Constraint Solvers on Algebraic Domains.
J. Symb. Comput. 18(2): 113-155 (1994) |
| 1993 |
|---|
| 29 | | Claude Kirchner,
Hélène Kirchner,
Marian Vittek:
Implementing Computational Systems with Constraints.
PPCP 1993: 156-165 |
| 28 | | Hélène Kirchner:
Some Extensions of Rewriting.
Term Rewriting 1993: 54-73 |
| 1992 |
|---|
| 27 | | Hélène Kirchner,
Giorgio Levi:
Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings
Springer 1992 |
| 26 | | Hélène Kirchner,
Christophe Ringeissen:
A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms.
JICSLP 1992: 225-239 |
| 25 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner,
Aristide Mégrelis:
Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ.
J. Log. Program. 12(3&4): 257-279 (1992) |
| 24 | | Jieh Hsiang,
Hélène Kirchner,
Pierre Lescanne,
Michaël Rusinowitch:
The Term Rewriting Approach to Automated Theorem Proving.
J. Log. Program. 14(1&2): 71-99 (1992) |
| 23 | | Hélène Kirchner:
To Prof. Dr. Wolfgang Wechler.
Theor. Comput. Sci. 105(1): 4-5 (1992) |
| 1991 |
|---|
| 22 | | Hélène Kirchner:
Proofs in Parameterized Specification.
RTA 1991: 174-187 |
| 21 | | Miki Hermann,
Claude Kirchner,
Hélène Kirchner:
Implementations of Term Rewriting Systems.
Comput. J. 34(1): 20-33 (1991) |
| 1990 |
|---|
| 20 | | Hélène Kirchner,
Wolfgang Wechler:
Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings
Springer 1990 |
| 19 | | Hélène Kirchner,
Miki Hermann:
Meta-rule Synthesis from Crossed Rewrite Systems.
CTRS 1990: 143-154 |
| 18 | | Isabelle Gnaedig,
Claude Kirchner,
Hélène Kirchner:
Equational Completion in Order-Sorted Algebras.
Theor. Comput. Sci. 72(2&3): 169-202 (1990) |
| 1989 |
|---|
| 17 | EE | Claude Kirchner,
Hélène Kirchner:
Constrained Equational Reasoning.
ISSAC 1989: 382-389 |
| 16 | | Hélène Kirchner:
Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes.
Theor. Comput. Sci. 67(2&3): 303-332 (1989) |
| 1988 |
|---|
| 15 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner,
Aristide Mégrelis:
OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization.
ALP 1988: 41-52 |
| 14 | | Isabelle Gnaedig,
Claude Kirchner,
Hélène Kirchner:
Equational Completion in Order-Sorted Algebras (Extended Abstract).
CAAP 1988: 165-184 |
| 13 | | Claude Kirchner,
Hélène Kirchner,
José Meseguer:
Operational Semantics of OBJ-3 (Extended Abstract).
ICALP 1988: 287-301 |
| 1987 |
|---|
| 12 | | Joseph A. Goguen,
Claude Kirchner,
Hélène Kirchner,
Aristide Mégrelis,
José Meseguer,
Timothy C. Winkler:
An Introduction to OBJ 3.
CTRS 1987: 258-263 |
| 11 | | Hélène Kirchner:
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes.
RTA 1987: 180-191 |
| 10 | | Claude Kirchner,
Hélène Kirchner:
REVEUR-3: The Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies.
Sci. Comput. Program. 8(1): 69-86 (1987) |
| 1986 |
|---|
| 9 | | Jean-Pierre Jouannaud,
Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations.
SIAM J. Comput. 15(4): 1155-1194 (1986) |
| 1985 |
|---|
| 8 | | Claude Kirchner,
Hélène Kirchner:
Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies.
European Conference on Computer Algebra (2) 1985: 402-404 |
| 7 | | Pierre Réty,
Claude Kirchner,
Hélène Kirchner,
Pierre Lescanne:
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.
RTA 1985: 141-157 |
| 1984 |
|---|
| 6 | | Hélène Kirchner:
A General Inductive Completion Algorithm and Application to Abstract Data Types.
CADE 1984: 282-302 |
| 5 | | Jean-Pierre Jouannaud,
Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations.
POPL 1984: 83-92 |
| 4 | | Jean-Pierre Jouannaud,
Hélène Kirchner:
Construction D'un Plus Petit Odre de Simplification.
ITA 18(3): 191-208 (1984) |
| 1983 |
|---|
| 3 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner:
Incremental Construction of Unification Algorithms in Equational Theories.
ICALP 1983: 361-373 |
| 2 | | Jean-Pierre Jouannaud,
Hélène Kirchner,
Jean-Luc Remy:
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems.
IJCAI 1983: 909-915 |
| 1981 |
|---|
| 1 | | Claude Kirchner,
Hélène Kirchner,
Jean-Pierre Jouannaud:
Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees.
IJCAI 1981: 1016-1023 |
