Hélène Kirchner

Hejiao Huang, Hélène Kirchner: Secure interoperation design in multi-domains environments based on colored Petri nets. Inf. Sci. 221: 591-606 (2013)

Hélène Kirchner: A rewriting point of view on strategies. SR 2013: 99-105

Isabelle Gnaedig, Hélène Kirchner: Proving weak properties of rewriting. Theor. Comput. Sci. 412(34): 4405-4438 (2011)

Hejiao Huang, Hélène Kirchner: Formal Specification and Verification of Modular Security Policy Based on Colored Petri Nets. IEEE Trans. Dependable Sec. Comput. 8(6): 852-865 (2011)

Tony Bourdier, Horatiu Cirstea, Mathieu Jaume, Hélène Kirchner: Formal Specification and Validation of Security Policies. FPS 2011: 148-163

Maribel Fernández, Hélène Kirchner, Olivier Namet: A Strategy Language for Graph Rewriting. LOPSTR 2011: 173-188

Oana Andrei, Maribel Fernández, Hélène Kirchner, Guy Melançon, Olivier Namet, Bruno Pinaud: PORGY: Strategy-Driven Interactive Transformation of Graphs. TERMGRAPH 2011: 54-68

Duc-Khanh Tran, Christophe Ringeissen, Silvio Ranise, Hélène Kirchner: Combination of convex theories: Modularity, deduction completeness, and explanation. J. Symb. Comput. 45(2): 261-286 (2010)

Clément Hurlin, Hélène Kirchner: Semi-automatic Synthesis of Security Policies by Invariant-Guided Abduction. Formal Aspects in Security and Trust 2010: 157-175

Hélène Kirchner, César Muñoz (Eds.): Proceedings International Workshop on Strategies in Rewriting, Proving, and Programming. EPTCS 44, 2010

Fabrice Nahon, Claude Kirchner, Hélène Kirchner, Paul Brauner: Inductive proof search modulo. Ann. Math. Artif. Intell. 55(1-2): 123-154 (2009)

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)

Oana Andrei, Hélène Kirchner: A Port Graph Calculus for Autonomic Computing and Invariant Verification. Electr. Notes Theor. Comput. Sci. 253(4): 17-38 (2009)

Hejiao Huang, Hélène Kirchner, Songyun Liu, Weili Wu: Handling inheritance violation for secure interoperation of heterogeneous systems. IJSN 4(4): 223-233 (2009)

Isabelle Gnaedig, Hélène Kirchner: Termination of rewriting under strategies. ACM Trans. Comput. Log. 10(2) (2009)

Oana Andrei, Hélène Kirchner: A Higher-Order Graph Calculus for Autonomic Computing. Graph Theory, Computational Intelligence and Thought 2009: 15-26

Hejiao Huang, Hélène Kirchner: Component-Based Security Policy Design with Colored Petri Nets. Semantics and Algebraic Specification 2009: 21-42

Hejiao Huang, Hélène Kirchner: Policy Composition Based on Petri Nets. COMPSAC (2) 2009: 416-421

Claude Kirchner, Florent Kirchner, Hélène Kirchner: Constraint Based Strategies. WFLP 2009: 13-26

Tony Bourdier, Horatiu Cirstea, Daniel J. Dougherty, Hélène Kirchner: Extensional and Intensional Strategies. WRS 2009: 1-19

Oana Andrei, Hélène Kirchner: A Rewriting Calculus for Multigraphs with Ports. Electr. Notes Theor. Comput. Sci. 219: 67-82 (2008)

Isabelle Gnaedig, Hélène Kirchner: Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. Rewriting, Computation and Proof 2007: 44-67

Anderson Santana de Oliveira, Eric Ke Wang, Claude Kirchner, Hélène Kirchner: Weaving rewrite-based access control policies. FMSE 2007: 71-80

Daniel J. Dougherty, Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira: Modular Access Control Via Strategic Rewriting. ESORICS 2007: 578-593

Oana Andrei, Hélène Kirchner: Graph Rewriting and Strategies for Modeling Biochemical Networks. SYNASC 2007: 407-414

Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner (Eds.): Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 4600, Springer 2007, isbn 978-3-540-73146-7

Olivier Bournez, Liliana Ibanescu, Hélène Kirchner: From Chemical Rules to Term Rewriting. Electr. Notes Theor. Comput. Sci. 147(1): 113-134 (2006)

Claude Kirchner, Hélène Kirchner, Anderson Santana: Anchoring Modularity in HTML. Electr. Notes Theor. Comput. Sci. 157(2): 133-146 (2006)

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

Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran: Automatic Combinability of Rewriting-Based Satisfiability Procedures. LPAR 2006: 542-556

Isabelle Gnaedig, Hélène Kirchner: Computing constructor forms with non terminating rewrite programs. PPDP 2006: 121-132

Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran: On Superposition-Based Satisfiability Procedures and Their Combination. ICTAC 2005: 594-608

Claude Kirchner, Hélène Kirchner, Anderson Santana: Anchoring modularity in HTML. WWV 2005: 139-151

Isabelle Gnaedig, Hélène Kirchner: Termination of rewriting strategies: a generic approach. CoRR abs/cs/0507064 (2005)

Claude Kirchner, Hélène Kirchner: Rule-Based Programming and Proving: The ELAN Experience Outcomes. ASIAN 2004: 363-379

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner: A Proof of Weak Termination Providing the Right Way to Terminate. ICTAC 2004: 356-371

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

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

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner: Simplification and termination of strategies in rule-based languages. PPDP 2003: 124-135

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

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner: Outermost ground termination. Electr. Notes Theor. Comput. Sci. 71: 188-207 (2002)

Quang Huy Nguyen, Claude Kirchner, Hélène Kirchner: External Rewriting for Skeptical Proof Assistants. J. Autom. Reasoning 29(3-4): 309-336 (2002)

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)

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)

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner: System Presentation -- CARIBOO: An induction based proof tool for termination with strategies. PPDP 2002: 62-73

Hélène Kirchner, Christophe Ringeissen (Eds.): Algebraic Methodology and Software Technology, 9th International Conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9-13, 2002, Proceedings. Lecture Notes in Computer Science 2422, Springer 2002, isbn 3-540-44144-1

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)

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)

Hélène Kirchner, Peter D. Mosses: Algebraic Specifications, Higher-order Types and Set-theoretic Models. J. Log. Comput. 11(3): 453-481 (2001)

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner: Termination of Rewriting with Local Strategies. Electr. Notes Theor. Comput. Sci. 58(2): 155-188 (2001)

Hélène Kirchner: Combining assisted and automated deduction. Ann. Math. Artif. Intell. 28(1-4): 21-26 (2000)

Bernhard Gramlich, Hélène Kirchner, Frank Pfenning: Editorial: Strategies in Automated Deduction. Ann. Math. Artif. Intell. 29(1-4): 0- (2000)

Hélène Kirchner, Isabelle Gnaedig: Termination and normalisation under strategy Proofs in ELAN. Electr. Notes Theor. Comput. Sci. 36: 93-120 (2000)

Hélène Kirchner, Christophe Ringeissen (Eds.): Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings. Lecture Notes in Computer Science 1794, Springer 2000, isbn 3-540-67281-8

Hubert Dubois, Hélène Kirchner: Rule Based Programming with Constraints and Strategies. New Trends in Constraints 1999: 274-297

Hélène Kirchner: ELAN. JFPLC 1999: 241-248

Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Christophe Ringeissen: An overview of ELAN. Electr. Notes Theor. Comput. Sci. 15: 55-70 (1998)

Claude Kirchner, Hélène Kirchner: Preface. Electr. Notes Theor. Comput. Sci. 15: 367-368 (1998)

Claus Hintermeier, Claude Kirchner, Hélène Kirchner: Dynamically Typed Computations for Order-Sorted Equational Presentations. J. Symb. Comput. 25(4): 455-526 (1998)

Hélène Kirchner, Peter D. Mosses: Algebraic Specifications, Higher-Order Types, and Set-Theoretic Models. AMAST 1998: 373-388

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

Pierre-Etienne Moreau, Hélène Kirchner: A Compiler for Rewrite Programs in Associative-Commutative Theories. PLILP/ALP 1998: 230-249

Hélène Kirchner, Pierre-Etienne Moreau: Non-deterministic Computations in ELAN. WADT 1998: 168-182

Claude Kirchner, Hélène Kirchner (Eds.): Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings. Lecture Notes in Computer Science 1421, Springer 1998, isbn 3-540-64675-2

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: 35-50 (1996)

Hélène Kirchner, Pierre-Etienne Moreau: A reflective extension of ELAN. Electr. Notes Theor. Comput. Sci. 4: 149-168 (1996)

Peter Borovanský, Claude Kirchner, Hélène Kirchner: Controlling rewriting by rewriting. Electr. Notes Theor. Comput. Sci. 4: 169-189 (1996)

Hélène Kirchner (Ed.): Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, Linköping, Sweden, April, 22-24, 1996, Proceedings. Lecture Notes in Computer Science 1059, Springer 1996, isbn 3-540-61064-2

Claus Hintermeier, Hélène Kirchner, Peter D. Mosses: Combining Algebraic and Set-Theoretic Specifications. COMPASS/ADT 1995: 255-273

Claus Hintermeier, Hélène Kirchner, Peter D. Mosses: Rⁿ- and Gⁿ-Logics. HOA 1995: 90-108

Hélène Kirchner, Pierre-Etienne Moreau: Prototyping Completion with Constraints Using Computational Systems. RTA 1995: 438-443

Hélène Kirchner, Christophe Ringeissen: Combining Symbolic Constraint Solvers on Algebraic Domains. J. Symb. Comput. 18(2): 113-155 (1994)

Claus Hintermeier, Claude Kirchner, Hélène Kirchner: Sort Inheritance for Order-Sorted Equational Presentations. COMPASS/ADT 1994: 319-335

Claus Hintermeier, Claude Kirchner, Hélène Kirchner: Dynamically-Typed Computations for Order-Sorted Equational Presentations. ICALP 1994: 450-461

Hélène Kirchner, Christophe Ringeissen: Constraint Solving by Narrowing in Combined Algebraic Domains. ICLP 1994: 617-631

Hélène Kirchner: On the Use of Constraints in Automated Deduction. Constraint Programming 1994: 128-146

Hélène Kirchner: Some Extensions of Rewriting. Term Rewriting 1993: 54-73

Claude Kirchner, Hélène Kirchner, Marian Vittek: Implementing Computational Systems with Constraints. PPCP 1993: 156-165

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)

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)

Hélène Kirchner: To Prof. Dr. Wolfgang Wechler. Theor. Comput. Sci. 105(1): 4-5 (1992)

Hélène Kirchner, Christophe Ringeissen: A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms. JICSLP 1992: 225-239

Hélène Kirchner, Giorgio Levi (Eds.): Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings. Lecture Notes in Computer Science 632, Springer 1992, isbn 3-540-55873-X

Miki Hermann, Claude Kirchner, Hélène Kirchner: Implementations of Term Rewriting Systems. Comput. J. 34(1): 20-33 (1991)

Hélène Kirchner: Proofs in Parameterized Specification. RTA 1991: 174-187

Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner: Equational Completion in Order-Sorted Algebras. Theor. Comput. Sci. 72(2&3): 169-202 (1990)

Hélène Kirchner, Miki Hermann: Meta-rule Synthesis from Crossed Rewrite Systems. CTRS 1990: 143-154

Hélène Kirchner, Wolfgang Wechler (Eds.): Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings. Lecture Notes in Computer Science 463, Springer 1990, isbn 3-540-53162-9

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)

Claude Kirchner, Hélène Kirchner: Constrained Equational Reasoning. ISSAC 1989: 382-389

Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis: OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization. ALP 1988: 41-52

Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner: Equational Completion in Order-Sorted Algebras (Extended Abstract). CAAP 1988: 165-184

Claude Kirchner, Hélène Kirchner, José Meseguer: Operational Semantics of OBJ-3 (Extended Abstract). ICALP 1988: 287-301

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)

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

Hélène Kirchner: Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes. RTA 1987: 180-191

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)

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

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

Jean-Pierre Jouannaud, Hélène Kirchner: Construction D'un Plus Petit Odre de Simplification. ITA 18(3): 191-208 (1984)

Hélène Kirchner: A General Inductive Completion Algorithm and Application to Abstract Data Types. CADE 1984: 282-302

Jean-Pierre Jouannaud, Hélène Kirchner: Completion of a Set of Rules Modulo a Set of Equations. POPL 1984: 83-92

Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner: Incremental Construction of Unification Algorithms in Equational Theories. ICALP 1983: 361-373

Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Remy: Church-Rosser Properties of Weakly Terminating Term Rewriting Systems. IJCAI 1983: 909-915

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