The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hélène Kirchner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. A Higher-Order Graph Calculus for Autonomic Computing. [Citation Graph (, )][DBLP]


  76. Component-Based Security Policy Design with Colored Petri Nets. [Citation Graph (, )][DBLP]


  77. Weaving rewrite-based access control policies. [Citation Graph (, )][DBLP]


  78. Policy Composition Based on Petri Nets. [Citation Graph (, )][DBLP]


  79. Constraint Based Strategies. [Citation Graph (, )][DBLP]


  80. Graph Rewriting and Strategies for Modeling Biochemical Networks. [Citation Graph (, )][DBLP]


  81. Inductive proof search modulo. [Citation Graph (, )][DBLP]


  82. Termination of rewriting strategies: a generic approach [Citation Graph (, )][DBLP]


  83. Extensional and Intensional Strategies [Citation Graph (, )][DBLP]


  84. A Rewriting Calculus for Multigraphs with Ports. [Citation Graph (, )][DBLP]


  85. Analysis of Rewrite-Based Access Control Policies. [Citation Graph (, )][DBLP]


  86. A Port Graph Calculus for Autonomic Computing and Invariant Verification. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.046secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002