| 2009 |
|---|
| 101 | 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 |
|---|
| 100 | EE | Nachum Dershowitz,
Claude Kirchner:
SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets.
Concurrency, Graphs and Models 2008: 194-208 |
| 99 | EE | Claude Kirchner,
Radu Kopetz,
Pierre-Etienne Moreau:
Anti-pattern Matching Modulo.
LATA 2008: 275-286 |
| 98 | EE | Paolo Baldan,
Clara Bertolissi,
Horatiu Cirstea,
Claude Kirchner:
Towards a Sharing Strategy for the Graph Rewriting Calculus.
Electr. Notes Theor. Comput. Sci. 204: 111-127 (2008) |
| 2007 |
|---|
| 97 | | 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 |
| 96 | EE | Claude Kirchner,
Radu Kopetz,
Pierre-Etienne Moreau:
Anti-pattern Matching.
ESOP 2007: 110-124 |
| 95 | EE | Daniel J. Dougherty,
Claude Kirchner,
Hélène Kirchner,
Anderson Santana de Oliveira:
Modular Access Control Via Strategic Rewriting.
ESORICS 2007: 578-593 |
| 94 | EE | Anderson Santana de Oliveira,
Eric Ke Wang,
Claude Kirchner,
Hélène Kirchner:
Weaving rewrite-based access control policies.
FMSE 2007: 71-80 |
| 93 | EE | Clara Bertolissi,
Claude Kirchner:
The Rewriting Calculus as a Combinatory Reduction System.
FoSSaCS 2007: 78-92 |
| 92 | EE | Guillaume Burel,
Claude Kirchner:
Cut Elimination in Deduction Modulo by Abstract Completion.
LFCS 2007: 115-131 |
| 91 | EE | Paul Brauner,
Clément Houtmann,
Claude Kirchner:
Principles of Superdeduction.
LICS 2007: 41-50 |
| 90 | EE | Paul Brauner,
Clément Houtmann,
Claude Kirchner:
Superdeduction at Work.
Rewriting, Computation and Proof 2007: 132-166 |
| 89 | EE | Maribel Fernández,
Claude Kirchner:
Preface.
Electr. Notes Theor. Comput. Sci. 171(4): 1-2 (2007) |
| 88 | EE | Horatiu Cirstea,
Germain Faure,
Claude Kirchner:
A rho-calculus of explicit constraint application.
Higher-Order and Symbolic Computation 20(1-2): 37-72 (2007) |
| 87 | EE | Paolo Baldan,
Clara Bertolissi,
Horatiu Cirstea,
Claude Kirchner:
A rewriting calculus for cyclic higher-order term graphs.
Mathematical Structures in Computer Science 17(3): 363-406 (2007) |
| 2006 |
|---|
| 86 | EE | Emilie Balland,
Claude Kirchner,
Pierre-Etienne Moreau:
Formal Islands.
AMAST 2006: 51-65 |
| 85 | EE | Guillaume Burel,
Claude Kirchner:
Completion Is an Instance of Abstract Canonical System Inference.
Essays Dedicated to Joseph A. Goguen 2006: 497-520 |
| 84 | EE | Frédéric Blanqui,
Claude Kirchner,
Colin Riba:
On the Confluence of lambda-Calculus with Conditional Rewriting.
FoSSaCS 2006: 382-397 |
| 83 | EE | Claude Kirchner,
Pierre-Etienne Moreau,
Antoine Reilles:
Formal Validation of Pattern Matching code.
Trustworthy Software 2006 |
| 82 | EE | Frédéric Blanqui,
Claude Kirchner,
Colin Riba:
On the confluence of lambda-calculus with conditional rewriting
CoRR abs/cs/0609002: (2006) |
| 81 | EE | Claude Kirchner,
Hélène Kirchner,
Anderson Santana:
Anchoring Modularity in HTML.
Electr. Notes Theor. Comput. Sci. 157(2): 133-146 (2006) |
| 80 | EE | Clara Bertolissi,
Horatiu Cirstea,
Claude Kirchner:
Expressing combinatory reduction systems derivations in the rewriting calculus.
Higher-Order and Symbolic Computation 19(4): 345-376 (2006) |
| 79 | EE | Nachum Dershowitz,
Claude Kirchner:
Abstract canonical presentations.
Theor. Comput. Sci. 357(1-3): 53-69 (2006) |
| 2005 |
|---|
| 78 | EE | Claude Kirchner,
Pierre-Etienne Moreau,
Antoine Reilles:
Formal validation of pattern matching code.
PPDP 2005: 187-197 |
| 77 | | Claude Kirchner,
Hélène Kirchner,
Anderson Santana:
Anchoring modularity in HTML.
WWV 2005: 139-151 |
| 76 | EE | Horatiu Cirstea,
Germain Faure,
Claude Kirchner:
A rho-Calculus of Explicit Constraint Application.
Electr. Notes Theor. Comput. Sci. 117: 51-67 (2005) |
| 75 | EE | Claude Kirchner:
Strategic Rewriting.
Electr. Notes Theor. Comput. Sci. 124(2): 3-9 (2005) |
| 74 | EE | Clara Bertolissi,
Paolo Baldan,
Horatiu Cirstea,
Claude Kirchner:
A Rewriting Calculus for Cyclic Higher-order Term Graphs.
Electr. Notes Theor. Comput. Sci. 127(5): 21-41 (2005) |
| 2004 |
|---|
| 73 | EE | Claude Kirchner,
Hélène Kirchner:
Rule-Based Programming and Proving: The ELAN Experience Outcomes.
ASIAN 2004: 363-379 |
| 2003 |
|---|
| 72 | 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 |
| 71 | EE | Nachum Dershowitz,
Claude Kirchner:
Abstract Saturation-Based Inference.
LICS 2003: 65-74 |
| 70 | EE | Gilles Barthe,
Horatiu Cirstea,
Claude Kirchner,
Luigi Liquori:
Pure patterns type systems.
POPL 2003: 250-261 |
| 69 | EE | Clara Bertolissi,
Horatiu Cirstea,
Claude Kirchner:
Translating Combinatory Reduction Systems into the Rewriting Calculus.
Electr. Notes Theor. Comput. Sci. 86(2): (2003) |
| 68 | EE | Horatiu Cirstea,
Claude Kirchner,
Luigi Liquori,
Benjamin Wack:
Rewrite strategies in the rewriting calculus.
Electr. Notes Theor. Comput. Sci. 86(4): (2003) |
| 67 | EE | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner:
Theorem Proving Modulo.
J. Autom. Reasoning 31(1): 33-72 (2003) |
| 2002 |
|---|
| 66 | EE | Eric Deplagne,
Claude Kirchner:
Deduction versus Computation: The Case of Induction.
AISC 2002: 4-6 |
| 65 | EE | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner:
Binding Logic: Proofs and Models.
LPAR 2002: 130-144 |
| 64 | EE | Olivier Bournez,
Claude Kirchner:
Probabilistic Rewrite Strategies. Applications to ELAN.
RTA 2002: 252-266 |
| 63 | EE | Germain Faure,
Claude Kirchner:
Exceptions in the Rewriting Calculus.
RTA 2002: 66-82 |
| 62 | EE | Horatiu Cirstea,
Claude Kirchner,
Luigi Liquori:
Rewriting Calculus with(out) Types.
Electr. Notes Theor. Comput. Sci. 71: (2002) |
| 61 | | Quang Huy Nguyen,
Claude Kirchner,
Hélène Kirchner:
External Rewriting for Skeptical Proof Assistants.
J. Autom. Reasoning 29(3-4): 309-336 (2002) |
| 60 | 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) |
| 2001 |
|---|
| 59 | EE | Horatiu Cirstea,
Claude Kirchner,
Luigi Liquori:
The Rho Cube.
FoSSaCS 2001: 168-183 |
| 58 | EE | Horatiu Cirstea,
Claude Kirchner,
Luigi Liquori:
Matching Power.
RTA 2001: 77-92 |
| 57 | EE | Emmanuel Beffara,
Olivier Bournez,
Hassen Kacem,
Claude Kirchner:
Verification of Timed Automata Using Rewrite Rules and Strategies
CoRR cs.PL/0109024: (2001) |
| 56 | | 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) |
| 55 | EE | Horatiu Cirstea,
Claude Kirchner:
The rewriting calculus - Part I.
Logic Journal of the IGPL 9(3): (2001) |
| 54 | EE | Horatiu Cirstea,
Claude Kirchner:
The rewriting calculus - Part II.
Logic Journal of the IGPL 9(3): (2001) |
| 53 | | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner:
HOL-[lambda][sigma]: an intentional first-order expression of higher-order logic.
Mathematical Structures in Computer Science 11(1): 21-45 (2001) |
| 2000 |
|---|
| 52 | EE | Horatiu Cirstea,
Claude Kirchner:
The simply typed rewriting calculus.
Electr. Notes Theor. Comput. Sci. 36: (2000) |
| 51 | | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner:
Higher Order Unification via Explicit Substitutions.
Inf. Comput. 157(1-2): 183-235 (2000) |
| 1999 |
|---|
| 50 | EE | Hubert Comon,
Claude Kirchner:
Constraint Solving on Terms.
CCL 1999: 47-103 |
| 49 | EE | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner:
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic.
RTA 1999: 317-331 |
| 48 | | Hubert Comon,
Mehmet Dincbas,
Jean-Pierre Jouannaud,
Claude Kirchner:
A Methodological View of Constraint Solving.
Constraints 4(4): 337-361 (1999) |
| 47 | EE | Eric Domenjoud,
Claude Kirchner,
Jianyang Zhou:
Generating Feasible Schedules for a Pick-up and Delivery Problem.
Electronic Notes in Discrete Mathematics 1: 36-47 (1999) |
| 1998 |
|---|
| 46 | | 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 |
| 45 | EE | Horatiu Cirstea,
Claude Kirchner:
The Rewriting Calculus as a Semantics of ELAN.
ASIAN 1998: 84-85 |
| 44 | EE | Eric Domenjoud,
Claude Kirchner,
Jianyang Zhou:
Generating Feasible Schedules for a Pick-Up and Delivery Problem.
CP 1998: 467 |
| 43 | | 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 |
| 42 | 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) |
| 41 | EE | Claude Kirchner,
Hélène Kirchner:
Preface.
Electr. Notes Theor. Comput. Sci. 15: (1998) |
| 40 | | Claude Kirchner,
Christophe Ringeissen:
Rule-Based Constraint Programming.
Fundam. Inform. 34(3): 225-262 (1998) |
| 39 | | Claus Hintermeier,
Claude Kirchner,
Hélène Kirchner:
Dynamically Typed Computations for Order-Sorted Equational Presentations.
J. Symb. Comput. 25(4): 455-526 (1998) |
| 1997 |
|---|
| 38 | | Claude Kirchner,
Christophe Ringeissen:
Higher-Order Equational Unification via Explicit Substitutions.
ALP/HOA 1997: 61-75 |
| 37 | | Farid Ajili,
Claude Kirchner:
A Modular Framework for the Combination of Unification and Built-In Constraints.
ICLP 1997: 331-345 |
| 1996 |
|---|
| 36 | | Ilies Alouini,
Claude Kirchner:
Toward the Concurrent Implementation of Computational Systems.
ALP 1996: 1-31 |
| 35 | | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner,
Frank Pfenning:
Unification via Explicit Substitutions: The Case of Higher-Order Patterns.
JICSLP 1996: 259-273 |
| 34 | | Claude Kirchner,
Christopher Lynch,
Christelle Scharff:
Fine-Grained Concurrent Completion.
RTA 1996: 3-17 |
| 33 | EE | Peter Borovanský,
Claude Kirchner,
Hélène Kirchner:
Controlling rewriting by rewriting.
Electr. Notes Theor. Comput. Sci. 4: (1996) |
| 32 | 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 |
|---|
| 31 | | Gilles Dowek,
Thérèse Hardin,
Claude Kirchner:
Higher-Order Unification via Explicit Substitutions (Extended Abstract)
LICS 1995: 366-374 |
| 30 | EE | Claude Kirchner:
Editorial.
Theor. Comput. Sci. 142(2): 139-140 (1995) |
| 1994 |
|---|
| 29 | | Claus Hintermeier,
Claude Kirchner,
Hélène Kirchner:
Sort Inheritance for Order-Sorted Equational Presentations.
COMPASS/ADT 1994: 319-335 |
| 28 | | Claus Hintermeier,
Claude Kirchner,
Hélène Kirchner:
Dynamically-Typed Computations for Order-Sorted Equational Presentations.
ICALP 1994: 450-461 |
| 1993 |
|---|
| 27 | | Claude Kirchner:
Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings
Springer 1993 |
| 26 | | Claude Kirchner,
Hélène Kirchner,
Marian Vittek:
Implementing Computational Systems with Constraints.
PPCP 1993: 156-165 |
| 1992 |
|---|
| 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 | | Mohamed Adi,
Claude Kirchner:
AC-Unification Race: The System Solving Approach, Implementation and Benchmarks.
J. Symb. Comput. 14(1): 51-70 (1992) |
| 1991 |
|---|
| 23 | | Jean-Pierre Jouannaud,
Claude Kirchner:
Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification.
Computational Logic - Essays in Honor of Alan Robinson 1991: 257-321 |
| 22 | | Miki Hermann,
Claude Kirchner,
Hélène Kirchner:
Implementations of Term Rewriting Systems.
Comput. J. 34(1): 20-33 (1991) |
| 21 | | Narjes Doggaz,
Claude Kirchner:
Completion for Unification.
Theor. Comput. Sci. 85(2): 231-251 (1991) |
| 1990 |
|---|
| 20 | | Claude Kirchner:
Tutorial on Equational Unification.
CADE 1990: 682 |
| 19 | | Mohamed Adi,
Claude Kirchner:
AC-Unification Race: The System Solving Approach And Its Implementation.
DISCO 1990: 174-183 |
| 18 | | Claude Kirchner,
Patrick Viry:
Implementing Parallel Rewriting.
Dagstuhl Seminar on Parallelization in Inference Systems 1990: 123-138 |
| 17 | | Claude Kirchner,
Francis Klay:
Syntactic Theories and Unification
LICS 1990: 270-277 |
| 16 | | Claude Kirchner,
Patrick Viry:
Implementing Parallel Rewriting.
PLILP 1990: 1-15 |
| 15 | | Isabelle Gnaedig,
Claude Kirchner,
Hélène Kirchner:
Equational Completion in Order-Sorted Algebras.
Theor. Comput. Sci. 72(2&3): 169-202 (1990) |
| 1989 |
|---|
| 14 | EE | Claude Kirchner,
Hélène Kirchner:
Constrained Equational Reasoning.
ISSAC 1989: 382-389 |
| 1988 |
|---|
| 13 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner,
Aristide Mégrelis:
OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization.
ALP 1988: 41-52 |
| 12 | | Isabelle Gnaedig,
Claude Kirchner,
Hélène Kirchner:
Equational Completion in Order-Sorted Algebras (Extended Abstract).
CAAP 1988: 165-184 |
| 11 | | Claude Kirchner,
Hélène Kirchner,
José Meseguer:
Operational Semantics of OBJ-3 (Extended Abstract).
ICALP 1988: 287-301 |
| 1987 |
|---|
| 10 | | 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 |
| 9 | | Claude Kirchner,
Pierre Lescanne:
Solving Disequations
LICS 1987: 347-352 |
| 8 | | 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 |
|---|
| 7 | | Joseph A. Goguen,
Claude Kirchner,
José Meseguer:
Concurrent term rewriting as a model of computation.
Graph Reduction 1986: 53-93 |
| 6 | | Claude Kirchner:
Computing Unification Algorithms
LICS 1986: 206-216 |
| 1985 |
|---|
| 5 | | 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 |
| 4 | | 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 |
|---|
| 3 | | Claude Kirchner:
A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm.
CADE 1984: 224-247 |
| 1983 |
|---|
| 2 | | Jean-Pierre Jouannaud,
Claude Kirchner,
Hélène Kirchner:
Incremental Construction of Unification Algorithms in Equational Theories.
ICALP 1983: 361-373 |
| 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 |
