| Publication | Date of Publication | Type |
|---|
| Checking in polynomial time whether or not a regular tree language is deterministic top-down | 2024-03-26 | Paper |
| Functionality of compositions of top-down tree transducers is decidable | 2024-01-18 | Paper |
| On the Balancedness of Tree-to-Word Transducers | 2023-08-15 | Paper |
| Definability Results for Top-Down Tree Transducers | 2023-08-15 | Paper |
| How to decide functionality of compositions of top-down tree transducers | 2023-07-26 | Paper |
| Deciding origin equivalence of weakly self-nesting macro tree transducers | 2023-01-30 | Paper |
| When is a functional tree transduction deterministic? | 2022-11-02 | Paper |
| Equivalence of Linear Tree Transducers with Output in the Free Group | 2022-10-13 | Paper |
| On the Balancedness of Tree-to-Word Transducers | 2022-10-13 | Paper |
| Deciding equivalence of finite tree automata | 2022-08-16 | Paper |
| Three improvements to the top-down solver | 2022-06-24 | Paper |
| Improving thread-modular abstract interpretation | 2022-06-17 | Paper |
| Definability results for top-down tree transducers | 2022-03-25 | Paper |
| An even faster solver for general systems of equations | 2022-02-16 | Paper |
| Stratified guarded first-order transition systems | 2021-10-18 | Paper |
| Counterexample- and simulation-guided floating-point loop invariant synthesis | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304147 | 2020-08-05 | Paper |
| Incremental Abstract Interpretation | 2020-07-20 | Paper |
| Deciding equivalence of separated non-nested attribute systems in polynomial time | 2020-01-28 | Paper |
| Least solutions of equations over N | 2019-04-29 | Paper |
| Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable | 2018-12-06 | Paper |
| Paths, tree homomorphisms and disequalities for -clauses | 2018-10-25 | Paper |
| Enforcing termination of interprocedural analysis | 2018-10-04 | Paper |
| Enforcing termination of interprocedural analysis | 2018-08-27 | Paper |
| Balancedness of MSO transductions in polynomial time | 2018-03-16 | Paper |
| Flat and one-variable clauses | 2017-07-12 | Paper |
| Inter-procedural Two-Variable Herbrand Equalities | 2017-05-16 | Paper |
| Reachability for Dynamic Parametric Processes | 2017-02-21 | Paper |
| Inter-procedural Two-Variable Herbrand Equalities | 2016-04-26 | Paper |
| Enhancing Top-Down Solving with Widening and Narrowing | 2016-03-23 | Paper |
| Look-ahead removal for total deterministic top-down tree transducers | 2016-01-21 | Paper |
| Precise interprocedural analysis through linear algebra | 2015-11-11 | Paper |
| On optimal slicing of parallel programs | 2015-02-27 | Paper |
| Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs | 2015-01-13 | Paper |
| How to Remove the Look-Ahead of Top-Down Tree Transducers | 2014-10-14 | Paper |
| Numerical invariants through convex relaxation and max-strategy iteration | 2014-06-30 | Paper |
| Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol | 2014-04-10 | Paper |
| Interprocedural Information Flow Analysis of XML Processors | 2014-03-31 | Paper |
| Cryptographic Analysis in Cubic Time | 2013-07-24 | Paper |
| Extending \(H_1\)-clauses with disequalities | 2013-04-04 | Paper |
| Type Checking of Tree Walking Transducers | 2013-02-26 | Paper |
| Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses | 2012-09-20 | Paper |
| EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS | 2012-08-29 | Paper |
| Abstract interpretation meets convex optimization | 2012-07-13 | Paper |
| Extending ${\cal H}_1$ -Clauses with Path Disequalities | 2012-06-22 | Paper |
| Model Checking Information Flow in Reactive Systems | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3092707 | 2011-09-20 | Paper |
| Compiler Design | 2011-06-23 | Paper |
| Normalization of Linear Horn Clauses | 2011-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086934 | 2011-03-30 | Paper |
| Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation | 2011-02-15 | Paper |
| Compiler Design | 2011-02-14 | Paper |
| Bottom-Up Tree Automata with Term Constraints | 2010-10-12 | Paper |
| Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely | 2010-10-01 | Paper |
| Verifying a Local Generic Solver in Coq | 2010-10-01 | Paper |
| Compiler Design | 2010-09-28 | Paper |
| What Is a Pure Functional? | 2010-09-07 | Paper |
| Minimization of Deterministic Bottom-Up Tree Transducers | 2010-08-31 | Paper |
| Übersetzerbau | 2010-01-21 | Paper |
| Shape Analysis of Low-Level C with Overlapping Structures | 2010-01-14 | Paper |
| Polynomial Precise Interval Analysis Revisited | 2009-11-12 | Paper |
| Region Analysis for Race Detection | 2009-08-18 | Paper |
| Computing polynomial program invariants | 2009-07-21 | Paper |
| Macro forest transducers | 2009-07-09 | Paper |
| Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case | 2009-06-30 | Paper |
| Games through Nested Fixpoints | 2009-06-30 | Paper |
| Deciding equivalence of top-down XML transformations in polynomial time | 2009-06-08 | Paper |
| Übersetzerbau | 2009-06-03 | Paper |
| Precise Relational Invariants Through Strategy Iteration | 2009-03-05 | Paper |
| Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations | 2008-08-28 | Paper |
| Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$ | 2008-08-28 | Paper |
| Computing Game Values for Crash Games | 2008-07-03 | Paper |
| Upper Adjoints for Fast Inter-procedural Variable Equalities | 2008-04-11 | Paper |
| Interprocedurally Analyzing Polynomial Identities | 2008-03-19 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses | 2007-09-24 | Paper |
| Interprocedurally Analysing Linear Inequality Relations | 2007-09-04 | Paper |
| Precise Fixpoint Computation Through Strategy Iteration | 2007-09-04 | Paper |
| Übersetzerbau | 2007-07-16 | Paper |
| Automated Deduction – CADE-20 | 2006-11-01 | Paper |
| Static Analysis | 2006-10-31 | Paper |
| Infinite-state high-level MSCs: model-checking and realizability | 2006-06-30 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2005-12-06 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4654726 | 2005-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828479 | 2004-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826114 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737197 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738360 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411947 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411948 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2771057 | 2002-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778878 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763677 | 2002-01-21 | Paper |
| Transforming XML Documents using fxt | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712587 | 2001-10-21 | Paper |
| Interprocedural analyses: a comparison | 2000-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518888 | 2000-12-03 | Paper |
| A faster solver for general systems of equations | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945246 | 2000-09-20 | Paper |
| On Distributive Fixed-Point Expressions | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230923 | 1999-08-17 | Paper |
| The Fork95 programming language: Design, implementation, application. | 1997-08-07 | Paper |
| Fast and simple nested fixpoints | 1997-02-27 | Paper |
| Haskell overloading is DEXPTIME-complete | 1996-04-16 | Paper |
| Tree automata for code selection | 1995-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273672 | 1994-01-13 | Paper |
| Finite tree automata with cost functions | 1994-01-01 | Paper |
| Single-valuedness of tree transducers is decidable in polynomial time | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027634 | 1993-02-21 | Paper |
| On the degree of ambiguity of finite automata | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974881 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3979266 | 1992-06-26 | Paper |
| On finitely generated monoids of matrices with entries in $\mathbb {N}$ | 1991-01-01 | Paper |
| Deciding Equivalence of Finite Tree Automata | 1990-01-01 | Paper |
| On the finite degree of ambiguity of finite tree automata | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789091 | 1988-01-01 | Paper |
| Parameter-reduction of higher level grammars | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727438 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692892 | 1985-01-01 | Paper |
