×
Author ID: seidl.helmut Recent zbMATH articles by "Seidl, Helmut"
Published as: Seidl, Helmut

Publications by Year

Citations contained in zbMATH Open

101 Publications have been cited 643 times in 457 Documents Cited by Year
On the degree of ambiguity of finite automata. Zbl 0738.68059
Weber, Andreas; Seidl, Helmut
46
1991
Deciding equivalence of finite tree automata. Zbl 0699.68075
Seidl, Helmut
43
1990
Precise interprocedural analysis through linear algebra. Zbl 1325.68068
Müller-Olm, Markus; Seidl, Helmut
33
2004
Haskell overloading is DEXPTIME-complete. Zbl 0835.68008
Seidl, Helmut
26
1994
Precise fixpoint computation through strategy iteration. Zbl 1187.68152
Gawlitza, Thomas; Seidl, Helmut
25
2007
Computing polynomial program invariants. Zbl 1177.68048
Müller-Olm, Markus; Seidl, Helmut
23
2004
On the complexity of equational Horn clauses. Zbl 1135.94331
Verma, Kumar Neeraj; Seidl, Helmut; Schwentick, Thomas
20
2005
Counting in trees for free. Zbl 1099.03010
Seidl, Helmut; Schwentick, Thomas; Muscholl, Anca; Habermehl, Peter
19
2004
Fast and simple nested fixpoints. Zbl 0900.68458
Seidl, Helmut
19
1996
Macro forest transducers. Zbl 1178.68177
Perst, Thomas; Seidl, Helmut
14
2004
A note on Karr’s algorithm. Zbl 1099.68022
Müller-Olm, Markus; Seidl, Helmut
13
2004
Finite tree automata with cost functions. Zbl 0805.68085
Seidl, Helmut
12
1994
Control-flow analysis in cubic time. Zbl 0977.68520
Nielson, Flemming; Seidl, Helmut
11
2001
Analysis of modular arithmetic. Zbl 1108.68404
Müller-Olm, Markus; Seidl, Helmut
11
2005
On the finite degree of ambiguity of finite tree automata. Zbl 0683.68049
Seidl, Helmut
11
1989
Deciding equivalence of top-down XML transformations in polynomial time. Zbl 1167.68032
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
11
2009
A succinct solver for ALFP. Zbl 1088.68774
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
9
2002
Polynomial constants are decidable. Zbl 1015.68043
Müller-Olm, Markus; Seidl, Helmut
9
2002
Normalizable Horn clauses, strongly recognizable relations, and Spi. Zbl 1015.68042
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
9
2002
On finitely generated monoids of matrices with entries in \({\mathbb{N}}\). Zbl 0721.20042
Weber, Andreas; Seidl, Helmut
9
1991
Equivalence of deterministic top-down tree-to-string transducers is decidable. Zbl 1426.68154
Seidl, Helmut; Maneth, Sebastian; Kemper, Gregor
9
2018
Precise relational invariants through strategy iteration. Zbl 1179.68037
Gawlitza, Thomas; Seidl, Helmut
9
2007
Tree automata for code selection. Zbl 0820.68031
Ferdinand, Christian; Seidl, Helmut; Wilhelm, Reinhard
8
1994
Single-valuedness of tree transducers is decidable in polynomial time. Zbl 0783.68086
Seidl, Helmut
8
1992
Infinite-state high-level MSCs: Model-checking and realizability (extended abstract). Zbl 1057.68625
Genest, Blaise; Muscholl, Anca; Seidl, Helmut; Zeitoun, Marc
8
2002
Games through nested fixpoints. Zbl 1242.68160
Gawlitza, Thomas Martin; Seidl, Helmut
8
2009
Counting in trees. Zbl 1226.03049
Seidl, Helmut; Schwentick, Thomas; Muscholl, Anca
8
2008
Computing relaxed abstract semantics w.r.t. quadratic zones precisely. Zbl 1306.68025
Gawlitza, Thomas Martin; Seidl, Helmut
8
2010
Checking Herbrand equalities and beyond. Zbl 1112.68094
Müller-Olm, Markus; Rüthing, Oliver; Seidl, Helmut
7
2005
Approximative methods for monotone systems of min-max-polynomial equations. Zbl 1153.65337
Esparza, Javier; Gawlitza, Thomas; Kiefer, Stefan; Seidl, Helmut
7
2008
Model checking information flow in reactive systems. Zbl 1326.68182
Dimitrova, Rayna; Finkbeiner, Bernd; Kovács, Máté; Rabe, Markus N.; Seidl, Helmut
7
2012
Equivalence of finite-valued bottom-up finite state tree transducers is decidable. Zbl 0758.68049
Seidl, Helmut
6
1990
A faster solver for general systems of equations. Zbl 0948.68016
Fecht, Christian; Seidl, Helmut
6
1999
Equivalence of finite-valued tree transducers is decidable. Zbl 0809.68087
Seidl, H.
6
1994
Synchronized tree languages revisited and new applications. Zbl 0986.68052
Gouranton, Valérie; Réty, Pierre; Seidl, Helmut
6
2001
On the degree of ambiguity of finite automata. Zbl 0617.68055
Weber, Andreas; Seidl, Helmut
6
1986
Infinite-state high-level MSCs: model-checking and realizability. Zbl 1105.68071
Genest, Blaise; Muscholl, Anca; Seidl, Helmut; Zeitoun, Marc
6
2006
The succinct solver suite. Zbl 1126.68354
Nielson, Flemming; Nielson, Hanne Riis; Sun, Hongyan; Buchholtz, Mikael; Hansen, René Rydhof; Pilegaard, Henrik; Seidl, Helmut
6
2004
Interprocedurally analyzing polynomial identities. Zbl 1136.68356
Müller-Olm, Markus; Petter, Michael; Seidl, Helmut
6
2006
Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems. Zbl 0918.68009
Fecht, Christian; Seidl, Helmut
5
1998
Abstract interpretation meets convex optimization. Zbl 1246.90118
Gawlitza, Thomas Martin; Seidl, Helmut; Adjé, Assalé; Gaubert, Stéphane; Goubault, Éric
5
2012
Compiler design. Analysis and transformation. Zbl 1257.68004
Seidl, Helmut; Wilhelm, Reinhard; Hack, Sebastian
5
2012
Enhancing top-down solving with widening and narrowing. Zbl 1474.68043
Apinis, Kalmer; Seidl, Helmut; Vojdani, Vesal
5
2016
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. Zbl 1317.68031
Gawlitza, Thomas Martin; Lammich, Peter; Müller-Olm, Markus; Seidl, Helmut; Wenner, Alexander
5
2011
Characterizing complexity classes by higher type primitive recursive definitions. II. Zbl 0743.03030
Goerdt, Andreas; Seidl, Helmut
4
1990
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. Zbl 1108.68465
Seidl, Helmut; Verma, Kumar Neeraj
4
2005
Automatic complexity analysis. Zbl 1077.68610
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
4
2002
Binary queries for document trees. Zbl 1090.68537
Berlea, Alexandru; Seidl, Helmut
4
2004
Extending \({\mathcal H}_1\)-clauses with path disequalities. Zbl 1352.68118
Seidl, Helmut; Reuß, Andreas
4
2012
On optimal slicing of parallel programs. Zbl 1323.68316
Müller-Olm, Markus; Seidl, Helmut
4
2001
Deciding equivalence of finite tree automata. Zbl 1492.68081
Seidl, Helmut
4
1989
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. Zbl 1284.68199
Schwarz, Martin D.; Seidl, Helmut; Vojdani, Vesal; Lammich, Peter; Müller-Olm, Markus
3
2011
Interprocedural Herbrand equalities. Zbl 1108.68405
Müller-Olm, Markus; Seidl, Helmut; Steffen, Bernhard
3
2005
On guarding nested fixpoints. Zbl 0944.03023
Seidl, Helmut; Neumann, Andreas
3
1999
Polynomial precise interval analysis revisited. Zbl 1258.65048
Gawlitza, Thomas; Leroux, Jérôme; Reineke, Jan; Seidl, Helmut; Sutre, Grégoire; Wilhelm, Reinhard
3
2009
Enforcing termination of interprocedural analysis. Zbl 1394.68086
Schulze Frielinghaus, Stefan; Seidl, Helmut; Vogler, Ralf
3
2016
Computing the longest common prefix of a context-free language in polynomial time. Zbl 1487.68150
Luttenberger, Michael; Palenta, Raphaela; Seidl, Helmut
3
2018
Definability results for top-down tree transducers. Zbl 1518.68185
Maneth, Sebastian; Seidl, Helmut; Vu, Martin
3
2021
Shape analysis of low-level C with overlapping structures. Zbl 1273.68086
Kreiker, Jörg; Seidl, Helmut; Vojdani, Vesal
3
2010
Look-ahead removal for total deterministic top-down tree transducers. Zbl 1333.68163
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
3
2016
An even faster solver for general systems of equations. Zbl 1482.68088
Fecht, Christian; Seidl, Helmut
3
1996
What is a pure functional? Zbl 1288.68037
Hofmann, Martin; Karbyshev, Aleksandr; Seidl, Helmut
3
2010
Bottom-up tree automata with term constraints. Zbl 1306.68096
Reuß, Andreas; Seidl, Helmut
3
2010
Cryptographic analysis in cubic time. Zbl 1268.94029
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
3
2002
Compiler design. Syntactic and semantic analysis. Zbl 1273.68077
Wilhelm, Reinhard; Seidl, Helmut; Hack, Sebastian
3
2013
Extending \(H_1\)-clauses with disequalities. Zbl 1260.68115
Seidl, Helmut; Reuß, Andreas
3
2011
Constraint-based inter-procedural analysis of parallel programs. Zbl 0960.68035
Seidl, Helmut; Steffen, Bernhard
2
2000
Constraint-based inter-procedural analysis of parallel programs. Zbl 0970.68034
Seidl, Helmut; Steffen, Bernhard
2
2000
On the finite degree of ambiguity of finite tree automata. Zbl 0802.68086
Seidl, Helmut
2
1989
Ambiguity and valuedness. Zbl 0798.68107
Seidl, Helmut
2
1992
Region analysis for race detection. Zbl 1248.68152
Seidl, Helmut; Vojdani, Vesal
2
2009
Upper adjoints for fast inter-procedural variable equalities. Zbl 1133.68321
Müller-Olm, Markus; Seidl, Helmut
2
2008
Computing game values for crash games. Zbl 1141.91345
Gawlitza, Thomas; Seidl, Helmut
2
2007
Balancedness of MSO transductions in polynomial time. Zbl 1426.68150
Maneth, S.; Seidl, H.
2
2018
Global invariants for analysing multi-threaded applications. Zbl 1091.68520
Seidl, Helmut; Vene, Varmo; Müller-Olm, Markus
2
2003
How to decide functionality of compositions of top-down tree transducers. Zbl 07719139
Maneth, Sebastian; Seidl, Helmut; Vu, Martin
2
2022
Transforming XML documents using fxt. Zbl 1037.68043
Berlea, Alexandru; Seidl, Helmut
1
2002
On distributive fixed-point expressions. Zbl 0945.68127
Seidl, Helmut; Niwiński, Damian
1
1999
Interprocedural analyses: A comparison. Zbl 0951.68013
Seidl, Helmut; Fecht, Christian
1
2000
Weakly regular relations and applications. Zbl 0981.68083
Limet, Sébastien; Réty, Pierre; Seidl, Helmut
1
2001
Numerical invariants through convex relaxation and max-strategy iteration. Zbl 1291.68256
Gawlitza, Thomas Martin; Seidl, Helmut
1
2014
Deciding equivalence of separated non-nested attribute systems in polynomial time. Zbl 1524.68166
Seidl, Helmut; Palenta, Raphaela; Maneth, Sebastian
1
2019
Cryptographic protocol verification using tractable classes of Horn clauses. Zbl 1149.68380
Seidl, Helmut; Verma, Kumar Neeraj
1
2007
Flat and one-variable clauses for single blind copying protocols: the XOR case. Zbl 1242.94032
Seidl, Helmut; Verma, Kumar Neeraj
1
2009
Enforcing termination of interprocedural analysis. Zbl 1425.68083
Schulze Frielinghaus, Stefan; Seidl, Helmut; Vogler, Ralf
1
2018
Specifying and verifying secrecy in workflows with arbitrarily many agents. Zbl 1398.68341
Finkbeiner, Bernd; Seidl, Helmut; Müller, Christian
1
2016
Incremental abstract interpretation. Zbl 1440.68047
Seidl, Helmut; Erhard, Julian; Vogler, Ralf
1
2020
How to win first-order safety games. Zbl 07228518
Seidl, Helmut; Müller, Christian; Finkbeiner, Bernd
1
2020
How to remove the look-ahead of top-down tree transducers. Zbl 1298.68132
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
1
2014
Precise analysis of value-dependent synchronization in priority scheduled programs. Zbl 1428.68120
Schwarz, Martin D.; Seidl, Helmut; Vojdani, Vesal; Apinis, Kalmer
1
2014
Inter-procedural two-variable Herbrand equalities. Zbl 1335.68066
Schulze Frielinghaus, Stefan; Petter, Michael; Seidl, Helmut
1
2015
When is a functional tree transduction deterministic? Zbl 1497.68280
Seidl, Helmut
1
1993
Counterexample- and simulation-guided floating-point loop invariant synthesis. Zbl 1474.68055
Izycheva, Anastasiia; Darulova, Eva; Seidl, Helmut
1
2020
Verifying a local generic solver in Coq. Zbl 1306.68029
Hofmann, Martin; Karbyshev, Aleksandr; Seidl, Helmut
1
2010
Crossing the syntactic barrier: hom-disequalities for \({\mathcal H}_1\)-clauses. Zbl 1297.68058
Reuß, Andreas; Seidl, Helmut
1
2012
Compiler design. Virtual machines. Zbl 1209.68117
Wilhelm, Reinhard; Seidl, Helmut
1
2010
Earliest normal form and minimization for bottom-up tree transducers. Zbl 1252.68170
Friese, Sylvia; Seidl, Helmut; Maneth, Sebastian
1
2011
Type checking of tree walking transducers. Zbl 1256.68106
Maneth, Sebastian; Friese, Sylvia; Seidl, Helmut
1
2012
Equivalence of linear tree transducers with output in the free group. Zbl 07601072
Löbel, Raphaela; Luttenberger, Michael; Seidl, Helmut
1
2020
Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying. Zbl 1367.68113
Seidl, Helmut; Verma, Kumar Neeraj
1
2008
How to decide functionality of compositions of top-down tree transducers. Zbl 07719139
Maneth, Sebastian; Seidl, Helmut; Vu, Martin
2
2022
Definability results for top-down tree transducers. Zbl 1518.68185
Maneth, Sebastian; Seidl, Helmut; Vu, Martin
3
2021
On the balancedness of tree-to-word transducers. Zbl 1518.68184
Löbel, Raphaela; Luttenberger, Michael; Seidl, Helmut
1
2021
Incremental abstract interpretation. Zbl 1440.68047
Seidl, Helmut; Erhard, Julian; Vogler, Ralf
1
2020
How to win first-order safety games. Zbl 07228518
Seidl, Helmut; Müller, Christian; Finkbeiner, Bernd
1
2020
Counterexample- and simulation-guided floating-point loop invariant synthesis. Zbl 1474.68055
Izycheva, Anastasiia; Darulova, Eva; Seidl, Helmut
1
2020
Equivalence of linear tree transducers with output in the free group. Zbl 07601072
Löbel, Raphaela; Luttenberger, Michael; Seidl, Helmut
1
2020
Deciding equivalence of separated non-nested attribute systems in polynomial time. Zbl 1524.68166
Seidl, Helmut; Palenta, Raphaela; Maneth, Sebastian
1
2019
Equivalence of deterministic top-down tree-to-string transducers is decidable. Zbl 1426.68154
Seidl, Helmut; Maneth, Sebastian; Kemper, Gregor
9
2018
Computing the longest common prefix of a context-free language in polynomial time. Zbl 1487.68150
Luttenberger, Michael; Palenta, Raphaela; Seidl, Helmut
3
2018
Balancedness of MSO transductions in polynomial time. Zbl 1426.68150
Maneth, S.; Seidl, H.
2
2018
Enforcing termination of interprocedural analysis. Zbl 1425.68083
Schulze Frielinghaus, Stefan; Seidl, Helmut; Vogler, Ralf
1
2018
Enhancing top-down solving with widening and narrowing. Zbl 1474.68043
Apinis, Kalmer; Seidl, Helmut; Vojdani, Vesal
5
2016
Enforcing termination of interprocedural analysis. Zbl 1394.68086
Schulze Frielinghaus, Stefan; Seidl, Helmut; Vogler, Ralf
3
2016
Look-ahead removal for total deterministic top-down tree transducers. Zbl 1333.68163
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
3
2016
Specifying and verifying secrecy in workflows with arbitrarily many agents. Zbl 1398.68341
Finkbeiner, Bernd; Seidl, Helmut; Müller, Christian
1
2016
Inter-procedural two-variable Herbrand equalities. Zbl 1335.68066
Schulze Frielinghaus, Stefan; Petter, Michael; Seidl, Helmut
1
2015
Numerical invariants through convex relaxation and max-strategy iteration. Zbl 1291.68256
Gawlitza, Thomas Martin; Seidl, Helmut
1
2014
How to remove the look-ahead of top-down tree transducers. Zbl 1298.68132
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
1
2014
Precise analysis of value-dependent synchronization in priority scheduled programs. Zbl 1428.68120
Schwarz, Martin D.; Seidl, Helmut; Vojdani, Vesal; Apinis, Kalmer
1
2014
Compiler design. Syntactic and semantic analysis. Zbl 1273.68077
Wilhelm, Reinhard; Seidl, Helmut; Hack, Sebastian
3
2013
Model checking information flow in reactive systems. Zbl 1326.68182
Dimitrova, Rayna; Finkbeiner, Bernd; Kovács, Máté; Rabe, Markus N.; Seidl, Helmut
7
2012
Abstract interpretation meets convex optimization. Zbl 1246.90118
Gawlitza, Thomas Martin; Seidl, Helmut; Adjé, Assalé; Gaubert, Stéphane; Goubault, Éric
5
2012
Compiler design. Analysis and transformation. Zbl 1257.68004
Seidl, Helmut; Wilhelm, Reinhard; Hack, Sebastian
5
2012
Extending \({\mathcal H}_1\)-clauses with path disequalities. Zbl 1352.68118
Seidl, Helmut; Reuß, Andreas
4
2012
Crossing the syntactic barrier: hom-disequalities for \({\mathcal H}_1\)-clauses. Zbl 1297.68058
Reuß, Andreas; Seidl, Helmut
1
2012
Type checking of tree walking transducers. Zbl 1256.68106
Maneth, Sebastian; Friese, Sylvia; Seidl, Helmut
1
2012
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. Zbl 1317.68031
Gawlitza, Thomas Martin; Lammich, Peter; Müller-Olm, Markus; Seidl, Helmut; Wenner, Alexander
5
2011
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. Zbl 1284.68199
Schwarz, Martin D.; Seidl, Helmut; Vojdani, Vesal; Lammich, Peter; Müller-Olm, Markus
3
2011
Extending \(H_1\)-clauses with disequalities. Zbl 1260.68115
Seidl, Helmut; Reuß, Andreas
3
2011
Earliest normal form and minimization for bottom-up tree transducers. Zbl 1252.68170
Friese, Sylvia; Seidl, Helmut; Maneth, Sebastian
1
2011
Computing relaxed abstract semantics w.r.t. quadratic zones precisely. Zbl 1306.68025
Gawlitza, Thomas Martin; Seidl, Helmut
8
2010
Shape analysis of low-level C with overlapping structures. Zbl 1273.68086
Kreiker, Jörg; Seidl, Helmut; Vojdani, Vesal
3
2010
What is a pure functional? Zbl 1288.68037
Hofmann, Martin; Karbyshev, Aleksandr; Seidl, Helmut
3
2010
Bottom-up tree automata with term constraints. Zbl 1306.68096
Reuß, Andreas; Seidl, Helmut
3
2010
Verifying a local generic solver in Coq. Zbl 1306.68029
Hofmann, Martin; Karbyshev, Aleksandr; Seidl, Helmut
1
2010
Compiler design. Virtual machines. Zbl 1209.68117
Wilhelm, Reinhard; Seidl, Helmut
1
2010
Deciding equivalence of top-down XML transformations in polynomial time. Zbl 1167.68032
Engelfriet, Joost; Maneth, Sebastian; Seidl, Helmut
11
2009
Games through nested fixpoints. Zbl 1242.68160
Gawlitza, Thomas Martin; Seidl, Helmut
8
2009
Polynomial precise interval analysis revisited. Zbl 1258.65048
Gawlitza, Thomas; Leroux, Jérôme; Reineke, Jan; Seidl, Helmut; Sutre, Grégoire; Wilhelm, Reinhard
3
2009
Region analysis for race detection. Zbl 1248.68152
Seidl, Helmut; Vojdani, Vesal
2
2009
Flat and one-variable clauses for single blind copying protocols: the XOR case. Zbl 1242.94032
Seidl, Helmut; Verma, Kumar Neeraj
1
2009
Counting in trees. Zbl 1226.03049
Seidl, Helmut; Schwentick, Thomas; Muscholl, Anca
8
2008
Approximative methods for monotone systems of min-max-polynomial equations. Zbl 1153.65337
Esparza, Javier; Gawlitza, Thomas; Kiefer, Stefan; Seidl, Helmut
7
2008
Upper adjoints for fast inter-procedural variable equalities. Zbl 1133.68321
Müller-Olm, Markus; Seidl, Helmut
2
2008
Flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying. Zbl 1367.68113
Seidl, Helmut; Verma, Kumar Neeraj
1
2008
Precise fixpoint computation through strategy iteration. Zbl 1187.68152
Gawlitza, Thomas; Seidl, Helmut
25
2007
Precise relational invariants through strategy iteration. Zbl 1179.68037
Gawlitza, Thomas; Seidl, Helmut
9
2007
Computing game values for crash games. Zbl 1141.91345
Gawlitza, Thomas; Seidl, Helmut
2
2007
Cryptographic protocol verification using tractable classes of Horn clauses. Zbl 1149.68380
Seidl, Helmut; Verma, Kumar Neeraj
1
2007
Infinite-state high-level MSCs: model-checking and realizability. Zbl 1105.68071
Genest, Blaise; Muscholl, Anca; Seidl, Helmut; Zeitoun, Marc
6
2006
Interprocedurally analyzing polynomial identities. Zbl 1136.68356
Müller-Olm, Markus; Petter, Michael; Seidl, Helmut
6
2006
On the complexity of equational Horn clauses. Zbl 1135.94331
Verma, Kumar Neeraj; Seidl, Helmut; Schwentick, Thomas
20
2005
Analysis of modular arithmetic. Zbl 1108.68404
Müller-Olm, Markus; Seidl, Helmut
11
2005
Checking Herbrand equalities and beyond. Zbl 1112.68094
Müller-Olm, Markus; Rüthing, Oliver; Seidl, Helmut
7
2005
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. Zbl 1108.68465
Seidl, Helmut; Verma, Kumar Neeraj
4
2005
Interprocedural Herbrand equalities. Zbl 1108.68405
Müller-Olm, Markus; Seidl, Helmut; Steffen, Bernhard
3
2005
Precise interprocedural analysis through linear algebra. Zbl 1325.68068
Müller-Olm, Markus; Seidl, Helmut
33
2004
Computing polynomial program invariants. Zbl 1177.68048
Müller-Olm, Markus; Seidl, Helmut
23
2004
Counting in trees for free. Zbl 1099.03010
Seidl, Helmut; Schwentick, Thomas; Muscholl, Anca; Habermehl, Peter
19
2004
Macro forest transducers. Zbl 1178.68177
Perst, Thomas; Seidl, Helmut
14
2004
A note on Karr’s algorithm. Zbl 1099.68022
Müller-Olm, Markus; Seidl, Helmut
13
2004
The succinct solver suite. Zbl 1126.68354
Nielson, Flemming; Nielson, Hanne Riis; Sun, Hongyan; Buchholtz, Mikael; Hansen, René Rydhof; Pilegaard, Henrik; Seidl, Helmut
6
2004
Binary queries for document trees. Zbl 1090.68537
Berlea, Alexandru; Seidl, Helmut
4
2004
Global invariants for analysing multi-threaded applications. Zbl 1091.68520
Seidl, Helmut; Vene, Varmo; Müller-Olm, Markus
2
2003
A succinct solver for ALFP. Zbl 1088.68774
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
9
2002
Polynomial constants are decidable. Zbl 1015.68043
Müller-Olm, Markus; Seidl, Helmut
9
2002
Normalizable Horn clauses, strongly recognizable relations, and Spi. Zbl 1015.68042
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
9
2002
Infinite-state high-level MSCs: Model-checking and realizability (extended abstract). Zbl 1057.68625
Genest, Blaise; Muscholl, Anca; Seidl, Helmut; Zeitoun, Marc
8
2002
Automatic complexity analysis. Zbl 1077.68610
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
4
2002
Cryptographic analysis in cubic time. Zbl 1268.94029
Nielson, Flemming; Nielson, Hanne Riis; Seidl, Helmut
3
2002
Transforming XML documents using fxt. Zbl 1037.68043
Berlea, Alexandru; Seidl, Helmut
1
2002
Control-flow analysis in cubic time. Zbl 0977.68520
Nielson, Flemming; Seidl, Helmut
11
2001
Synchronized tree languages revisited and new applications. Zbl 0986.68052
Gouranton, Valérie; Réty, Pierre; Seidl, Helmut
6
2001
On optimal slicing of parallel programs. Zbl 1323.68316
Müller-Olm, Markus; Seidl, Helmut
4
2001
Weakly regular relations and applications. Zbl 0981.68083
Limet, Sébastien; Réty, Pierre; Seidl, Helmut
1
2001
Constraint-based inter-procedural analysis of parallel programs. Zbl 0960.68035
Seidl, Helmut; Steffen, Bernhard
2
2000
Constraint-based inter-procedural analysis of parallel programs. Zbl 0970.68034
Seidl, Helmut; Steffen, Bernhard
2
2000
Interprocedural analyses: A comparison. Zbl 0951.68013
Seidl, Helmut; Fecht, Christian
1
2000
A faster solver for general systems of equations. Zbl 0948.68016
Fecht, Christian; Seidl, Helmut
6
1999
On guarding nested fixpoints. Zbl 0944.03023
Seidl, Helmut; Neumann, Andreas
3
1999
On distributive fixed-point expressions. Zbl 0945.68127
Seidl, Helmut; Niwiński, Damian
1
1999
Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems. Zbl 0918.68009
Fecht, Christian; Seidl, Helmut
5
1998
Fast and simple nested fixpoints. Zbl 0900.68458
Seidl, Helmut
19
1996
An even faster solver for general systems of equations. Zbl 1482.68088
Fecht, Christian; Seidl, Helmut
3
1996
Haskell overloading is DEXPTIME-complete. Zbl 0835.68008
Seidl, Helmut
26
1994
Finite tree automata with cost functions. Zbl 0805.68085
Seidl, Helmut
12
1994
Tree automata for code selection. Zbl 0820.68031
Ferdinand, Christian; Seidl, Helmut; Wilhelm, Reinhard
8
1994
Equivalence of finite-valued tree transducers is decidable. Zbl 0809.68087
Seidl, H.
6
1994
When is a functional tree transduction deterministic? Zbl 1497.68280
Seidl, Helmut
1
1993
Single-valuedness of tree transducers is decidable in polynomial time. Zbl 0783.68086
Seidl, Helmut
8
1992
Ambiguity and valuedness. Zbl 0798.68107
Seidl, Helmut
2
1992
On the degree of ambiguity of finite automata. Zbl 0738.68059
Weber, Andreas; Seidl, Helmut
46
1991
On finitely generated monoids of matrices with entries in \({\mathbb{N}}\). Zbl 0721.20042
Weber, Andreas; Seidl, Helmut
9
1991
Deciding equivalence of finite tree automata. Zbl 0699.68075
Seidl, Helmut
43
1990
Equivalence of finite-valued bottom-up finite state tree transducers is decidable. Zbl 0758.68049
Seidl, Helmut
6
1990
Characterizing complexity classes by higher type primitive recursive definitions. II. Zbl 0743.03030
Goerdt, Andreas; Seidl, Helmut
4
1990
On the finite degree of ambiguity of finite tree automata. Zbl 0683.68049
Seidl, Helmut
11
1989
Deciding equivalence of finite tree automata. Zbl 1492.68081
Seidl, Helmut
4
1989
On the finite degree of ambiguity of finite tree automata. Zbl 0802.68086
Seidl, Helmut
2
1989
...and 1 more Documents
all top 5

Cited by 662 Authors

41 Seidl, Helmut
11 Maneth, Sebastian
11 Nielson, Flemming
10 Riis Nielson, Hanne
9 Kiefer, Stefan
9 Salomaa, Kai T.
9 Walukiewicz, Igor
9 Worrell, James B.
8 Gawlitza, Thomas Martin
8 Luttenberger, Michael
8 Maletti, Andreas
8 Niehren, Joachim
7 Atig, Mohamed Faouzi
7 Droste, Manfred
7 Engelfriet, Joost
7 Filiot, Emmanuel
7 Martens, Wim
7 Mazowiecki, Filip
7 Reps, Thomas W.
7 Vogler, Heiko
6 Esparza, Javier
6 Lange, Martin
6 Muscholl, Anca
6 Neven, Frank
6 Randour, Mickael
5 Bodei, Chiara
5 Bouajjani, Ahmed
5 Goubault-Larrecq, Jean
5 Jacquemard, Florent
5 Kupferman, Orna
5 Kuske, Dietrich
5 Lal, Akash
5 L’vov, M. S.
5 Raskin, Jean-François
5 Sankaranarayanan, Sriram
5 Weber, Andreas
4 Adjé, Assalé
4 Almagor, Shaull
4 Baader, Franz
4 Boiret, Adrien
4 Etessami, Kousha
4 Fijalkow, Nathanaël
4 Genest, Blaise
4 Goubault, Eric
4 Inaba, Kazuhiro
4 Kapur, Deepak
4 Kovács, Laura Ildikó
4 Löding, Christof
4 Lugiez, Denis
4 Müller-Olm, Markus
4 Réty, Pierre
4 Reynier, Pierre-Alain
4 Riveros, Cristian
4 Touili, Tayssir
4 Verma, Kumar Neeraj
4 Vu, Martin
4 Yannakakis, Mihalis
3 André, Yves
3 Bell, Paul C.
3 Bojańczyk, Mikołaj
3 Boker, Udi
3 Bollig, Benedikt
3 Brihaye, Thomas
3 Clemente, Lorenzo
3 Comon, Hubert
3 Cortesi, Agostino
3 Cortier, Véronique
3 Degano, Pierpaolo
3 Demri, Stéphane P.
3 Finkbeiner, Bernd
3 Focardi, Riccardo
3 Fülöp, Zoltán
3 Garoche, Pierre-Loïc
3 Gastin, Paul
3 Gaubert, Stéphane
3 Gauwin, Olivier
3 Hansen, René Rydhof
3 Henzinger, Thomas A.
3 Jurdziński, Marcin
3 Keeler, Chris
3 King, Andy
3 Liberti, Leo
3 Löbel, Raphaela
3 Lohrey, Markus
3 Lombardy, Sylvain
3 Marinelli, Fabrizio
3 Monniaux, David P.
3 Narendran, Paliath
3 Nász, Andreea-Teodora
3 Ouaknine, Joel O.
3 Pai, Rekha R.
3 Paul, Erik
3 Pérez, Guillermo A.
3 Podelski, Andreas
3 Reuß, Andreas
3 Rival, Xavier
3 Saivasan, Prakash
3 Stewart, Alistair
3 Vardi, Moshe Ya’akov
3 Vogler, Ralf
...and 562 more Authors
all top 5

Cited in 53 Serials

50 Theoretical Computer Science
42 Information and Computation
18 Journal of Computer and System Sciences
17 Formal Methods in System Design
15 Theory of Computing Systems
14 Information Processing Letters
13 International Journal of Foundations of Computer Science
10 Acta Informatica
9 Journal of Symbolic Computation
9 Logical Methods in Computer Science
7 Journal of Automated Reasoning
6 Formal Aspects of Computing
6 The Journal of Logic and Algebraic Programming
5 Cybernetics and Systems Analysis
5 Computer Languages, Systems & Structures
4 Science of Computer Programming
4 MSCS. Mathematical Structures in Computer Science
4 RAIRO. Informatique Théorique et Applications
4 Journal of Logical and Algebraic Methods in Programming
3 RAIRO. Theoretical Informatics and Applications
3 ACM Transactions on Computational Logic
2 Mathematical Systems Theory
2 Higher-Order and Symbolic Computation
2 Journal of Systems Science and Complexity
2 Theory and Practice of Logic Programming
2 Nonlinear Analysis. Hybrid Systems
1 Discrete Mathematics
1 Journal of Mathematical Analysis and Applications
1 Fuzzy Sets and Systems
1 Information Sciences
1 The Journal of Symbolic Logic
1 Mathematics of Operations Research
1 Programming and Computer Software
1 SIAM Journal on Computing
1 Annals of Pure and Applied Logic
1 Algorithmica
1 International Journal of Approximate Reasoning
1 SIAM Journal on Discrete Mathematics
1 Journal of Cryptology
1 Random Structures & Algorithms
1 European Journal of Operational Research
1 International Journal of Computer Mathematics
1 Applicable Algebra in Engineering, Communication and Computing
1 SIAM Journal on Scientific Computing
1 Annals of Mathematics and Artificial Intelligence
1 Journal of Combinatorial Optimization
1 Journal of the ACM
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Fundamenta Informaticae
1 Central European Journal of Mathematics
1 Journal of Applied Logic
1 Frontiers of Computer Science in China

Citations by Year