Follow
Helmut Seidl
Helmut Seidl
Professor für Informatik, School of CIT, TU München
Verified email at in.tum.de - Homepage
Title
Cited by
Cited by
Year
Precise interprocedural analysis through linear algebra
M Müller-Olm, H Seidl
ACM SIGPLAN Notices 39 (1), 330-341, 2004
2322004
Deciding equivalence of finite tree automata
H Seidl
SIAM Journal on Computing 19 (3), 424-437, 1990
2101990
On the complexity of equational horn clauses
KN Verma, H Seidl, T Schwentick
International Conference on Automated Deduction, 337-352, 2005
1492005
On the degree of ambiguity of finite automata
A Weber, H Seidl
Theoretical Computer Science 88 (2), 325-349, 1991
1331991
Computing polynomial program invariants
M Müller-Olm, H Seidl
Information Processing Letters 91 (5), 233-244, 2004
1312004
XML type checking with macro tree transducers
S Maneth, A Berlea, T Perst, H Seidl
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on …, 2005
1292005
Haskell overloading is DEXPTIME-complete
H Seidl
Inf. Process. Lett. 52 (2), 57-60, 1994
1251994
Counting in trees for free
H Seidl, T Schwentick, A Muscholl, P Habermehl
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
1232004
A note on Karr’s algorithm
M Müller-Olm, H Seidl
International Colloquium on Automata, Languages, and Programming, 1016-1028, 2004
1182004
Locating matches of tree patterns in forests
A Neumann, H Seidl
Foundations of Software Technology and Theoretical Computer Science: 18th …, 1998
1131998
Precise fixpoint computation through strategy iteration
T Gawlitza, H Seidl
European symposium on programming, 300-315, 2007
1052007
Numerical document queries
H Seidl, T Schwentick, A Muscholl
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003
982003
A Succinct Solver for ALFP.
F Nielson, H Seidl, HR Nielson
Nord. J. Comput. 9 (4), 335-372, 2002
922002
Model checking information flow in reactive systems
R Dimitrova, B Finkbeiner, M Kovács, MN Rabe, H Seidl
Verification, Model Checking, and Abstract Interpretation: 13th …, 2012
912012
Fast and simple nested fixpoints
H Seidl
Information Processing Letters 59 (6), 303-308, 1996
891996
Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
C Fecht, H Seidl
European Symposium on Programming, 90-104, 1998
851998
Macro forest transducers
T Perst, H Seidl
Information Processing Letters 89 (3), 141-149, 2004
822004
Static race detection for device drivers: the Goblint approach
V Vojdani, K Apinis, V Rõtov, H Seidl, V Vene, R Vogler
Proceedings of the 31st IEEE/ACM International Conference on Automated …, 2016
802016
Analysis of modular arithmetic
M Müller-Olm, H Seidl
ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (5), 29-es, 2007
802007
Analysis of modular arithmetic
M Müller-Olm, H Seidl
Programming Languages and Systems: 14th European Symposium on Programming …, 2005
802005
The system can't perform the operation now. Try again later.
Articles 1–20