Helmut Seidl

Citeras av

	Alla	Sedan 2018
Citat	5050	931
h-index	41	15
i10-index	109	24

300

150

225

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202314 29 12 26 17 41 65 61 36 51 59 82 121 183 266 234 254 264 236 255 275 296 242 223 258 198 220 197 166 164 189 183 32

Offentlig åtkomst

Visa alla

21 artiklar

2 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Sebastian ManethProfessor für Informatik, Universität BremenVerifierad e-postadress på uni-bremen.de
Vesal VojdaniUniversity of TartuVerifierad e-postadress på ut.ee
Sebastian HackProfessor of Computer Science, Saarland University, Saarland Informatics CampusVerifierad e-postadress på cs.uni-saarland.de
Reinhard WilhelmComputer Science, Saarland University, Saarland Informatics Campus (SIC)Verifierad e-postadress på cs.uni-saarland.de
Flemming NielsonProfessor at DTU Applied Mathematics and Computer ScienceVerifierad e-postadress på imm.dtu.dk
Anca MuschollLaBRI, Univ. of BordeauxVerifierad e-postadress på labri.fr
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerifierad e-postadress på udo.edu
Hanne Riis Nielsonprofessor at DTU Applied Mathematics and Computer ScienceVerifierad e-postadress på imm.dtu.dk
Kalmer ApinisInstitute of Computer Science, University of TartuVerifierad e-postadress på ut.ee
Bernd FinkbeinerProfessor of Computer Science, CISPA Helmholtz Center for Information SecurityVerifierad e-postadress på cispa.de
Christoph KesslerLinköping UniversityVerifierad e-postadress på liu.se
Ralf VoglerInformatik, TU MünchenVerifierad e-postadress på tum.de
Peter LammichThe University of ManchesterVerifierad e-postadress på in.tum.de
Bernhard SteffenProfessor für Informatik, TU DortmundVerifierad e-postadress på cs.uni-dortmund.de
Varmo VeneProfessor of Semantics of Programming Languages, University of TartuVerifierad e-postadress på cs.ut.ee
Peter HabermehlAssistant Professor of Computer Science, IRIF, University Paris CitéVerifierad e-postadress på irif.fr
Joost Engelfrietassociate professor, LIACS, Leiden UniversityVerifierad e-postadress på liacs.leidenuniv.nl
Christian FerdinandVerifierad e-postadress på absint.com
Aleksandr KarbyshevHeliaxVerifierad e-postadress på heliax.dev
Eugen ZalinescuNomadic LabsVerifierad e-postadress på nomadic-labs.com

Följ

Helmut Seidl

Professor für Informatik, TU München

Verifierad e-postadress på in.tum.de - Startsida

static analysis of programs fixpoint algorithms strategy iteration tree automata


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Precise interprocedural analysis through linear algebra M Müller-Olm, H Seidl ACM SIGPLAN Notices 39 (1), 330-341, 2004	226	2004
Deciding equivalence of finite tree automata H Seidl SIAM Journal on Computing 19 (3), 424-437, 1990	205	1990
On the complexity of equational horn clauses KN Verma, H Seidl, T Schwentick Automated Deduction–CADE-20: 20th International Conference on Automated …, 2005	130	2005
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	126	2005
Haskell overloading is DEXPTIME-complete H Seidl Inf. Process. Lett. 52 (2), 57-60, 1994	119	1994
Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004	113	2004
Computing polynomial program invariants M Müller-Olm, H Seidl Information Processing Letters 91 (5), 233-244, 2004	112	2004
Locating matches of tree patterns in forests A Neumann, H Seidl Foundations of Software Technology and Theoretical Computer Science: 18th …, 1998	110	1998
On the degree of ambiguity of finite automata A Weber, H Seidl Theoretical Computer Science 88 (2), 325-349, 1991	108	1991
Precise fixpoint computation through strategy iteration T Gawlitza, H Seidl ESOP 7, 300-315, 2007	104	2007
Numerical document queries H Seidl, T Schwentick, A Muscholl Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on …, 2003	99	2003
A note on Karr’s algorithm M Müller-Olm, H Seidl Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004	98	2004
A Succinct Solver for ALFP. F Nielson, H Seidl, HR Nielson Nord. J. Comput. 9 (4), 335-372, 2002	92	2002
Model Checking Information Flow in Reactive Systems. R Dimitrova, B Finkbeiner, M Kovács, MN Rabe, H Seidl VMCAI, 169-185, 2012	83	2012
Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems C Fecht, H Seidl Nord. J. Comput. 5 (4), 304-329, 1998	81	1998
Macro forest transducers T Perst, H Seidl Information Processing Letters 89 (3), 141-149, 2004	78	2004
Tree automata for code selection C Ferdinand, H Seidl, R Wilhelm Acta Informatica 31, 741-760, 1994	78	1994
Fast and simple nested fixpoints H Seidl Information Processing Letters 59 (6), 303-308, 1996	76	1996
Analysis of modular arithmetic M Müller-Olm, H Seidl Programming Languages and Systems: 14th European Symposium on Programming …, 2005	74	2005
Analysis of modular arithmetic M Müller-Olm, H Seidl ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (5), 29-es, 2007	71	2007

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare