Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHélène Kirchner
Person information
- affiliation: Inria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j29]Maribel Fernández
, Hélène Kirchner, Bruno Pinaud:
Strategic port graph rewriting: an interactive modelling framework. Math. Struct. Comput. Sci. 29(5): 615-662 (2019)- 2018
- [j28]Maribel Fernández, Hélène Kirchner, Bruno Pinaud, Jason Vallet:
Labelled graph strategic rewriting for social networks. J. Log. Algebraic Methods Program. 96: 12-40 (2018) - [e10]Hélène Kirchner:
3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK. LIPIcs 108, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-077-4 [contents] - 2017
- [c80]Bruno Pinaud, Oana Andrei, Maribel Fernández, Hélène Kirchner, Guy Melançon, Jason Vallet:
PORGY : a Visual Analytics Platform for System Modelling and Analysis Based on Graph Rewriting. EGC 2017: 473-476 - [c79]Maribel Fernández, Hélène Kirchner, Bruno Pinaud:
Labelled Port Graph - A Formal Structure for Models and Computations. LSFA 2017: 3-21 - 2016
- [c78]Maribel Fernández, Hélène Kirchner, Bruno Pinaud, Jason Vallet:
Labelled Graph Rewriting Meets Social Networks. WRLA 2016: 1-25 - 2015
- [c77]Hélène Kirchner:
Rewriting Strategies and Strategic Rewrite Programs. Logic, Rewriting, and Concurrency 2015: 380-403 - [c76]Hélène Kirchner:
Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk). RTA 2015: 1-4 - [c75]Jason Vallet, Hélène Kirchner, Bruno Pinaud, Guy Melançon:
A Visual Analytics Approach to Compare Propagation Models in Social Networks. GaM 2015: 65-79 - 2014
- [c74]Maribel Fernández, Hélène Kirchner, Ian Mackie, Bruno Pinaud:
Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY. CiE 2014: 183-193 - [c73]Maribel Fernández, Hélène Kirchner, Bruno Pinaud:
Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework. GRAPHITE 2014: 15-29 - [r1]Claude Kirchner, Hélène Kirchner:
Equational Logic and Rewriting. Computational Logic 2014: 255-282 - 2013
- [j27]Hejiao Huang, Hélène Kirchner:
Secure interoperation design in multi-domains environments based on colored Petri nets. Inf. Sci. 221: 591-606 (2013) - [c72]Claude Kirchner, Hélène Kirchner, Fabrice Nahon:
Narrowing Based Inductive Proof Search. Programming Logics 2013: 216-238 - [c71]Hélène Kirchner:
A rewriting point of view on strategies. SR 2013: 99-105 - 2011
- [j26]Isabelle Gnaedig, Hélène Kirchner:
Proving weak properties of rewriting. Theor. Comput. Sci. 412(34): 4405-4438 (2011) - [j25]Hejiao Huang, Hélène Kirchner:
Formal Specification and Verification of Modular Security Policy Based on Colored Petri Nets. IEEE Trans. Dependable Secur. Comput. 8(6): 852-865 (2011) - [c70]Tony Bourdier, Horatiu Cirstea, Mathieu Jaume, Hélène Kirchner:
Formal Specification and Validation of Security Policies. FPS 2011: 148-163 - [c69]Maribel Fernández, Hélène Kirchner, Olivier Namet:
A Strategy Language for Graph Rewriting. LOPSTR 2011: 173-188 - [c68]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 - [c67]Oana Andrei, Hélène Kirchner:
Runtime Verification for Biochemical Programs. Hybrid Autonomous Systems@ETAPS 2011: 27-46 - 2010
- [j24]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) - [c66]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 - [e9]Hélène Kirchner, César A. Muñoz:
Proceedings International Workshop on Strategies in Rewriting, Proving, and Programming, IWS 2010, Edinburgh, UK, 9th July 2010. EPTCS 44, 2010 [contents]
2000 – 2009
- 2009
- [j23]Fabrice Nahon, Claude Kirchner, Hélène Kirchner, Paul Brauner:
Inductive proof search modulo. Ann. Math. Artif. Intell. 55(1-2): 123-154 (2009) - [j22]Hejiao Huang, Hélène Kirchner, Songyun Liu, Weili Wu:
Handling inheritance violation for secure interoperation of heterogeneous systems. Int. J. Secur. Networks 4(4): 223-233 (2009) - [j21]Isabelle Gnaedig, Hélène Kirchner:
Termination of rewriting under strategies. ACM Trans. Comput. Log. 10(2): 10:1-10:52 (2009) - [c65]Oana Andrei, Hélène Kirchner:
A Higher-Order Graph Calculus for Autonomic Computing. Graph Theory, Computational Intelligence and Thought 2009: 15-26 - [c64]Hejiao Huang, Hélène Kirchner:
Component-Based Security Policy Design with Colored Petri Nets. Semantics and Algebraic Specification 2009: 21-42 - [c63]Hejiao Huang, Hélène Kirchner:
Policy Composition Based on Petri Nets. COMPSAC (2) 2009: 416-421 - [c62]Claude Kirchner, Florent Kirchner, Hélène Kirchner:
Constraint Based Strategies. WFLP 2009: 13-26 - [c61]Tony Bourdier, Horatiu Cirstea, Daniel J. Dougherty, Hélène Kirchner:
Extensional and Intensional Strategies. WRS 2009: 1-19 - [c60]Oana Andrei, Hélène Kirchner:
A Port Graph Calculus for Autonomic Computing and Invariant Verification. TERMGRAPH@ETAPS 2009: 17-38 - 2008
- [c59]Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira:
Analysis of Rewrite-Based Access Control Policies. SecReT@LICS/CSF 2008: 55-75 - 2007
- [c58]Isabelle Gnaedig, Hélène Kirchner:
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. Rewriting, Computation and Proof 2007: 44-67 - [c57]Anderson Santana de Oliveira, Eric Ke Wang, Claude Kirchner, Hélène Kirchner:
Weaving rewrite-based access control policies. FMSE 2007: 71-80 - [c56]Daniel J. Dougherty, Claude Kirchner, Hélène Kirchner, Anderson Santana de Oliveira:
Modular Access Control Via Strategic Rewriting. ESORICS 2007: 578-593 - [c55]Oana Andrei, Hélène Kirchner:
Graph Rewriting and Strategies for Modeling Biochemical Networks. SYNASC 2007: 407-414 - [c54]Oana Andrei, Hélène Kirchner:
A Rewriting Calculus for Multigraphs with Ports. RULE@RDP 2007: 67-82 - [e8]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. Lecture Notes in Computer Science 4600, Springer 2007, ISBN 978-3-540-73146-7 [contents] - 2006
- [c53]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 - [c52]Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Automatic Combinability of Rewriting-Based Satisfiability Procedures. LPAR 2006: 542-556 - [c51]Isabelle Gnaedig, Hélène Kirchner:
Computing constructor forms with non terminating rewrite programs. PPDP 2006: 121-132 - 2005
- [c50]Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
On Superposition-Based Satisfiability Procedures and Their Combination. ICTAC 2005: 594-608 - [c49]Claude Kirchner, Hélène Kirchner, Anderson Santana:
Anchoring modularity in HTML. WWV 2005: 139-151 - [c48]Olivier Bournez, Liliana Ibanescu, Hélène Kirchner:
From Chemical Rules to Term Rewriting. RULE@RDP 2005: 113-134 - [c47]Claude Kirchner, Hélène Kirchner, Anderson Santana:
Anchoring Modularity in HTML. WWV 2005: 133-146 - [i1]Isabelle Gnaedig, Hélène Kirchner:
Termination of rewriting strategies: a generic approach. CoRR abs/cs/0507064 (2005) - 2004
- [c46]Claude Kirchner, Hélène Kirchner:
Rule-Based Programming and Proving: The ELAN Experience Outcomes. ASIAN 2004: 363-379 - [c45]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
A Proof of Weak Termination Providing the Right Way to Terminate. ICTAC 2004: 356-371 - 2003
- [c44]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 - [c43]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 - [c42]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Simplification and termination of strategies in rule-based languages. PPDP 2003: 124-135 - [c41]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
- [j20]Quang Huy Nguyen, Claude Kirchner, Hélène Kirchner:
External Rewriting for Skeptical Proof Assistants. J. Autom. Reason. 29(3-4): 309-336 (2002) - [j19]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) - [j18]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) - [c40]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies. PPDP 2002: 62-73 - [c39]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Outermost ground termination. WRLA 2002: 188-207 - [e7]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. Lecture Notes in Computer Science 2422, Springer 2002, ISBN 3-540-44144-1 [contents] - 2001
- [j17]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) - [j16]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) - [j15]Hélène Kirchner, Peter D. Mosses:
Algebraic Specifications, Higher-order Types and Set-theoretic Models. J. Log. Comput. 11(3): 453-481 (2001) - [c38]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Termination of Rewriting with Local Strategies. STRATEGIES@IJCAR 2001: 155-188 - 2000
- [j14]Hélène Kirchner:
Combining assisted and automated deduction. Ann. Math. Artif. Intell. 28(1-4): 21-26 (2000) - [j13]Bernhard Gramlich, Hélène Kirchner, Frank Pfenning:
Editorial: Strategies in Automated Deduction. Ann. Math. Artif. Intell. 29(1-4) (2000) - [c37]Hélène Kirchner, Isabelle Gnaedig:
Termination and normalisation under strategy Proofs in ELAN. WRLA 2000: 93-120 - [e6]Hélène Kirchner, Christophe Ringeissen:
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 [contents]
1990 – 1999
- 1999
- [c36]Hubert Dubois, Hélène Kirchner:
Rule Based Programming with Constraints and Strategies. New Trends in Constraints 1999: 274-297 - [c35]Hélène Kirchner:
ELAN. JFPLC 1999: 241-248 - [p1]Hélène Kirchner:
Term Rewriting. Algebraic Foundations of Systems Specification 1999: 273-320 - 1998
- [j12]Claus Hintermeier, Claude Kirchner, Hélène Kirchner:
Dynamically Typed Computations for Order-Sorted Equational Presentations. J. Symb. Comput. 25(4): 455-526 (1998) - [c34]Hélène Kirchner, Peter D. Mosses:
Algebraic Specifications, Higher-Order Types, and Set-Theoretic Models. AMAST 1998: 373-388 - [c33]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 - [c32]Pierre-Etienne Moreau, Hélène Kirchner:
A Compiler for Rewrite Programs in Associative-Commutative Theories. PLILP/ALP 1998: 230-249 - [c31]Hélène Kirchner, Pierre-Etienne Moreau:
Non-deterministic Computations in ELAN. WADT 1998: 168-182 - [c30]Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Christophe Ringeissen:
An overview of ELAN. WRLA 1998: 55-70 - [c29]Claude Kirchner, Hélène Kirchner:
Preface. WRLA 1998: 367-368 - [e5]Claude Kirchner, Hélène Kirchner:
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 [contents] - [e4]Claude Kirchner, Hélène Kirchner:
1998 International Workshop on Rewriting Logic and its Applications, WRLA 1998, Abbaye des Prémontrés at Pont-à-Mousson, France, September 1998. Electronic Notes in Theoretical Computer Science 15, Elsevier 1998 [contents] - 1996
- [c28]Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Marian Vittek:
ELAN: A logical framework based on computational systems. WRLA 1996: 35-50 - [c27]Hélène Kirchner, Pierre-Etienne Moreau:
A reflective extension of ELAN. WRLA 1996: 149-168 - [c26]Peter Borovanský, Claude Kirchner, Hélène Kirchner:
Controlling rewriting by rewriting. WRLA 1996: 169-189 - [e3]Hélène Kirchner:
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 [contents] - 1995
- [c25]Claus Hintermeier, Hélène Kirchner, Peter D. Mosses:
Combining Algebraic and Set-Theoretic Specifications. COMPASS/ADT 1995: 255-273 - [c24]Claus Hintermeier, Hélène Kirchner, Peter D. Mosses:
Rn- and Gn-Logics. HOA 1995: 90-108 - [c23]Hélène Kirchner, Pierre-Etienne Moreau:
Prototyping Completion with Constraints Using Computational Systems. RTA 1995: 438-443 - 1994
- [j11]Hélène Kirchner, Christophe Ringeissen:
Combining Symbolic Constraint Solvers on Algebraic Domains. J. Symb. Comput. 18(2): 113-155 (1994) - [c22]Claus Hintermeier, Claude Kirchner, Hélène Kirchner:
Sort Inheritance for Order-Sorted Equational Presentations. COMPASS/ADT 1994: 319-335 - [c21]Claus Hintermeier, Claude Kirchner, Hélène Kirchner:
Dynamically-Typed Computations for Order-Sorted Equational Presentations. ICALP 1994: 450-461 - [c20]Hélène Kirchner, Christophe Ringeissen:
Constraint Solving by Narrowing in Combined Algebraic Domains. ICLP 1994: 617-631 - [c19]Hélène Kirchner:
On the Use of Constraints in Automated Deduction. Constraint Programming 1994: 128-146 - 1993
- [c18]Hélène Kirchner:
Some Extensions of Rewriting. Term Rewriting 1993: 54-73 - [c17]Claude Kirchner, Hélène Kirchner, Marian Vittek:
Implementing Computational Systems with Constraints. PPCP 1993: 156-165 - 1992
- [j10]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) - [j9]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) - [j8]Hélène Kirchner:
To Prof. Dr. Wolfgang Wechler. Theor. Comput. Sci. 105(1): 4-5 (1992) - [c16]Hélène Kirchner, Christophe Ringeissen:
A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms. JICSLP 1992: 225-239 - [e2]Hélène Kirchner, Giorgio Levi:
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 [contents] - 1991
- [j7]Miki Hermann, Claude Kirchner, Hélène Kirchner:
Implementations of Term Rewriting Systems. Comput. J. 34(1): 20-33 (1991) - [j6]Hélène Kirchner, Pierre Lescanne:
Rewriting techniques and applications, RTA'91. SIGACT News 22(3): 24-30 (1991) - [c15]Hélène Kirchner:
Proofs in Parameterized Specification. RTA 1991: 174-187 - 1990
- [j5]Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:
Equational Completion in Order-Sorted Algebras. Theor. Comput. Sci. 72(2&3): 169-202 (1990) - [c14]Hélène Kirchner, Miki Hermann:
Meta-rule Synthesis from Crossed Rewrite Systems. CTRS 1990: 143-154 - [e1]Hélène Kirchner, Wolfgang Wechler:
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 [contents]
1980 – 1989
- 1989
- [j4]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) - [c13]Claude Kirchner, Hélène Kirchner:
Constrained Equational Reasoning. ISSAC 1989: 382-389 - 1988
- [c12]Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis:
OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization. ALP 1988: 41-52 - [c11]Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:
Equational Completion in Order-Sorted Algebras (Extended Abstract). CAAP 1988: 165-184 - [c10]Claude Kirchner, Hélène Kirchner, José Meseguer:
Operational Semantics of OBJ-3 (Extended Abstract). ICALP 1988: 287-301 - 1987
- [j3]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) - [c9]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 - [c8]Hélène Kirchner:
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes. RTA 1987: 180-191 - 1986
- [j2]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
- [c7]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 - [c6]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
- [j1]Jean-Pierre Jouannaud, Hélène Kirchner:
Construction D'un Plus Petit Odre de Simplification. RAIRO Theor. Informatics Appl. 18(3): 191-208 (1984) - [c5]Hélène Kirchner:
A General Inductive Completion Algorithm and Application to Abstract Data Types. CADE 1984: 282-302 - [c4]Jean-Pierre Jouannaud, Hélène Kirchner:
Completion of a Set of Rules Modulo a Set of Equations. POPL 1984: 83-92 - 1983
- [c3]Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner:
Incremental Construction of Unification Algorithms in Equational Theories. ICALP 1983: 361-373 - [c2]Jean-Pierre Jouannaud, Hélène Kirchner, Jean-Luc Rémy:
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems. IJCAI 1983: 909-915 - 1981
- [c1]