- Interprocedurally Analyzing Polynomial Identities Markus MullerOlm 1 , Michael Petter 2 , and Helmut Seidl 2
- Integer Constraints to Stop Deforestation
- ControlFlow Analysis in Cubic Time Flemming Nielson 1 and Helmut Seidl 2
- Haskell Overloading is DEXPTIME--complete
- Ambiguity, Valuedness and Costs Helmut Seidl
- Deciding Equivalence of TopDown XML Transformations in Polynomial Time
- Checking Herbrand Equalities and Beyond Markus MullerOlm 1 , Oliver Ruthing 1 , and Helmut Seidl 2
- Interprocedural Analyses: A Comparison
- Counting in Trees for Free Helmut Seidl 1 , Thomas Schwentick 2? , Anca Muscholl 3 , and Peter Habermehl 3
- On Distributive Fixpoint Expressions Helmut Seidl \Lambda Damian Niwi'nski y
- Automatic Complexity Analysis Flemming Nielson 1 , Hanne Riis Nielson 1 , and Helmut Seidl 2
- Interprocedurally Analyzing Polynomial Identities
- An Even Faster Solver for General Systems of Christian Fecht
- Computing Game Values for Crash Games Thomas Gawlitza and Helmut Seidl
- Computing with Relations Helmut Seidl
- Fast and Simple Nested Fixpoints Helmut Seidl
- Fxt -A Transformation Tool for XML Documents Alexandru Berlea
- UNIVERSITAT TRIER Mathematik / Informatik
- In nite-State High-Level MSCs: Model-Checking and Realizability
- Precise Interprocedural Analysis through Linear Algebra ullerOlm
- Precise Program Analysis, Strategy Iteration and
- Numerical Document Queries Helmut Seidl
- Nordic Journal of Computing Constraint-Based Inter-Procedural Analysis of Parallel
- Flat and OneVariable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
- Foundations and Challenges Helmut Seidl
- A Note on Karr's Algorithm Markus MullerOlm 1? and Helmut Seidl 2
- Advanced Solver Technology Helmut Seidl
- Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
- Constraint-Based Inter-Procedural Analysis of Parallel Programs
- UNIVERSITAT TRIER Mathematik / Informatik
- UNIVERSITAT TRIER Mathematik / Informatik
- Flat and One-Variable Clauses for Single Blind Copying Protocols: the XOR Case
- Approximative Methods for Monotone Systems of min-max-Polynomial Equations
- Advanced Solver Technology: Computing with Relations
- Precise Fixpoint Computation Through Strategy Thomas Gawlitza 1 and Helmut Seidl 1
- Nordic Journal of Computing PROPAGATING DIFFERENCES: AN EFFICIENT
- Macro Forest Transducers Thomas Perst Helmut Seidl
- Succinct Solvers Flemming Nielson 1 and Helmut Seidl 2
- Interprocedural Analysis Based on PDAs
- Shape Analysis of Low-level C with Overlapping Structures
- Games through Nested Fixpoints Thomas Martin Gawlitza and Helmut Seidl
- Polynomial Precise Interval Analysis Revisited Thomas Gawlitza1
- Precise Interval Analysis vs. Parity Games Thomas Gawlitza1
- Analysing All Polynomial Equations in Z2w Helmut Seidl, Andrea Flexeder and Michael Petter
- Interprocedurally Analysing Linear Inequality Helmut Seidl, Andrea Flexeder and Michael Petter
- Extreme Markup Languages 2002 Montral, Qubec August 6-9, 2002
- Binary Queries First Name: Alexandru
- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single
- Analysis of Modular Arithmetic MARKUS MULLER-OLM
- Advanced Solver Technology Helmut Seidl
- Electronic Notes in Theoretical Computer Science 62 (2002) URL: http://www.elsevier.nl/locate/entcs/volume62.html 17 pages
- On Distributive FixedPoint Expressions Helmut Seidl \Lambda Damian Niwi'nski y
- Constraints to Stop HigherOrder Deforestation FB IV Informatik
- Upper Adjoints for Fast Inter-procedural Variable Markus Muller-Olm1
- Exact XML Type Checking in Polynomial Time Sebastian Maneth 1 , Thomas Perst 2 , and Helmut Seidl 2
- On Guarding Nested Fixpoints Helmut Seidl Andreas Neumann
- XML Type Checking with Macro Tree Transducers Ecole Polytechnique F
- Least Solutions of Equations over N
- Analysis of Modular Arithmetic Markus MullerOlm 1 and Helmut Seidl 2
- Locating Matches of Tree Patterns in Forests Andreas Neumann and Helmut Seidl
- Computing Polynomial Program Invariants Markus MullerOlm #
- Nordic Journal of Computing 3(1996), 4061. LEAST AND GREATEST
- Presburger Arithmetic Helmut Seidl
- Querying and Transforming XML Documents
- A smooth combination of linear and Herbrand equalities for polynomial time must-alias analysis
- Constraints to Stop Deforestation FB IV Informatik, Universitat Trier,
- On Optimal Slicing of Parallel Programs Universit
- Nordic Journal of Computing BINARY QUERIES FOR DOCUMENT TREES
- Von MiniJava zur MiniJVM
- Precise Relational Invariants Through Strategy Thomas Gawlitza and Helmut Seidl
- fxt { A Transformation Language for XML Documents Alexandru Berlea, Helmut Seidl
- Normalizable Horn Clauses, Strongly Recognizable Relations
- Disjunctive Completion Is Not ``Optimal''
- Polynomial Precise Interval Analysis Revisited Thomas Gawlitza 1 , Jan Reineke 2 , Helmut Seidl 1 , and Reinhard Wilhelm 2
- Polynomial Constants are Decidable ? Markus Muller-Olm 1 and Helmut Seidl 2
- January 26, 2010 18:12 World Scientific Review Volume -9.75in x 6.5in maneth Type Checking of Tree Walking Transducers
- A Modal --Calculus for Durational Transition Systems
