Hélène Kirchner

Affiliations:
  • Inria


According to our database1, Hélène Kirchner authored at least 108 papers between 1981 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Strategic port graph rewriting: an interactive modelling framework.
Math. Struct. Comput. Sci., 2019

2018
Labelled graph strategic rewriting for social networks.
J. Log. Algebraic Methods Program., 2018

2017
Labelled Port Graph - A Formal Structure for Models and Computations.
Proceedings of the 12th Workshop on Logical and Semantic Frameworks, with Applications, 2017

PORGY : a Visual Analytics Platform for System Modelling and Analysis Based on Graph Rewriting.
Proceedings of the 17ème Journées Francophones Extraction et Gestion des Connaissances, 2017

2016
Labelled Graph Rewriting Meets Social Networks.
Proceedings of the Rewriting Logic and Its Applications - 11th International Workshop, 2016

2015
A Visual Analytics Approach to Compare Propagation Models in Social Networks.
Proceedings of the Proceedings Graphs as Models, 2015

Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk).
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Rewriting Strategies and Strategic Rewrite Programs.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

2014
Equational Logic and Rewriting.
Proceedings of the Computational Logic, 2014

Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework.
Proceedings of the Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, 2014

Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Secure interoperation design in multi-domains environments based on colored Petri nets.
Inf. Sci., 2013

A rewriting point of view on strategies
Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

Narrowing Based Inductive Proof Search.
Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2011
Formal Specification and Verification of Modular Security Policy Based on Colored Petri Nets.
IEEE Trans. Dependable Secur. Comput., 2011

Proving weak properties of rewriting.
Theor. Comput. Sci., 2011

Runtime Verification for Biochemical Programs.
Proceedings of the First Workshop on Hybrid Autonomous Systems, 2011

PORGY: Strategy-Driven Interactive Transformation of Graphs
Proceedings of the Proceedings 6th International Workshop on Computing with Terms and Graphs, 2011

A Strategy Language for Graph Rewriting.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Formal Specification and Validation of Security Policies.
Proceedings of the Foundations and Practice of Security, 2011

2010
Combination of convex theories: Modularity, deduction completeness, and explanation.
J. Symb. Comput., 2010

Semi-automatic Synthesis of Security Policies by Invariant-Guided Abduction.
Proceedings of the Formal Aspects of Security and Trust - 7th International Workshop, 2010

2009
Termination of rewriting under strategies.
ACM Trans. Comput. Log., 2009

Handling inheritance violation for secure interoperation of heterogeneous systems.
Int. J. Secur. Networks, 2009

A Port Graph Calculus for Autonomic Computing and Invariant Verification.
Proceedings of the Fifth International Workshop on Computing with Terms and Graphs, 2009

Extensional and Intensional Strategies
Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

Inductive proof search modulo.
Ann. Math. Artif. Intell., 2009

Constraint Based Strategies.
Proceedings of the Functional and Constraint Logic Programming, 2009

Policy Composition Based on Petri Nets.
Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, 2009

Component-Based Security Policy Design with Colored Petri Nets.
Proceedings of the Semantics and Algebraic Specification, 2009

A Higher-Order Graph Calculus for Autonomic Computing.
Proceedings of the Graph Theory, 2009

2008
Analysis of Rewrite-Based Access Control Policies.
Proceedings of the Third International Workshop on Security and Rewriting Techniques, 2008

2007
A Rewriting Calculus for Multigraphs with Ports.
Proceedings of the Eighth International Workshop on Rule Based Programming, 2007

Graph Rewriting and Strategies for Modeling Biochemical Networks.
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2007

Modular Access Control Via Strategic Rewriting.
Proceedings of the Computer Security, 2007

Weaving rewrite-based access control policies.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering, 2007

Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations.
Proceedings of the Rewriting, 2007

2006
Computing constructor forms with non terminating rewrite programs.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

Automatic Combinability of Rewriting-Based Satisfiability Procedures.
Proceedings of the Logic for Programming, 2006

Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application.
Proceedings of the Algebra, Meaning, and Computation, 2006

2005
Anchoring Modularity in HTML.
Proceedings of the International Workshop on Automated Specification and Verification of Web Sites, 2005

From Chemical Rules to Term Rewriting.
Proceedings of the 6th International Workshop on Rule-Based Programming, 2005

Termination of rewriting strategies: a generic approach
CoRR, 2005

On Superposition-Based Satisfiability Procedures and Their Combination.
Proceedings of the Theoretical Aspects of Computing, 2005

2004
A Proof of Weak Termination Providing the Right Way to Terminate.
Proceedings of the Theoretical Aspects of Computing, 2004

Rule-Based Programming and Proving: The ELAN Experience Outcomes.
Proceedings of the Advances in Computer Science, 2004

2003
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Simplification and termination of strategies in rule-based languages.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

Automated Generation of Kinetic Chemical Mechanisms Using Rewriting.
Proceedings of the Computational Science - ICCS 2003, 2003

Proof Search and Proof Check for Equational and Inductive Theorems.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
ELAN from a rewriting logic point of view.
Theor. Comput. Sci., 2002

CASL: the Common Algebraic Specification Language.
Theor. Comput. Sci., 2002

External Rewriting for Skeptical Proof Assistants.
J. Autom. Reason., 2002

Outermost ground termination.
Proceedings of the Fourth International Workshop on Rewriting logic and Its Applications, 2002

System Presentation -- CARIBOO: An induction based proof tool for termination with strategies.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

2001
Termination of Rewriting with Local Strategies.
Proceedings of the 4th International Workshop on Strategies in Automated Deduction, 2001

Algebraic Specifications, Higher-order Types and Set-theoretic Models.
J. Log. Comput., 2001

Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories.
J. Funct. Program., 2001

Rewriting with Strategies in ELAN: A Functional Semantics.
Int. J. Found. Comput. Sci., 2001

2000
Termination and normalisation under strategy Proofs in ELAN.
Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

Combining assisted and automated deduction.
Ann. Math. Artif. Intell., 2000

Editorial: Strategies in Automated Deduction.
Ann. Math. Artif. Intell., 2000

1999
Term Rewriting.
Proceedings of the Algebraic Foundations of Systems Specification, 1999

ELAN.
Proceedings of the JFPLC'99, 1999

Rule Based Programming with Constraints and Strategies.
Proceedings of the New Trends in Contraints, 1999

1998
Dynamically Typed Computations for Order-Sorted Equational Presentations.
J. Symb. Comput., 1998

Preface.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

An overview of ELAN.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

Non-deterministic Computations in ELAN.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1998

A Compiler for Rewrite Programs in Associative-Commutative Theories.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

A Functional View of Rewriting and Strategies for a Semantics of ELAN.
Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, 1998

1996
A reflective extension of ELAN.
Proceedings of the First International Workshop on Rewriting Logic and its Applications, 1996

ELAN: A logical framework based on computational systems.
Proceedings of the First International Workshop on Rewriting Logic and its Applications, 1996

Controlling rewriting by rewriting.
Proceedings of the First International Workshop on Rewriting Logic and its Applications, 1996

1995
Prototyping Completion with Constraints Using Computational Systems.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

R<sup>n</sup>- and G<sup>n</sup>-Logics.
Proceedings of the Higher-Order Algebra, 1995

Combining Algebraic and Set-Theoretic Specifications.
Proceedings of the Recent Trends in Data Type Specification, 1995

1994
On the Use of Constraints in Automated Deduction
Proceedings of the Constraint Programming: Basics and Trends, Châtillon Spring School, 1994

Combining Symbolic Constraint Solvers on Algebraic Domains.
J. Symb. Comput., 1994

Constraint Solving by Narrowing in Combined Algebraic Domains.
Proceedings of the Logic Programming, 1994

Sort Inheritance for Order-Sorted Equational Presentations.
Proceedings of the Recent Trends in Data Type Specification, 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, S. Margherita, Italy, May 30, 1994

1993
Implementing Computational Systems with Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1993

Some Extensions of Rewriting.
Proceedings of the Term Rewriting, 1993

1992
To Prof. Dr. Wolfgang Wechler.
Theor. Comput. Sci., 1992

Programming with Equalitiers, Subsorts, Overloading and Parametrization in OBJ.
J. Log. Program., 1992

The Term Rewriting Approach to Automated Theorem Proving.
J. Log. Program., 1992

A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms.
Proceedings of the Logic Programming, 1992

1991
Rewriting techniques and applications, RTA'91.
SIGACT News, 1991

Implementations of Term Rewriting Systems.
Comput. J., 1991

Proofs in Parameterized Specification.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Equational Completion in Order-Sorted Algebras.
Theor. Comput. Sci., 1990

Meta-rule Synthesis from Crossed Rewrite Systems.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

1989
Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes.
Theor. Comput. Sci., 1989

Constrained Equational Reasoning.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1988
Operational Semantics of OBJ-3 (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Equational Completion in Order-Sorted Algebras (Extended Abstract).
Proceedings of the CAAP '88, 1988

OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization.
Proceedings of the Algebraic and Logic Programming, 1988

1987
REVEUR-3: The Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies.
Sci. Comput. Program., 1987

Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

An Introduction to OBJ 3.
Proceedings of the Conditional Term Rewriting Systems, 1987

1986
Completion of a Set of Rules Modulo a Set of Equations.
SIAM J. Comput., 1986

1985
NARROWER: A New Algorithm for Unification and Its Application to Logic Programming.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies.
Proceedings of the EUROCAL '85, 1985

1984
Construction D'un Plus Petit Odre de Simplification.
RAIRO Theor. Informatics Appl., 1984

A General Inductive Completion Algorithm and Application to Abstract Data Types.
Proceedings of the 7th International Conference on Automated Deduction, 1984

1983
Church-Rosser Properties of Weakly Terminating Term Rewriting Systems.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

Incremental Construction of Unification Algorithms in Equational Theories.
Proceedings of the Automata, 1983

1981
Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981


  Loading...