Prof. Dr. Helmut Seidl
Publications in Journals since 1994:
- Type Checking of TreeWalking Transducers
Sebastian Maneth, Sylvia Pott, Helmut Seidl. In:
Modern Applications of Automata Theory (Iisc Research Monographs),
Deepak D'Souza and Priti Shankar (eds.), World Scientific Publishing Ltd., approx. 2010
- Deciding equivalence of top-down XML transformations in polynomial time.
Joost Engelfriet, Sebastian Maneth, Helmut Seidl.
J. Comput. Syst. Sci. 75(5): 271-286 (2009)
- Flat and one-variable clauses:
Complexity of verifying cryptographic protocols with single blind copying.
Helmut Seidl, Kumar Neeraj Verma.
ACM Trans. Comput. Log. 9(4): (2008)
- Analysis of modular arithmetic.
Markus Müller-Olm, Helmut Seidl
ACM Trans. Program. Lang. Syst. 29(5), 2007.
- Infinite-State High-Level MSCs:
Model-Checking and Realizability.
Blaise Genest, Anca Muscholl,
Helmut Seidl, Marc Zeitoun.
Journal on Computing and System Sciences (JCSS), Vol. 72(4), 2006, 617-647
- Binary Queries for Document Trees.
Alexandru Berlea and Helmut Seidl.
Nordic Journal of Computing (NJC), vol. 11(1), 41-71, 2004.
- Computing Polynomial Program Invariants
Markus Müller-Olm,
Helmut Seidl.
Information Processing Letters (IPL), Vol. 91(5), 233-244, 2004.
- Macro Forest Transducers.
Thomas Perst and H. Seidl.
Inf. Process. Lett. (ILP) 89(3): 141-149 (2004)
- Global Invariants for Analysing Multi-Threaded Applications.
Helmut Seidl, Varmo Vene,
Markus Müller-Olm.
Proc. of Estonian Academy of Sciences: Phys., Math., v. 52, n. 4, pp. 413-436, 2003,(© Estonian Academy Publishers)
- A Succinct Solver for ALFP.
F. Nielson,
H. Riis Nielson, and H. Seidl.
Nordic Journal of Computing (NJC), vol. 9(4), 335-372, 2002
- Cryptographic analysis in cubic time.
F. Nielson,
H. Riis Nielson, and H. Seidl.
Electronic Notes of Theoretical Computer Science, 2002.
- fxt - A Transformation Language for XML Documents.
Helmut Seidl and Alexandru Berlea.
J. of Computing and Information Technology (CIT), 2002
Special Issue on Domain-Specific Languages. Guest Editors: M.Mernik and
Ralf Lämmel
- Constraint-Based Inter-Procedural Analysis of
Parallel Programs.
Helmut Seidl and
Bernhard
Steffen.
Nordic Journal of
Computing (NJC) 7 (4), 375-400, 2000
- On Distributive Fixed-Point Expressions.
Helmut Seidl and Damian Niwinski.
RAIRO 33(4/5), 427-446, 1999.
- Propagating Differences: An Efficient
New Fixpoint Algorithm for Distributive Constraint Systems.
Helmut Seidl and Christian Fecht.
Nordic Journal of
Computing (NJC), 5 (1998), 304-329.
- Interprocedural Analyses: A Comparison.
Helmut Seidl and Christian Fecht.
Journal of Logic Programming (JLP) 43(2), May 2000, 123-156.
- Constraints to Stop Higher-Order
Deforestation.
Helmut Seidl and Morten H. Sorensen.
Science of Computer Programming (SCP) 32 (1998), 73-107.
- A Faster Solver for General Systems
of Equations.
Helmut Seidl and
Christian Fecht.
Science of Computer Programming (SCP) 35 (2-3), 137-162, 1999.
- Fast and Simple Nested Fixpoints.
Helmut Seidl.
Information Processing Letters 59(6), 303-308, 1996.
- The Fork95 Parallel Programming Language:
Design, Implementation, Application.
Helmut Seidl and
Christoph Keßler.
Int. Journal on Parallel Programming 25(1), 17-50, 1997
- Haskell overloading is DEXPTIME-complete.
Helmut Seidl.
Information Processing Letters 52(2), 57-60, 1994.
- Least and Greatest Solutions of Equations over N.
Helmut Seidl.
Nordic Journal of Computing (NJC) 3, 41-62, 1996.
-
Tree Automata for Code Selection.
Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm.
Acta Informatica 31, 41-760, 1994
-
Tree Automata with Cost Functions.
Helmut Seidl.
Special Issue on CAAP'92, Theoretical Computer Science 126 (1994), 13-142
-
Equivalence of Finite-Valued Tree Transducers Is Decidable.
Helmut Seidl.
Mathematical System Theory 27, 85-346, 1994
Helmut Seidl - Journal Publications -
Jan. 26, 2010