| Publication | Date of Publication | Type |
|---|
| Meta-rule synthesis from crossed rewrite systems | 2023-03-09 | Paper |
| Proofs in parameterized specifications | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3388749 | 2021-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964704 | 2021-03-03 | Paper |
| Labelled port graph -- a formal structure for models and computations | 2019-11-12 | Paper |
| Dynamically-typed computations for order-sorted equational presentations | 2019-04-29 | Paper |
| Strategic port graph rewriting: an interactive modelling framework | 2019-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4619820 | 2019-02-07 | Paper |
| R n - and G n -logics | 2019-01-11 | Paper |
| Labelled graph strategic rewriting for social networks | 2018-04-06 | Paper |
| Port Graphs, Rules and Strategies for Dynamic Data Analytics - Extended Abstract (Invited Talk) | 2017-07-12 | Paper |
| Labelled Graph Rewriting Meets Social Networks | 2016-10-21 | Paper |
| Runtime verification for biochemical programs | 2016-04-19 | Paper |
| Termination of rewriting under strategies | 2015-09-17 | Paper |
| Rewriting Strategies and Strategic Rewrite Programs | 2015-09-14 | Paper |
| REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS | 2015-04-30 | Paper |
| Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY | 2015-02-25 | Paper |
| Secure interoperation design in multi-domains environments based on colored Petri nets | 2014-08-01 | Paper |
| A Port Graph Calculus for Autonomic Computing and Invariant Verification | 2014-07-23 | Paper |
| A Rewriting Calculus for Multigraphs with Ports | 2014-05-13 | Paper |
| From chemical rules to term rewriting | 2013-12-04 | Paper |
| Outermost ground termination | 2013-10-02 | Paper |
| Induction for termination with local strategies | 2013-07-24 | Paper |
| Narrowing Based Inductive Proof Search | 2013-04-19 | Paper |
| A Strategy Language for Graph Rewriting | 2013-03-13 | Paper |
| Formal Specification and Validation of Security Policies | 2012-06-08 | Paper |
| Proving weak properties of rewriting | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086785 | 2011-03-30 | Paper |
| Constraint Based Strategies | 2010-04-27 | Paper |
| Automated Deduction – CADE-19 | 2010-04-20 | Paper |
| A Higher-Order Graph Calculus for Autonomic Computing | 2010-01-07 | Paper |
| Combination of convex theories: modularity, deduction completeness, and explanation | 2009-12-03 | Paper |
| Inductive proof search modulo | 2009-11-16 | Paper |
| Component-Based Security Policy Design with Colored Petri Nets | 2009-10-22 | Paper |
| Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations | 2009-03-06 | Paper |
| Automatic Combinability of Rewriting-Based Satisfiability Procedures | 2008-05-27 | Paper |
| Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application | 2007-09-07 | Paper |
| Theoretical Aspects of Computing – ICTAC 2005 | 2006-11-01 | Paper |
| Theoretical Aspects of Computing - ICTAC 2004 | 2005-11-30 | Paper |
| Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447221 | 2004-02-16 | Paper |
| External rewriting for skeptical proof assistants | 2003-04-27 | Paper |
| CASL: the Common Algebraic Specification Language. | 2003-01-21 | Paper |
| ELAN from a rewriting logic point of view | 2002-08-13 | Paper |
| Combining assisted and automated deduction | 2002-06-27 | Paper |
| Algebraic specifications, higher-order types and set-theoretic models | 2001-10-16 | Paper |
| Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories | 2001-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4702599 | 2001-05-20 | Paper |
| Termination and normalisation under strategy proofs in ELAN | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939289 | 2000-07-20 | Paper |
| Dynamically typed computations for order-sorted equational presentations | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223001 | 1999-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222851 | 1998-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222858 | 1998-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222857 | 1998-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400884 | 1998-01-01 | Paper |
| Combining symbolic constraint solvers on algebraic domains | 1994-12-18 | Paper |
| The term rewriting approach to automated theorem proving | 1992-11-10 | Paper |
| Programming with equalities, subsorts, overloading, and parametrization in OBJ | 1992-08-13 | Paper |
| Equational completion in order-sorted algebras | 1990-01-01 | Paper |
| Schematization of infinite sets of rewrite rules generated by divergent completion processes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490927 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795207 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817573 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792234 | 1988-01-01 | Paper |
| REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805889 | 1987-01-01 | Paper |
| Completion of a Set of Rules Modulo a Set of Equations | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696486 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338226 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3664457 | 1983-01-01 | Paper |
