Skip to content
Menu
Technical University of Munich
Technical University of Munich

Picture of Helmut Seidl

Prof. Dr. Helmut Seidl

Research Interests

  • Automatic Program Analysis
  • Design und Implementation of Programming Languages
  • Semi-structured Data
  • Tree-Automata

Publications

2020

Incremental Abstract Interpretation.

, , :
Incremental Abstract Interpretation. From Lambda Calculus to Cybersecurity Through Program Analysis : 132-148
more
2020

Equivalence of Linear Tree Transducers with Output in the Free Group.

, , :
Equivalence of Linear Tree Transducers with Output in the Free Group. DLT : 207-221
more
2020

On the Balancedness of Tree-to-Word Transducers.

, , :
On the Balancedness of Tree-to-Word Transducers. DLT : 222-236
more
2020

When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?

, :
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP : 134:1-134:18
more
2020

Stratified Guarded First-Order Transition Systems.

, :
Stratified Guarded First-Order Transition Systems. SAS : 113-133
more
2020

Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis.

, , :
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. SAS : 156-177
more
2020

How to Win First-Order Safety Games.

, , :
How to Win First-Order Safety Games. VMCAI : 426-448
more
2020

Equivalence of Linear Tree Transducers with Output in the Free Group.

, , :
Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR abs/2001.03480 ()
more
2019

Synthesizing Efficient Low-Precision Kernels.

, , :
Synthesizing Efficient Low-Precision Kernels. ATVA : 294-313
more
2019

Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time.

, , :
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS : 488-504
more
2019

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 ()
more
2019

How to Win First-Order Safety Games.

, , :
How to Win First-Order Safety Games. CoRR abs/1908.05964 ()
more
2019

On the Balancedness of Tree-to-word Transducers.

, , :
On the Balancedness of Tree-to-word Transducers. CoRR abs/1911.13054 ()
more
2018

Enforcing termination of interprocedural analysis.

, , :
Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. 53(2): 313-338 ()
more
2018

Balancedness of MSO transductions in polynomial time.

, :
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133: 26-32 ()
more
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 ()
more
2018

Paths, tree homomorphisms and disequalities for -clauses.

, :
Paths, tree homomorphisms and disequalities for -clauses. Math. Struct. Comput. Sci. 28(10): 1786-1846 ()
more
2018

Inductive Invariants for Noninterference in Multi-agent Workflows.

, , :
Inductive Invariants for Noninterference in Multi-agent Workflows. CSF : 247-261
more
2018

Three Improvements to the Top-Down Solver.

, :
Three Improvements to the Top-Down Solver. PPDP : 21:1-21:14
more
2018

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 : 48:1-48:13
more
2017

Inter-procedural Two-Variable Herbrand Equalities.

, , :
Inter-procedural Two-Variable Herbrand Equalities. Log. Methods Comput. Sci. 13(2) ()
more
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 : 3-22
more
2017

Verifying Security Policies in Multi-agent Workflows with Loops.

, , , :
Verifying Security Policies in Multi-agent Workflows with Loops. CCS : 633-645
more
2017

Reachability for Dynamic Parametric Processes.

, , :
Reachability for Dynamic Parametric Processes. VMCAI : 424-441
more
2017

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 ()
more
2017

Verifying Security Policies in Multi-agent Workflows with Loops.

, , , :
Verifying Security Policies in Multi-agent Workflows with Loops. CoRR abs/1708.09013 ()
more
2017

Formal Methods of Transformations (Dagstuhl Seminar 17142).

, , :
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 ()
more
2016

Efficiently intertwining widening and narrowing.

, , , , :
Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120: 1-24 ()
more
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 ()
more
2016

Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.

, , :
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA : 157-173
more
2016

Enhancing Top-Down Solving with Widening and Narrowing.

, , :
Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi : 272-288
more
2016

Static race detection for device drivers: the Goblint approach.

, , , , , :
Static race detection for device drivers: the Goblint approach. ASE : 391-402
more
2016

Enforcing Termination of Interprocedural Analysis.

, , :
Enforcing Termination of Interprocedural Analysis. SAS : 447-468
more
2016

Equivalence - Combinatorics, Algebra, Proofs.

, , , :
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering : 202-243
more
2016

Enforcing Termination of Interprocedural Analysis.

, , :
Enforcing Termination of Interprocedural Analysis. CoRR abs/1606.07687 ()
more
2016

Reachability for dynamic parametric processes.

, , :
Reachability for dynamic parametric processes. CoRR abs/1609.05385 ()
more
2015

An Analysis of Universal Information Flow Based on Self-Composition.

, , :
An Analysis of Universal Information Flow Based on Self-Composition. CSF : 380-393
more
2015

Inter-procedural Two-Variable Herbrand Equalities.

, , :
Inter-procedural Two-Variable Herbrand Equalities. ESOP : 457-482
more
2015

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.

, , :
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS : 943-962
more
2015

Transforming XML Streams with References.

, , :
Transforming XML Streams with References. SPIRE : 33-45
more
2015

Efficiently intertwining widening and narrowing.

, , , , :
Efficiently intertwining widening and narrowing. CoRR abs/1503.00883 ()
more
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 ()
more
2014

Numerical invariants through convex relaxation and max-strategy iteration.

, :
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. 44(2): 101-148 ()
more
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 : 103-115
more
2014

Interprocedural Information Flow Analysis of XML Processors.

, :
Interprocedural Information Flow Analysis of XML Processors. LATA : 34-61
more
2014

Parametric Strategy Iteration.

, , :
Parametric Strategy Iteration. SCSS : 62-76
more
2014

Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs.

, , , :
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI : 21-38
more
2014

Frameworks for Interprocedural Analysis of Concurrent Programs.

, , :
Frameworks for Interprocedural Analysis of Concurrent Programs. Software Systems Safety : 309-347
more
2014

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 , ISBN 978-3-319-10935-0 [contents]
more
2014

Software Systems Safety.

, , :
Software Systems Safety. NATO Science for Peace and Security Series, D: Information and Communication Security 36, IOS Press , ISBN 978-1-61499-384-1 [contents]
more
2014

Parametric Strategy Iteration.

, , :
Parametric Strategy Iteration. CoRR abs/1406.5457 ()
more
2014

Inter-procedural Two-Variable Herbrand Equalities.

, , :
Inter-procedural Two-Variable Herbrand Equalities. CoRR abs/1410.4416 ()
more
2013

Compiler Design - Syntactic and Semantic Analysis.

, , :
Compiler Design - Syntactic and Semantic Analysis. Springer , ISBN 978-3-642-17539-8, pp. I-X, 1-225
more
2013

Relational abstract interpretation for the verification of 2-hypersafety properties.

, , :
Relational abstract interpretation for the verification of 2-hypersafety properties. CCS : 211-222
more
2013

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 : 377-386
more
2013

Contextual Locking for Dynamic Pushdown Networks.

, , , :
Contextual Locking for Dynamic Pushdown Networks. SAS : 477-498
more
2013

Look-Ahead Removal for Top-Down Tree Transducers.

, , :
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 ()
more
2013

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).

, :
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3(5): 1-18 ()
more
2012

Compiler Design - Analysis and Transformation.

, , :
Compiler Design - Analysis and Transformation. Springer , ISBN 978-3-642-17547-3, pp. I-XII, 1-177
more
2012

Abstract interpretation meets convex optimization.

, , , , :
Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12): 1416-1446 ()
more
2012

Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis.

, , :
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS : 157-172
more
2012

Runtime Enforcement of Information Flow Security in Tree Manipulating Processes.

, :
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS : 46-59
more
2012

Extending ${\cal H}_1$ -Clauses with Path Disequalities.

, :
Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS : 165-179
more
2012

Model Checking Information Flow in Reactive Systems.

, , , , :
Model Checking Information Flow in Reactive Systems. VMCAI : 169-185
more
2012

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses.

, :
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. CIAA : 301-312
more
2012

Type Checking of Tree Walking Transducers.

, , :
Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory : 325-372
more
2012

Precise Program Analysis through Strategy Iteration and Optimization.

, :
Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security : 348-384
more
2012

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 , ISBN 978-3-642-28868-5 [contents]
more
2012

Numerical Invariants through Convex Relaxation and Max-Strategy Iteration.

, :
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration. CoRR abs/1204.1147 ()
more
2011

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 ()
more
2011

Extending H1-clauses with disequalities.

, :
Extending H1-clauses with disequalities. Inf. Process. Lett. 111(20): 1007-1013 ()
more
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 ()
more
2011

Fast interprocedural linear two-variable equalities.

, , , :
Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21:1-21:33 ()
more
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 : 93-104
more
2011

Side-Effect Analysis of Assembly Code.

, , :
Side-Effect Analysis of Assembly Code. SAS : 77-94
more
2011

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 : 199-213
more
2010

Compiler Design - Virtual Machines.

, :
Compiler Design - Virtual Machines. Springer , ISBN 978-3-642-14908-5, pp. I-XIII, 1-187
more
2010

Praktische Programmverifikation durch statische Analyse.

:
Praktische Programmverifikation durch statische Analyse. Inform. Spektrum 33(5): 484-488 ()
more
2010

Interprocedural Control Flow Reconstruction.

, , , :
Interprocedural Control Flow Reconstruction. APLAS : 188-203
more
2010

Abstract Interpretation over Zones without Widening.

, :
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR : 12-43
more
2010

Minimization of Deterministic Bottom-Up Tree Transducers.

, , :
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory : 185-196
more
2010

What Is a Pure Functional?

, , :
What Is a Pure Functional? ICALP (2) : 199-210
more
2010

Bottom-Up Tree Automata with Term Constraints.

, :
Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) : 581-593
more
2010

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.

, :
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS : 271-286
more
2010

Verifying a Local Generic Solver in Coq.

, , :
Verifying a Local Generic Solver in Coq. SAS : 340-355
more
2010

Normalization of Linear Horn Clauses.

, , :
Normalization of Linear Horn Clauses. SBMF : 242-257
more
2010

Shape Analysis of Low-Level C with Overlapping Structures.

, , :
Shape Analysis of Low-Level C with Overlapping Structures. VMCAI : 214-230
more
2009

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 ()
more
2009

Polynomial Precise Interval Analysis Revisited.

, , , , , :
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms : 422-437
more
2009

Games through Nested Fixpoints.

, :
Games through Nested Fixpoints. CAV : 291-305
more
2009

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 : 644-659
more
2009

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 : 118-132
more
2009

Region Analysis for Race Detection.

, :
Region Analysis for Race Detection. SAS : 171-187
more
2009

Program Analysis through Finite Tree Automata.

:
Program Analysis through Finite Tree Automata. CIAA : 3
more
2008

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 ()
more
2008

Counting in trees.

, , :
Counting in trees. Logic and Automata : 575-612
more
2008

Upper Adjoints for Fast Inter-procedural Variable Equalities.

, :
Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP : 178-192
more
2008

Precise Interval Analysis vs. Parity Games.

, :
Precise Interval Analysis vs. Parity Games. FM : 342-357
more
2008

Lightweight Verification 2008.

, :
Lightweight Verification 2008. GI Jahrestagung (2) : 965-966
more
2008

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.

, , , :
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) : 698-710
more
2008

Analysing All Polynomial Equations in .

, , :
Analysing All Polynomial Equations in . SAS : 299-314
more
2007

Analysis of modular arithmetic.

, :
Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5): 29 ()
more
2007

Computing Game Values for Crash Games.

, :
Computing Game Values for Crash Games. ATVA : 177-191
more
2007

Precise Relational Invariants Through Strategy Iteration.

, :
Precise Relational Invariants Through Strategy Iteration. CSL : 23-40
more
2007

Interprocedurally Analysing Linear Inequality Relations.

, , :
Interprocedurally Analysing Linear Inequality Relations. ESOP : 284-299
more
2007

Precise Fixpoint Computation Through Strategy Iteration.

, :
Precise Fixpoint Computation Through Strategy Iteration. ESOP : 300-315
more
2007

Exact XML Type Checking in Polynomial Time.

, , :
Exact XML Type Checking in Polynomial Time. ICDT : 254-268
more
2007

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.

, :
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X : 73-79
more
2007

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 , ISBN 978-3-540-71388-3 [contents]
more
2006

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 ()
more
2006

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.

, :
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation : 97-119
more
2006

Interprocedurally Analyzing Polynomial Identities.

, , :
Interprocedurally Analyzing Polynomial Identities. STACS : 50-67
more
2006

Exact XML Type Checking in Polynomial Time.

, , :
Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04 ()
more
2005

On the Complexity of Equational Horn Clauses.

, , :
On the Complexity of Equational Horn Clauses. CADE : 337-352
more
2005

Interprocedural Herbrand Equalities.

, , :
Interprocedural Herbrand Equalities. ESOP : 31-45
more
2005

Analysis of Modular Arithmetic.

, :
Analysis of Modular Arithmetic. ESOP : 46-60
more
2005

XML type checking with macro tree transducers.

, , , :
XML type checking with macro tree transducers. PODS : 283-294
more
2005

A Generic Framework for Interprocedural Analysis of Numerical Properties.

, :
A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS : 235-250
more
2005

Checking Herbrand Equalities and Beyond.

, , :
Checking Herbrand Equalities and Beyond. VMCAI : 79-96
more
2005

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 ()
more
2004

Macro forest transducers.

, :
Macro forest transducers. Inf. Process. Lett. 89(3): 141-149 ()
more
2004

Computing polynomial program invariants.

, :
Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 ()
more
2004

Binary Queries for Document Trees.

, :
Binary Queries for Document Trees. Nord. J. Comput. 11(1): 41-71 ()
more
2004

Annotiertes Lecture Recording.

, :
Annotiertes Lecture Recording. DeLFI : 43-54
more
2004

A Note on Karr's Algorithm.

, :
A Note on Karr's Algorithm. ICALP : 1016-1028
more
2004

Counting in Trees for Free.

, , , :
Counting in Trees for Free. ICALP : 1136-1149
more
2004

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 : 79-94
more
2004

A Generic Framework for Interprocedural Analyses of Numerical Properties.

, :
A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR : 432-432
more
2004

Precise interprocedural analysis through linear algebra.

, :
Precise interprocedural analysis through linear algebra. POPL : 330-341
more
2004

The Succinct Solver Suite.

, , , , , , :
The Succinct Solver Suite. TACAS : 251-265
more
2003

(Linear) Algebra for Program Analysis Dynamische Programmanalyse.

, :
(Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends 23(2) ()
more
2003

Numerical document queries.

, , :
Numerical document queries. PODS : 155-166
more
2002

A Succinct Solver for ALFP.

, , :
A Succinct Solver for ALFP. Nord. J. Comput. 9(4): 335-372 ()
more
2002

Transparent teleteaching.

, :
Transparent teleteaching. ASCILITE : 749-758
more
2002

Automatic Complexity Analysis.

, , :
Automatic Complexity Analysis. ESOP : 243-261
more
2002

Binary Queries.

, :
Binary Queries. Extreme Markup Languages®
more
2002

A Type-safe Macro System for XML.

, :
A Type-safe Macro System for XML. Extreme Markup Languages®
more
2002

Infinite-State High-Level MSCs: Model-Checking and Realizability.

, , , :
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP : 657-668
more
2002

Polynomial Constants Are Decidable.

, :
Polynomial Constants Are Decidable. SAS : 4-19
more
2002

Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.

, , :
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS : 20-35
more
2002

Polynomial Constants are Decidable.

, :
Polynomial Constants are Decidable. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09 ()
more
2002

Interprocedural Invariants.

, , :
Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 ()
more
2002

On the Expressiveness of Tree Set Operators.

, :
On the Expressiveness of Tree Set Operators. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-17 ()
more
2001

Cryptographic Analysis in Cubic Time.

, , :
Cryptographic Analysis in Cubic Time. Electron. Notes Theor. Comput. Sci. 62: 7-23 ()
more
2001

Control-Flow Analysis in Cubic Time.

, :
Control-Flow Analysis in Cubic Time. ESOP : 252-268
more
2001

Synchronized Tree Languages Revisited and New Applications.

, , :
Synchronized Tree Languages Revisited and New Applications. FoSSaCS : 214-229
more
2001

Weakly Regular Relations and Applications.

, , :
Weakly Regular Relations and Applications. RTA : 185-200
more
2001

On optimal slicing of parallel programs.

, :
On optimal slicing of parallel programs. STOC : 647-656
more
2001

Succinct Solvers.

, :
Succinct Solvers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12 ()
more
2000

Interprocedural Analyses: A Comparison.

, :
Interprocedural Analyses: A Comparison. J. Log. Program. 43(2): 123-156 ()
more
2000

Constraint-Based Inter-Procedural Analysis of Parallel Programs.

, :
Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. 7(4): 375- ()
more
2000

Constraint-Based Inter-Procedural Analysis of Parallel Programs.

, :
Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP : 351-365
more
1999

On distributive fixed-point expressions.

, :
On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. 33(4/5): 427-446 ()
more
1999

A Faster Solver for General Systems of Equations.

, :
A Faster Solver for General Systems of Equations. Sci. Comput. Program. 35(2): 137-161 ()
more
1999

On Guarding Nested Fixpoints.

, :
On Guarding Nested Fixpoints. CSL : 484-498
more
1999

ForkLight: A Control-Synchronous Parallel Programming Language.

, :
ForkLight: A Control-Synchronous Parallel Programming Language. HPCN Europe : 525-534
more
1999

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 ()
more
1998

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 ()
more
1998

Constraints to Stop Deforestation.

, :
Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 ()
more
1998

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.

, :
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. ESOP : 90-104
more
1998

Locating Matches of Tree Patterns in Forests.

, :
Locating Matches of Tree Patterns in Forests. FSTTCS : 134-145
more
1998

Locating Matches of Tree Patterns in Forests.

, :
Locating Matches of Tree Patterns in Forests. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-08 ()
more
1998

ForkLight: A Control-Synchronous Parallel Programming Language.

, :
ForkLight: A Control-Synchronous Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-13 ()
more
1997

The Fork95 parallel programming language: Design, implementation, application.

, :
The Fork95 parallel programming language: Design, implementation, application. Int. J. Parallel Program. 25(1): 17-50 ()
more
1997

Language Support for Synchronous Parallel Critical Sections.

, :
Language Support for Synchronous Parallel Critical Sections. APDC : 92-99
more
1997

Constraints to Stop Higher-Order Deforestation.

, :
Constraints to Stop Higher-Order Deforestation. POPL : 400-413
more
1997

Disjuntive Completion Is Not "Optimal".

, :
Disjuntive Completion Is Not "Optimal". ILPS : 408
more
1997

Interprocedural Analysis Based on PDAs.

, :
Interprocedural Analysis Based on PDAs. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-06 ()
more
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 ()
more
1997

Model-Checking for L2.

:
Model-Checking for L2. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-18 ()
more
1996

Fast and Simple Nested Fixpoints.

:
Fast and Simple Nested Fixpoints. Inf. Process. Lett. 59(6): 303-308 ()
more
1996

Least and Greatest Solutions of Equations over N.

:
Least and Greatest Solutions of Equations over N. Nord. J. Comput. 3(1): 41-62 ()
more
1996

Integer Constraints to Stop Deforestation.

:
Integer Constraints to Stop Deforestation. ESOP : 326-340
more
1996

A Modal Mu-Calculus for Durational Transition Systems.

:
A Modal Mu-Calculus for Durational Transition Systems. LICS : 128-137
more
1996

An Even Faster Solver for General Systems of Equations.

, :
An Even Faster Solver for General Systems of Equations. SAS : 189-204
more
1996

Fast and Simple Nested Fixpoints.

:
Fast and Simple Nested Fixpoints. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-05 ()
more
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 ()
more
1995

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 ()
more
1995

A Modal µ-Calculus for Durational Transition Systems.

:
A Modal µ-Calculus for Durational Transition Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-08 ()
more
1995

Language Support for Synchronous Parallel Critical Sections.

, :
Language Support for Synchronous Parallel Critical Sections. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-23 ()
more
1994

Tree Automata for Code Selection.

, , :
Tree Automata for Code Selection. Acta Informatica 31(8): 741-760 ()
more
1994

Haskell Overloading is DEXPTIME-Complete.

:
Haskell Overloading is DEXPTIME-Complete. Inf. Process. Lett. 52(2): 57-60 ()
more
1994

Equivalence of Finite-Valued Tree Transducers Is Decidable.

:
Equivalence of Finite-Valued Tree Transducers Is Decidable. Math. Syst. Theory 27(4): 285-346 ()
more
1994

Finite Tree Automata with Cost Functions.

:
Finite Tree Automata with Cost Functions. Theor. Comput. Sci. 126(1): 113-142 ()
more
1994

Least Solutions of Equations over N.

:
Least Solutions of Equations over N. ICALP : 400-411
more
1993

When Is a Functional Tree Transduction Deterministic?

:
When Is a Functional Tree Transduction Deterministic? TAPSOFT : 251-265
more
1992

FORK: A high-level language for PRAMs.

, , :
FORK: A high-level language for PRAMs. Future Gener. Comput. Syst. 8(4): 379-393 ()
more
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 ()
more
1992

Finite Tree Automata with Cost Functions.

:
Finite Tree Automata with Cost Functions. CAAP : 279-299
more
1992

Ambiguity and valuedness.

:
Ambiguity and valuedness. Tree Automata and Languages : 355-380
more
1992

Baumautomaten zur Codeselektion.

, , :
Baumautomaten zur Codeselektion. Informatik : 121-144
more
1991

On finitely generated monoids of matrices with entries in N.

, :
On finitely generated monoids of matrices with entries in N. RAIRO Theor. Informatics Appl. 25: 19-38 ()
more
1991

On the Degree of Ambiguity of Finite Automata.

, :
On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88(2): 325-349 ()
more
1991

Tree Automata for Code Selection.

, , :
Tree Automata for Code Selection. Code Generation : 30-50
more
1991

FORK: A High-Level Language for PRAMs.

, , :
FORK: A High-Level Language for PRAMs. PARLE (1) : 304-320
more
1990

Deciding Equivalence of Finite Tree Automata.

:
Deciding Equivalence of Finite Tree Automata. SIAM J. Comput. 19(3): 424-437 ()
more
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 : 269-284
more
1990

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.

, :
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS : 148-158
more
1989

On the Finite Degree of Ambiguity of Finite Tree Automata.

:
On the Finite Degree of Ambiguity of Finite Tree Automata. Acta Informatica 26(6): 527-542 ()
more
1989

On the Finite Degree of Ambiguity of Finite Tree Automata.

:
On the Finite Degree of Ambiguity of Finite Tree Automata. FCT : 395-404
more
1989

Deciding Equivalence of Finite Tree Automata.

:
Deciding Equivalence of Finite Tree Automata. STACS : 480-492
more
1988

Parameter-Reduction of Higher Level Grammars (Extended Abstract).

:
Parameter-Reduction of Higher Level Grammars (Extended Abstract). CAAP : 52-71
more
1987

Parameter Reduction of Higher Level Grammars.

:
Parameter Reduction of Higher Level Grammars. Theor. Comput. Sci. 55(1): 47-85 ()
more
1986

On the Degree of Ambiguity of Finite Automata.

, :
On the Degree of Ambiguity of Finite Automata. MFCS : 620-629
more
1985

A quadratic regularity test for non-deleting macro S grammars.

:
A quadratic regularity test for non-deleting macro S grammars. FCT : 422-430
more
To top