| Publication | Date of Publication | Type |
|---|
Prenex universal first-order safety properties
Information Processing Letters | 2024-06-07 | Paper |
Checking in polynomial time whether or not a regular tree language is deterministic top-down
Information Processing Letters | 2024-03-26 | Paper |
Functionality of compositions of top-down tree transducers is decidable
Information and Computation | 2024-01-18 | Paper |
Clustered relational thread-modular abstract interpretation with local traces
| 2023-11-24 | Paper |
On the Balancedness of Tree-to-Word Transducers
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Definability Results for Top-Down Tree Transducers
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
How to decide functionality of compositions of top-down tree transducers
Algebraic Informatics | 2023-07-26 | Paper |
Deciding origin equivalence of weakly self-nesting macro tree transducers
Information Processing Letters | 2023-01-30 | Paper |
When is a functional tree transduction deterministic?
Lecture Notes in Computer Science | 2022-11-02 | Paper |
Equivalence of Linear Tree Transducers with Output in the Free Group
Developments in Language Theory | 2022-10-13 | Paper |
On the balancedness of tree-to-word transducers
Developments in Language Theory | 2022-10-13 | Paper |
Deciding equivalence of finite tree automata
STACS 89 | 2022-08-16 | Paper |
Three improvements to the top-down solver
Mathematical Structures in Computer Science | 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
Static Analysis | 2022-02-16 | Paper |
Counterexample- and simulation-guided floating-point loop invariant synthesis
| 2021-10-18 | Paper |
Stratified guarded first-order transition systems
| 2021-10-18 | Paper |
scientific article; zbMATH DE number 7228439 (Why is no real title available?)
| 2020-08-05 | Paper |
Incremental Abstract Interpretation
From Lambda Calculus to Cybersecurity Through Program Analysis | 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
Automata, Languages and Programming | 2019-04-29 | Paper |
Equivalence of deterministic top-down tree-to-string transducers is decidable
Journal of the ACM | 2018-12-06 | Paper |
Paths, tree homomorphisms and disequalities for \(\mathcal H_1\)-clauses
Mathematical Structures in Computer Science | 2018-10-25 | Paper |
Enforcing termination of interprocedural analysis
Formal Methods in System Design | 2018-10-04 | Paper |
Enforcing termination of interprocedural analysis
Lecture Notes in Computer Science | 2018-08-27 | Paper |
Balancedness of MSO transductions in polynomial time
Information Processing Letters | 2018-03-16 | Paper |
Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Inter-procedural two-variable Herbrand equalities
Logical Methods in Computer Science | 2017-05-16 | Paper |
Reachability for dynamic parametric processes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Inter-procedural two-variable Herbrand equalities
Lecture Notes in Computer Science | 2016-04-26 | Paper |
Enhancing top-down solving with widening and narrowing
Semantics, Logics, and Calculi | 2016-03-23 | Paper |
Look-ahead removal for total deterministic top-down tree transducers
Theoretical Computer Science | 2016-01-21 | Paper |
Precise interprocedural analysis through linear algebra
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-11-11 | Paper |
On optimal slicing of parallel programs
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Precise analysis of value-dependent synchronization in priority scheduled programs
Lecture Notes in Computer Science | 2015-01-13 | Paper |
How to remove the look-ahead of top-down tree transducers
Developments in Language Theory | 2014-10-14 | Paper |
Numerical invariants through convex relaxation and max-strategy iteration
Formal Methods in System Design | 2014-06-30 | Paper |
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
Interprocedural information flow analysis of XML processors
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Cryptographic analysis in cubic time
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
Extending \(H_1\)-clauses with disequalities
Information Processing Letters | 2013-04-04 | Paper |
Type checking of tree walking transducers
Modern Applications of Automata Theory | 2013-02-26 | Paper |
Crossing the syntactic barrier: hom-disequalities for \({\mathcal H}_1\)-clauses
Implementation and Application of Automata | 2012-09-20 | Paper |
Earliest normal form and minimization for bottom-up tree transducers
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Abstract interpretation meets convex optimization
Journal of Symbolic Computation | 2012-07-13 | Paper |
Extending \({\mathcal H}_1\)-clauses with path disequalities
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Model Checking Information Flow in Reactive Systems
Lecture Notes in Computer Science | 2012-06-15 | Paper |
scientific article; zbMATH DE number 5948801 (Why is no real title available?)
| 2011-09-20 | Paper |
Compiler design. Analysis and transformation.
| 2011-06-23 | Paper |
Normalization of linear Horn clauses
Lecture Notes in Computer Science | 2011-05-12 | Paper |
Counting in trees
| 2011-03-30 | Paper |
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
Lecture Notes in Computer Science | 2011-02-15 | Paper |
Compiler design. Syntactic and semantic analysis
| 2011-02-14 | Paper |
Bottom-Up Tree Automata with Term Constraints
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Verifying a local generic solver in Coq
Static Analysis | 2010-10-01 | Paper |
Computing relaxed abstract semantics w.r.t. quadratic zones precisely
Static Analysis | 2010-10-01 | Paper |
Compiler design. Virtual machines.
| 2010-09-28 | Paper |
What is a pure functional?
Automata, Languages and Programming | 2010-09-07 | Paper |
Minimization of deterministic bottom-up tree transducers
Developments in Language Theory | 2010-08-31 | Paper |
Compiler design. Vol. 3: Analysis and transformation.
eXamen.press | 2010-01-21 | Paper |
Shape analysis of low-level C with overlapping structures
Lecture Notes in Computer Science | 2010-01-14 | Paper |
Polynomial Precise Interval Analysis Revisited
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Region Analysis for Race Detection
Static Analysis | 2009-08-18 | Paper |
Computing polynomial program invariants
Information Processing Letters | 2009-07-21 | Paper |
Macro forest transducers
Information Processing Letters | 2009-07-09 | Paper |
Games through Nested Fixpoints
Computer Aided Verification | 2009-06-30 | Paper |
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Deciding equivalence of top-down XML transformations in polynomial time
Journal of Computer and System Sciences | 2009-06-08 | Paper |
Übersetzerbau
eXamen.press | 2009-06-03 | Paper |
Precise Relational Invariants Through Strategy Iteration
Computer Science Logic | 2009-03-05 | Paper |
Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
Static Analysis | 2008-08-28 | Paper |
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
Automata, Languages and Programming | 2008-08-28 | Paper |
Computing Game Values for Crash Games
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Upper Adjoints for Fast Inter-procedural Variable Equalities
Programming Languages and Systems | 2008-04-11 | Paper |
Interprocedurally Analyzing Polynomial Identities
STACS 2006 | 2008-03-19 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
Program Analysis and Compilation, Theory and Practice | 2007-09-24 | Paper |
Interprocedurally Analysing Linear Inequality Relations
Programming Languages and Systems | 2007-09-04 | Paper |
Precise Fixpoint Computation Through Strategy Iteration
Programming Languages and Systems | 2007-09-04 | Paper |
Übersetzerbau
eXamen.press | 2007-07-16 | Paper |
Automated Deduction – CADE-20
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
Infinite-state high-level MSCs: model-checking and realizability
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
scientific article; zbMATH DE number 2143089 (Why is no real title available?)
| 2005-03-08 | Paper |
scientific article; zbMATH DE number 2117132 (Why is no real title available?)
| 2004-11-19 | Paper |
scientific article; zbMATH DE number 2114412 (Why is no real title available?)
| 2004-11-11 | Paper |
scientific article; zbMATH DE number 2086660 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087550 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1948385 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1948386 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1705162 (Why is no real title available?)
| 2002-06-02 | Paper |
scientific article; zbMATH DE number 1722706 (Why is no real title available?)
| 2002-03-21 | Paper |
scientific article; zbMATH DE number 1692944 (Why is no real title available?)
| 2002-01-21 | Paper |
Transforming XML Documents using fxt
Journal of Computing and Information Technology | 2002-01-01 | Paper |
Constraint-based inter-procedural analysis of parallel programs
Nordic Journal of Computing | 2001-10-21 | Paper |
Interprocedural analyses: a comparison
The Journal of Logic Programming | 2000-12-18 | Paper |
scientific article; zbMATH DE number 1538033 (Why is no real title available?)
| 2000-12-03 | Paper |
A faster solver for general systems of equations
Science of Computer Programming | 2000-11-22 | Paper |
scientific article; zbMATH DE number 1424055 (Why is no real title available?)
| 2000-09-20 | Paper |
On Distributive Fixed-Point Expressions
RAIRO - Theoretical Informatics and Applications | 2000-03-16 | Paper |
scientific article; zbMATH DE number 1251178 (Why is no real title available?)
| 1999-08-17 | Paper |
The Fork95 programming language: Design, implementation, application.
International Journal of Parallel Programming | 1997-08-07 | Paper |
Fast and simple nested fixpoints
Information Processing Letters | 1997-02-27 | Paper |
Haskell overloading is DEXPTIME-complete
Information Processing Letters | 1996-04-16 | Paper |
Tree automata for code selection
Acta Informatica | 1995-01-11 | Paper |
scientific article; zbMATH DE number 475425 (Why is no real title available?)
| 1994-01-13 | Paper |
Finite tree automata with cost functions
Theoretical Computer Science | 1994-01-01 | Paper |
Single-valuedness of tree transducers is decidable in polynomial time
Theoretical Computer Science | 1993-10-17 | Paper |
scientific article; zbMATH DE number 125895 (Why is no real title available?)
| 1993-02-21 | Paper |
scientific article; zbMATH DE number 17556 (Why is no real title available?)
| 1992-06-26 | Paper |
On the degree of ambiguity of finite automata
Theoretical Computer Science | 1992-06-26 | Paper |
scientific article; zbMATH DE number 19768 (Why is no real title available?)
| 1992-06-26 | Paper |
On finitely generated monoids of matrices with entries in $\mathbb {N}$
RAIRO - Theoretical Informatics and Applications | 1991-01-01 | Paper |
Deciding Equivalence of Finite Tree Automata
SIAM Journal on Computing | 1990-01-01 | Paper |
On the finite degree of ambiguity of finite tree automata
Acta Informatica | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4053048 (Why is no real title available?)
| 1988-01-01 | Paper |
Parameter-reduction of higher level grammars
Theoretical Computer Science | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4001492 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3917736 (Why is no real title available?)
| 1985-01-01 | Paper |
