Prof. Dr. Helmut Seidl
- Phone: +49 (89) 289 - 18155
- Office hours: Do. 14-16
- Room: 5607.02.054
- helmut.seidl@tum.de
Research Interests
- Automatic Program Analysis
- Design und Implementation of Programming Languages
- Semi-structured Data
- Tree-Automata
Publications
..
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time.
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS 2019: 488-504
..
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time.
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR abs/1902.03858 (2019)
..
How to Win First-Order Safety Games.
How to Win First-Order Safety Games. CoRR abs/1908.05964 (2019)
..
Enforcing termination of interprocedural analysis.
Enforcing termination of interprocedural analysis. Formal Methods in System Design 53(2): 313-338 (2018)
..
Balancedness of MSO transductions in polynomial time.
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133: 26-32 (2018)
..
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable.
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65(4): 21:1-21:30 (2018)
..
Paths, tree homomorphisms and disequalities for -clauses.
Paths, tree homomorphisms and disequalities for -clauses. Mathematical Structures in Computer Science 28(10): 1786-1846 (2018)
..
Inductive Invariants for Noninterference in Multi-agent Workflows.
Inductive Invariants for Noninterference in Multi-agent Workflows. CSF 2018: 247-261
..
Three Improvements to the Top-Down Solver.
Three Improvements to the Top-Down Solver. PPDP 2018: 21:1-21:14
..
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS 2018: 48:1-48:13
..
Inter-procedural Two-Variable Herbrand Equalities.
Inter-procedural Two-Variable Herbrand Equalities. Logical Methods in Computer Science 13(2) (2017)
..
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking.
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. ATVA 2017: 3-22
..
Verifying Security Policies in Multi-agent Workflows with Loops.
Verifying Security Policies in Multi-agent Workflows with Loops. ACM Conference on Computer and Communications Security 2017: 633-645
..
Reachability for Dynamic Parametric Processes.
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441
..
Computing the longest common prefix of a context-free language in polynomial time.
Computing the longest common prefix of a context-free language in polynomial time. CoRR abs/1702.06698 (2017)
..
Verifying Security Policies in Multi-agent Workflows with Loops.
Verifying Security Policies in Multi-agent Workflows with Loops. CoRR abs/1708.09013 (2017)
..
Formal Methods of Transformations (Dagstuhl Seminar 17142).
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 (2017)
..
Efficiently intertwining widening and narrowing.
Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120: 1-24 (2016)
..
Look-ahead removal for total deterministic top-down tree transducers.
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616: 18-58 (2016)
..
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA 2016: 157-173
..
Enhancing Top-Down Solving with Widening and Narrowing.
Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi 2016: 272-288
..
Static race detection for device drivers: the Goblint approach.
Static race detection for device drivers: the Goblint approach. ASE 2016: 391-402
..
Enforcing Termination of Interprocedural Analysis.
Enforcing Termination of Interprocedural Analysis. SAS 2016: 447-468
..
Equivalence - Combinatorics, Algebra, Proofs.
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243
..
Enforcing Termination of Interprocedural Analysis.
Enforcing Termination of Interprocedural Analysis. CoRR abs/1606.07687 (2016)
..
Reachability for dynamic parametric processes.
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016)
..
An Analysis of Universal Information Flow Based on Self-Composition.
An Analysis of Universal Information Flow Based on Self-Composition. CSF 2015: 380-393
..
Inter-procedural Two-Variable Herbrand Equalities.
Inter-procedural Two-Variable Herbrand Equalities. ESOP 2015: 457-482
..
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS 2015: 943-962
..
Transforming XML Streams with References.
Transforming XML Streams with References. SPIRE 2015: 33-45
..
Efficiently intertwining widening and narrowing.
Efficiently intertwining widening and narrowing. CoRR abs/1503.00883 (2015)
..
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR abs/1503.09163 (2015)
..
Numerical invariants through convex relaxation and max-strategy iteration.
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods in System Design 44(2): 101-148 (2014)
..
How to Remove the Look-Ahead of Top-Down Tree Transducers.
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory 2014: 103-115
..
Interprocedural Information Flow Analysis of XML Processors.
Interprocedural Information Flow Analysis of XML Processors. LATA 2014: 34-61
..
Parametric Strategy Iteration.
Parametric Strategy Iteration. SCSS 2014: 62-76
..
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs.
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI 2014: 21-38
..
Frameworks for Interprocedural Analysis of Concurrent Programs.
Frameworks for Interprocedural Analysis of Concurrent Programs. Software Systems Safety 2014: 309-347
..
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings.
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8723, Springer 2014, ISBN 978-3-319-10935-0 [contents]
..
Software Systems Safety.
Software Systems Safety. NATO Science for Peace and Security Series, D: Information and Communication Security 36, IOS Press 2014, ISBN 978-1-61499-384-1 [contents]
..
Parametric Strategy Iteration.
Parametric Strategy Iteration. CoRR abs/1406.5457 (2014)
..
Inter-procedural Two-Variable Herbrand Equalities.
Inter-procedural Two-Variable Herbrand Equalities. CoRR abs/1410.4416 (2014)
..
Compiler Design - Syntactic and Semantic Analysis.
Compiler Design - Syntactic and Semantic Analysis. Springer 2013, ISBN 978-3-642-17539-8, pp. I-X, 1-225
..
Relational abstract interpretation for the verification of 2-hypersafety properties.
Relational abstract interpretation for the verification of 2-hypersafety properties. ACM Conference on Computer and Communications Security 2013: 211-222
..
How to combine widening and narrowing for non-monotonic systems of equations.
How to combine widening and narrowing for non-monotonic systems of equations. PLDI 2013: 377-386
..
Contextual Locking for Dynamic Pushdown Networks.
Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498
..
Look-Ahead Removal for Top-Down Tree Transducers.
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 (2013)
..
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3(5): 1-18 (2013)
..
Compiler Design - Analysis and Transformation.
Compiler Design - Analysis and Transformation. Springer 2012, ISBN 978-3-642-17547-3, pp. I-XII, 1-177
..
Abstract interpretation meets convex optimization.
Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12): 1416-1446 (2012)
..
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis.
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS 2012: 157-172
..
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes.
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS 2012: 46-59
..
Extending ${\cal H}_1$ -Clauses with Path Disequalities.
Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS 2012: 165-179
..
Model Checking Information Flow in Reactive Systems.
Model Checking Information Flow in Reactive Systems. VMCAI 2012: 169-185
..
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses.
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. CIAA 2012: 301-312
..
Type Checking of Tree Walking Transducers.
Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory 2012: 325-372
..
Precise Program Analysis through Strategy Iteration and Optimization.
Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security 2012: 348-384
..
Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings.
Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Lecture Notes in Computer Science 7211, Springer 2012, ISBN 978-3-642-28868-5 [contents]
..
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration.
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration. CoRR abs/1204.1147 (2012)
..
Earliest Normal Form and Minimization for Bottom-up Tree Transducers.
Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22(7): 1607-1623 (2011)
..
Extending H1-clauses with disequalities.
Extending H1-clauses with disequalities. Inf. Process. Lett. 111(20): 1007-1013 (2011)
..
Solving systems of rational equations through strategy iteration.
Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33(3): 11:1-11:48 (2011)
..
Fast interprocedural linear two-variable equalities.
Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21:1-21:33 (2011)
..
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol.
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL 2011: 93-104
..
Side-Effect Analysis of Assembly Code.
Side-Effect Analysis of Assembly Code. SAS 2011: 77-94
..
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation.
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213
..
Compiler Design - Virtual Machines.
Compiler Design - Virtual Machines. Springer 2010, ISBN 978-3-642-14908-5, pp. I-XIII, 1-187
..
Praktische Programmverifikation durch statische Analyse.
Praktische Programmverifikation durch statische Analyse. Informatik Spektrum 33(5): 484-488 (2010)
..
Interprocedural Control Flow Reconstruction.
Interprocedural Control Flow Reconstruction. APLAS 2010: 188-203
..
Abstract Interpretation over Zones without Widening.
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR 2010: 12-43
..
Minimization of Deterministic Bottom-Up Tree Transducers.
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196
..
What Is a Pure Functional?
What Is a Pure Functional? ICALP (2) 2010: 199-210
..
Bottom-Up Tree Automata with Term Constraints.
Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) 2010: 581-593
..
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS 2010: 271-286
..
Verifying a Local Generic Solver in Coq.
Verifying a Local Generic Solver in Coq. SAS 2010: 340-355
..
Normalization of Linear Horn Clauses.
Normalization of Linear Horn Clauses. SBMF 2010: 242-257
..
Shape Analysis of Low-Level C with Overlapping Structures.
Shape Analysis of Low-Level C with Overlapping Structures. VMCAI 2010: 214-230
..
Deciding equivalence of top-down XML transformations in polynomial time.
Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009)
..
Polynomial Precise Interval Analysis Revisited.
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437
..
Games through Nested Fixpoints.
Games through Nested Fixpoints. CAV 2009: 291-305
..
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. FM 2009: 644-659
..
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA 2009: 118-132
..
Region Analysis for Race Detection.
Region Analysis for Race Detection. SAS 2009: 171-187
..
Program Analysis through Finite Tree Automata.
Program Analysis through Finite Tree Automata. CIAA 2009: 3
..
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. 9(4): 28:1-28:45 (2008)
..
Counting in trees.
Counting in trees. Logic and Automata 2008: 575-612
..
Upper Adjoints for Fast Inter-procedural Variable Equalities.
Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP 2008: 178-192
..
Precise Interval Analysis vs. Parity Games.
Precise Interval Analysis vs. Parity Games. FM 2008: 342-357
..
Lightweight Verification 2008.
Lightweight Verification 2008. GI Jahrestagung (2) 2008: 965-966
..
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710
..
Analysing All Polynomial Equations in .
Analysing All Polynomial Equations in . SAS 2008: 299-314
..
Analysis of modular arithmetic.
Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5): 29 (2007)
..
Computing Game Values for Crash Games.
Computing Game Values for Crash Games. ATVA 2007: 177-191
..
Precise Relational Invariants Through Strategy Iteration.
Precise Relational Invariants Through Strategy Iteration. CSL 2007: 23-40
..
Interprocedurally Analysing Linear Inequality Relations.
Interprocedurally Analysing Linear Inequality Relations. ESOP 2007: 284-299
..
Precise Fixpoint Computation Through Strategy Iteration.
Precise Fixpoint Computation Through Strategy Iteration. ESOP 2007: 300-315
..
Exact XML Type Checking in Polynomial Time.
Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268
..
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X 2007: 73-79
..
Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings.
Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Lecture Notes in Computer Science 4423, Springer 2007, ISBN 978-3-540-71388-3 [contents]
..
Infinite-state high-level MSCs: Model-checking and realizability.
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006)
..
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation 2006: 97-119
..
Interprocedurally Analyzing Polynomial Identities.
Interprocedurally Analyzing Polynomial Identities. STACS 2006: 50-67
..
Exact XML Type Checking in Polynomial Time.
Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04 (2006)
..
On the Complexity of Equational Horn Clauses.
On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
..
Interprocedural Herbrand Equalities.
Interprocedural Herbrand Equalities. ESOP 2005: 31-45
..
Analysis of Modular Arithmetic.
Analysis of Modular Arithmetic. ESOP 2005: 46-60
..
XML type checking with macro tree transducers.
XML type checking with macro tree transducers. PODS 2005: 283-294
..
A Generic Framework for Interprocedural Analysis of Numerical Properties.
A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS 2005: 235-250
..
Checking Herbrand Equalities and Beyond.
Checking Herbrand Equalities and Beyond. VMCAI 2005: 79-96
..
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. CoRR abs/cs/0511014 (2005)
..
Macro forest transducers.
Macro forest transducers. Inf. Process. Lett. 89(3): 141-149 (2004)
..
Computing polynomial program invariants.
Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 (2004)
..
Binary Queries for Document Trees.
Binary Queries for Document Trees. Nord. J. Comput. 11(1): 41-71 (2004)
..
Annotiertes Lecture Recording.
Annotiertes Lecture Recording. DeLFI 2004: 43-54
..
A Note on Karr's Algorithm.
A Note on Karr's Algorithm. ICALP 2004: 1016-1028
..
Counting in Trees for Free.
Counting in Trees for Free. ICALP 2004: 1136-1149
..
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR 2004: 79-94
..
A Generic Framework for Interprocedural Analyses of Numerical Properties.
A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR 2004: 432-432
..
Precise interprocedural analysis through linear algebra.
Precise interprocedural analysis through linear algebra. POPL 2004: 330-341
..
The Succinct Solver Suite.
The Succinct Solver Suite. TACAS 2004: 251-265
..
(Linear) Algebra for Program Analysis Dynamische Programmanalyse.
(Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends 23(2) (2003)
..
Numerical document queries.
Numerical document queries. PODS 2003: 155-166
..
A Succinct Solver for ALFP.
A Succinct Solver for ALFP. Nord. J. Comput. 9(4): 335-372 (2002)
..
Transparent teleteaching.
Transparent teleteaching. ASCILITE 2002: 749-758
..
Automatic Complexity Analysis.
Automatic Complexity Analysis. ESOP 2002: 243-261
..
Binary Queries.
Binary Queries. Extreme Markup Languages® 2002
..
A Type-safe Macro System for XML.
A Type-safe Macro System for XML. Extreme Markup Languages® 2002
..
Infinite-State High-Level MSCs: Model-Checking and Realizability.
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002: 657-668
..
Polynomial Constants Are Decidable.
Polynomial Constants Are Decidable. SAS 2002: 4-19
..
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS 2002: 20-35
..
Polynomial Constants are Decidable.
Polynomial Constants are Decidable. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09 (2002)
..
Interprocedural Invariants.
Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 (2002)
..
On the Expressiveness of Tree Set Operators.
On the Expressiveness of Tree Set Operators. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-17 (2002)
..
Cryptographic Analysis in Cubic Time.
Cryptographic Analysis in Cubic Time. Electr. Notes Theor. Comput. Sci. 62: 7-23 (2001)
..
Control-Flow Analysis in Cubic Time.
Control-Flow Analysis in Cubic Time. ESOP 2001: 252-268
..
Synchronized Tree Languages Revisited and New Applications.
Synchronized Tree Languages Revisited and New Applications. FoSSaCS 2001: 214-229
..
Weakly Regular Relations and Applications.
Weakly Regular Relations and Applications. RTA 2001: 185-200
..
On optimal slicing of parallel programs.
On optimal slicing of parallel programs. STOC 2001: 647-656
..
Succinct Solvers.
Succinct Solvers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12 (2001)
..
Interprocedural Analyses: A Comparison.
Interprocedural Analyses: A Comparison. J. Log. Program. 43(2): 123-156 (2000)
..
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. 7(4): 375- (2000)
..
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP 2000: 351-365
..
On distributive fixed-point expressions.
On distributive fixed-point expressions. ITA 33(4/5): 427-446 (1999)
..
A Faster Solver for General Systems of Equations.
A Faster Solver for General Systems of Equations. Sci. Comput. Program. 35(2): 137-161 (1999)
..
On Guarding Nested Fixpoints.
On Guarding Nested Fixpoints. CSL 1999: 484-498
..
ForkLight: A Control-Synchronous Parallel Programming Language.
ForkLight: A Control-Synchronous Parallel Programming Language. HPCN Europe 1999: 525-534
..
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations.
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-10 (1999)
..
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nord. J. Comput. 5(4): 304-329 (1998)
..
Constraints to Stop Deforestation.
Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 (1998)
..
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. ESOP 1998: 90-104
..
Locating Matches of Tree Patterns in Forests.
Locating Matches of Tree Patterns in Forests. FSTTCS 1998: 134-145
..
Locating Matches of Tree Patterns in Forests.
Locating Matches of Tree Patterns in Forests. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-08 (1998)
..
ForkLight: A Control-Synchronous Parallel Programming Language.
ForkLight: A Control-Synchronous Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-13 (1998)
..
The Fork95 parallel programming language: Design, implementation, application.
The Fork95 parallel programming language: Design, implementation, application. International Journal of Parallel Programming 25(1): 17-50 (1997)
..
Language Support for Synchronous Parallel Critical Sections.
Language Support for Synchronous Parallel Critical Sections. APDC 1997: 92-99
..
Constraints to Stop Higher-Order Deforestation.
Constraints to Stop Higher-Order Deforestation. POPL 1997: 400-413
..
Disjuntive Completion Is Not "Optimal".
Disjuntive Completion Is Not "Optimal". ILPS 1997: 408
..
Interprocedural Analysis Based on PDAs.
Interprocedural Analysis Based on PDAs. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-06 (1997)
..
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-13 (1997)
..
Model-Checking for L2.
Model-Checking for L2. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-18 (1997)
..
Fast and Simple Nested Fixpoints.
Fast and Simple Nested Fixpoints. Inf. Process. Lett. 59(6): 303-308 (1996)
..
Least and Greatest Solutions of Equations over N.
Least and Greatest Solutions of Equations over N. Nord. J. Comput. 3(1): 41-62 (1996)
..
Integer Constraints to Stop Deforestation.
Integer Constraints to Stop Deforestation. ESOP 1996: 326-340
..
A Modal Mu-Calculus for Durational Transition Systems.
A Modal Mu-Calculus for Durational Transition Systems. LICS 1996: 128-137
..
An Even Faster Solver for General Systems of Equations.
An Even Faster Solver for General Systems of Equations. SAS 1996: 189-204
..
Fast and Simple Nested Fixpoints.
Fast and Simple Nested Fixpoints. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-05 (1996)
..
An Even Faster Solver for General Systems of Equations.
An Even Faster Solver for General Systems of Equations. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-11 (1996)
..
Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language.
Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-05 (1995)
..
A Modal µ-Calculus for Durational Transition Systems.
A Modal µ-Calculus for Durational Transition Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-08 (1995)
..
Language Support for Synchronous Parallel Critical Sections.
Language Support for Synchronous Parallel Critical Sections. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-23 (1995)
..
Tree Automata for Code Selection.
Tree Automata for Code Selection. Acta Inf. 31(8): 741-760 (1994)
..
Haskell Overloading is DEXPTIME-Complete.
Haskell Overloading is DEXPTIME-Complete. Inf. Process. Lett. 52(2): 57-60 (1994)
..
Equivalence of Finite-Valued Tree Transducers Is Decidable.
Equivalence of Finite-Valued Tree Transducers Is Decidable. Mathematical Systems Theory 27(4): 285-346 (1994)
..
Finite Tree Automata with Cost Functions.
Finite Tree Automata with Cost Functions. Theor. Comput. Sci. 126(1): 113-142 (1994)
..
Least Solutions of Equations over N.
Least Solutions of Equations over N. ICALP 1994: 400-411
..
When Is a Functional Tree Transduction Deterministic?
When Is a Functional Tree Transduction Deterministic? TAPSOFT 1993: 251-265
..
FORK: A high-level language for PRAMs.
FORK: A high-level language for PRAMs. Future Generation Comp. Syst. 8(4): 379-393 (1992)
..
Single-Valuedness of Tree Transducers is Decidable in Polynomial Time.
Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. Theor. Comput. Sci. 106(1): 135-181 (1992)
..
Finite Tree Automata with Cost Functions.
Finite Tree Automata with Cost Functions. CAAP 1992: 279-299
..
Ambiguity and valuedness.
Ambiguity and valuedness. Tree Automata and Languages 1992: 355-380
..
Baumautomaten zur Codeselektion.
Baumautomaten zur Codeselektion. Informatik 1992: 121-144
..
On finitely generated monoids of matrices with entries in N.
On finitely generated monoids of matrices with entries in N. ITA 25: 19-38 (1991)
..
On the Degree of Ambiguity of Finite Automata.
On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88(2): 325-349 (1991)
..
Tree Automata for Code Selection.
Tree Automata for Code Selection. Code Generation 1991: 30-50
..
FORK: A High-Level Language for PRAMs.
FORK: A High-Level Language for PRAMs. PARLE (1) 1991: 304-320
..
Deciding Equivalence of Finite Tree Automata.
Deciding Equivalence of Finite Tree Automata. SIAM J. Comput. 19(3): 424-437 (1990)
..
Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.
Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. CAAP 1990: 269-284
..
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990: 148-158
..
On the Finite Degree of Ambiguity of Finite Tree Automata.
On the Finite Degree of Ambiguity of Finite Tree Automata. Acta Inf. 26(6): 527-542 (1989)
..
On the Finite Degree of Ambiguity of Finite Tree Automata.
On the Finite Degree of Ambiguity of Finite Tree Automata. FCT 1989: 395-404
..
Deciding Equivalence of Finite Tree Automata.
Deciding Equivalence of Finite Tree Automata. STACS 1989: 480-492
..
Parameter-Reduction of Higher Level Grammars (Extended Abstract).
Parameter-Reduction of Higher Level Grammars (Extended Abstract). CAAP 1988: 52-71
..
Parameter Reduction of Higher Level Grammars.
Parameter Reduction of Higher Level Grammars. Theor. Comput. Sci. 55(1): 47-85 (1987)
..
On the Degree of Ambiguity of Finite Automata.
On the Degree of Ambiguity of Finite Automata. MFCS 1986: 620-629
..
A quadratic regularity test for non-deleting macro S grammars.
A quadratic regularity test for non-deleting macro S grammars. FCT 1985: 422-430