Helmut Seidl

Helmut Seidl, Reinhard Wilhelm, Sebastian Hack: Compiler Design - Analysis and Transformation. Springer 2012, isbn 978-3-642-17547-3, pp. I-XII, 1-177

Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault: Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12): 1416-1446 (2012)

Kalmer Apinis, Helmut Seidl, Vesal Vojdani: Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS 2012: 157-172

Máté Kovács, Helmut Seidl: Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS 2012: 46-59

Helmut Seidl, Andreas Reuß: Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS 2012: 165-179

Rayna Dimitrova, Bernd Finkbeiner, Máté Kovács, Markus N. Rabe, Helmut Seidl: Model Checking Information Flow in Reactive Systems. VMCAI 2012: 169-185

Andreas Reuß, Helmut Seidl: Crossing the Syntactic Barrier: Hom-Disequalities for H₁-Clauses. CIAA 2012: 301-312

Helmut Seidl (Ed.): Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Lecture Notes in Computer Science 7211, Springer 2012, isbn 978-3-642-28868-5

Thomas Martin Gawlitza, Helmut Seidl: Numerical Invariants through Convex Relaxation and Max-Strategy Iteration. CoRR abs/1204.1147 (2012)

Sylvia Friese, Helmut Seidl, Sebastian Maneth: Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22(7): 1607-1623 (2011)

Helmut Seidl, Andreas Reuß: Extending H₁-clauses with disequalities. Inf. Process. Lett. 111(20): 1007-1013 (2011)

Thomas Martin Gawlitza, Helmut Seidl: Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33(3): 11 (2011)

Andrea Flexeder, Markus Müller-Olm, Michael Petter, Helmut Seidl: Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21 (2011)

Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich, Markus Müller-Olm: Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL 2011: 93-104

Andrea Flexeder, Michael Petter, Helmut Seidl: Side-Effect Analysis of Assembly Code. SAS 2011: 77-94

Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner: Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213

Reinhard Wilhelm, Helmut Seidl: Compiler Design - Virtual Machines. Springer 2010, isbn 978-3-642-14908-5, pp. I-XIII, 1-187

Helmut Seidl: Praktische Programmverifikation durch statische Analyse. Informatik Spektrum 33(5): 484-488 (2010)

Andrea Flexeder, Bogdan Mihaila, Michael Petter, Helmut Seidl: Interprocedural Control Flow Reconstruction. APLAS 2010: 188-203

Sylvia Friese, Helmut Seidl, Sebastian Maneth: Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196

Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl: What Is a Pure Functional? ICALP (2) 2010: 199-210

Andreas Reuß, Helmut Seidl: Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) 2010: 581-593

Thomas Martin Gawlitza, Helmut Seidl: Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS 2010: 271-286

Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl: Verifying a Local Generic Solver in Coq. SAS 2010: 340-355

Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma: Normalization of Linear Horn Clauses. SBMF 2010: 242-257

Jörg Kreiker, Helmut Seidl, Vesal Vojdani: Shape Analysis of Low-Level C with Overlapping Structures. VMCAI 2010: 214-230

Joost Engelfriet, Sebastian Maneth, Helmut Seidl: Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009)

Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm: Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437

Thomas Gawlitza, Helmut Seidl: Games through Nested Fixpoints. CAV 2009: 291-305

Helmut Seidl, Vesal Vojdani, Varmo Vene: A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. FM 2009: 644-659

Helmut Seidl, Kumar Neeraj Verma: Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA 2009: 118-132

Helmut Seidl, Vesal Vojdani: Region Analysis for Race Detection. SAS 2009: 171-187

Helmut Seidl: Program Analysis through Finite Tree Automata. CIAA 2009: 3

Helmut Seidl, Kumar Neeraj Verma: Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. 9(4) (2008)

Helmut Seidl, Thomas Schwentick, Anca Muscholl: Counting in trees. Logic and Automata 2008: 575-612

Markus Müller-Olm, Helmut Seidl: Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP 2008: 178-192

Thomas Gawlitza, Helmut Seidl: Precise Interval Analysis vs. Parity Games. FM 2008: 342-357

Martin Leucker, Helmut Seidl: Lightweight Verification 2008. GI Jahrestagung (2) 2008: 965-966

Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl: Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710

Helmut Seidl, Andrea Flexeder, Michael Petter: Analysing All Polynomial Equations in . SAS 2008: 299-314

Markus Müller-Olm, Helmut Seidl: Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5) (2007)

Thomas Gawlitza, Helmut Seidl: Computing Game Values for Crash Games. ATVA 2007: 177-191

Thomas Gawlitza, Helmut Seidl: Precise Relational Invariants Through Strategy Iteration. CSL 2007: 23-40

Helmut Seidl, Andrea Flexeder, Michael Petter: Interprocedurally Analysing Linear Inequality Relations. ESOP 2007: 284-299

Thomas Gawlitza, Helmut Seidl: Precise Fixpoint Computation Through Strategy Iteration. ESOP 2007: 300-315

Sebastian Maneth, Thomas Perst, Helmut Seidl: Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268

Sebastian Maneth, Helmut Seidl: Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X 2007: 73-79

Helmut Seidl (Ed.): Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Lecture Notes in Computer Science 4423, Springer 2007, isbn 978-3-540-71388-3

Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun: Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006)

Helmut Seidl, Kumar Neeraj Verma: Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation 2006: 97-119

Markus Müller-Olm, Michael Petter, Helmut Seidl: Interprocedurally Analyzing Polynomial Identities. STACS 2006: 50-67

Sebastian Maneth, Thomas Perst, Helmut Seidl: Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04 (2006)

Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick: On the Complexity of Equational Horn Clauses. CADE 2005: 337-352

Markus Müller-Olm, Helmut Seidl, Bernhard Steffen: Interprocedural Herbrand Equalities. ESOP 2005: 31-45

Markus Müller-Olm, Helmut Seidl: Analysis of Modular Arithmetic. ESOP 2005: 46-60

Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl: XML type checking with macro tree transducers. PODS 2005: 283-294

Markus Müller-Olm, Helmut Seidl: A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS 2005: 235-250

Markus Müller-Olm, Oliver Rüthing, Helmut Seidl: Checking Herbrand Equalities and Beyond. VMCAI 2005: 79-96

Helmut Seidl, Kumar Neeraj Verma: Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. CoRR abs/cs/0511014 (2005)

Thomas Perst, Helmut Seidl: Macro forest transducers. Inf. Process. Lett. 89(3): 141-149 (2004)

Markus Müller-Olm, Helmut Seidl: Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 (2004)

Alexandru Berlea, Helmut Seidl: Binary Queries for Document Trees. Nord. J. Comput. 11(1): 41-71 (2004)

Peter Ziewer, Helmut Seidl: Annotiertes Lecture Recording. DeLFI 2004: 43-54

Markus Müller-Olm, Helmut Seidl: A Note on Karr's Algorithm. ICALP 2004: 1016-1028

Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl: Counting in Trees for Free. ICALP 2004: 1136-1149

Helmut Seidl, Kumar Neeraj Verma: Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR 2004: 79-94

Markus Müller-Olm, Helmut Seidl: A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR 2004: 432-432

Markus Müller-Olm, Helmut Seidl: Precise interprocedural analysis through linear algebra. POPL 2004: 330-341

Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl: The Succinct Solver Suite. TACAS 2004: 251-265

Markus Müller-Olm, Helmut Seidl: (Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends 23(2) (2003)

Helmut Seidl, Thomas Schwentick, Anca Muscholl: Numerical document queries. PODS 2003: 155-166

Flemming Nielson, Helmut Seidl, Hanne Riis Nielson: A Succinct Solver for ALFP. Nord. J. Comput. 9(4): 335-372 (2002)

Peter Ziewer, Helmut Seidl: Transparent teleteaching. ASCILITE 2002: 749-758

Flemming Nielson, Hanne Riis Nielson, Helmut Seidl: Automatic Complexity Analysis. ESOP 2002: 243-261

Alexandru Berlea, Helmut Seidl: Binary Queries. Extreme Markup Languages® 2002

Thomas Perst, Helmut Seidl: A Type-safe Macro System for XML. Extreme Markup Languages® 2002

Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun: Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002: 657-668

Markus Müller-Olm, Helmut Seidl: Polynomial Constants Are Decidable. SAS 2002: 4-19

Flemming Nielson, Hanne Riis Nielson, Helmut Seidl: Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS 2002: 20-35

Markus Müller-Olm, Helmut Seidl: Polynomial Constants are Decidable. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09 (2002)

Helmut Seidl, Varmo Vene, Markus Müller-Olm: Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 (2002)

Helmut Seidl, Aditya V. Nori: On the Expressiveness of Tree Set Operators. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-17 (2002)

Flemming Nielson, Hanne Riis Nielson, Helmut Seidl: Cryptographic Analysis in Cubic Time. Electr. Notes Theor. Comput. Sci. 62: 7-23 (2001)

Flemming Nielson, Helmut Seidl: Control-Flow Analysis in Cubic Time. ESOP 2001: 252-268

Valérie Gouranton, Pierre Réty, Helmut Seidl: Synchronized Tree Languages Revisited and New Applications. FoSSaCS 2001: 214-229

Sébastien Limet, Pierre Réty, Helmut Seidl: Weakly Regular Relations and Applications. RTA 2001: 185-200

Markus Müller-Olm, Helmut Seidl: On optimal slicing of parallel programs. STOC 2001: 647-656

Flemming Nielson, Helmut Seidl: Succinct Solvers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12 (2001)

Helmut Seidl, Christian Fecht: Interprocedural Analyses: A Comparison. J. Log. Program. 43(2): 123-156 (2000)

Helmut Seidl, Bernhard Steffen: Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. 7(4): 375- (2000)

Helmut Seidl, Bernhard Steffen: Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP 2000: 351-365

Helmut Seidl, Damian Niwinski: On distributive fixed-point expressions. ITA 33(4/5): 427-446 (1999)

Christian Fecht, Helmut Seidl: A Faster Solver for General Systems of Equations. Sci. Comput. Program. 35(2): 137-161 (1999)

Helmut Seidl, Andreas Neumann: On Guarding Nested Fixpoints. CSL 1999: 484-498

Christoph W. Keßler, Helmut Seidl: ForkLight: A Control-Synchronous Parallel Programming Language. HPCN Europe 1999: 525-534

Christoph W. Keßler, Helmut Seidl, Craig Smith: The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-10 (1999)

Christian Fecht, Helmut Seidl: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nord. J. Comput. 5(4): 304-329 (1998)

Helmut Seidl, Morten Heine Sørensen: Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 (1998)

Christian Fecht, Helmut Seidl: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. ESOP 1998: 90-104

Andreas Neumann, Helmut Seidl: Locating Matches of Tree Patterns in Forests. FSTTCS 1998: 134-145

Andreas Neumann, Helmut Seidl: Locating Matches of Tree Patterns in Forests. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-08 (1998)

Christoph W. Keßler, Helmut Seidl: ForkLight: A Control-Synchronous Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-13 (1998)

Christoph W. Keßler, Helmut Seidl: The Fork95 parallel programming language: Design, implementation, application. International Journal of Parallel Programming 25(1): 17-50 (1997)

Christoph W. Keßler, Helmut Seidl: Language Support for Synchronous Parallel Critical Sections. APDC 1997: 92-99

Helmut Seidl, Morten Heine Sørensen: Constraints to Stop Higher-Order Deforestation. POPL 1997: 400-413

Helmut Seidl, Christian Fecht: Disjuntive Completion Is Not "Optimal". ILPS 1997: 408

Helmut Seidl, Christian Fecht: Interprocedural Analysis Based on PDAs. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-06 (1997)

Helmut Seidl, Christian Fecht: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-13 (1997)

Helmut Seidl: Model-Checking for L₂. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-18 (1997)

Helmut Seidl: Fast and Simple Nested Fixpoints. Inf. Process. Lett. 59(6): 303-308 (1996)

Helmut Seidl: Least and Greatest Solutions of Equations over N. Nord. J. Comput. 3(1): 41-62 (1996)

Helmut Seidl: Integer Constraints to Stop Deforestation. ESOP 1996: 326-340

Helmut Seidl: A Modal Mu-Calculus for Durational Transition Systems. LICS 1996: 128-137

Christian Fecht, Helmut Seidl: An Even Faster Solver for General Systems of Equations. SAS 1996: 189-204

Helmut Seidl: Fast and Simple Nested Fixpoints. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-05 (1996)

Christian Fecht, Helmut Seidl: An Even Faster Solver for General Systems of Equations. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-11 (1996)

Christoph W. Keßler, Helmut Seidl: Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-05 (1995)

Helmut Seidl: A Modal µ-Calculus for Durational Transition Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-08 (1995)

Christoph W. Keßler, Helmut Seidl: Language Support for Synchronous Parallel Critical Sections. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-23 (1995)

Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm: Tree Automata for Code Selection. Acta Inf. 31(8): 741-760 (1994)

Helmut Seidl: Haskell Overloading is DEXPTIME-Complete. Inf. Process. Lett. 52(2): 57-60 (1994)

Helmut Seidl: Equivalence of Finite-Valued Tree Transducers Is Decidable. Mathematical Systems Theory 27(4): 285-346 (1994)

Helmut Seidl: Finite Tree Automata with Cost Functions. Theor. Comput. Sci. 126(1): 113-142 (1994)

Helmut Seidl: Least Solutions of Equations over N. ICALP 1994: 400-411

Helmut Seidl: When Is a Functional Tree Transduction Deterministic? TAPSOFT 1993: 251-265

Helmut Seidl: Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. Theor. Comput. Sci. 106(1): 135-181 (1992)

Helmut Seidl: Ambiguity and valuedness. Tree Automata and Languages 1992: 355-380

Helmut Seidl: Finite Tree Automata with Cost Functions. CAAP 1992: 279-299

Andreas Weber, Helmut Seidl: On finitely generated monoids of matrices with entries in N. ITA 25: 19-38 (1991)

Andreas Weber, Helmut Seidl: On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88(2): 325-349 (1991)

Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm: Tree Automata for Code Selection. Code Generation 1991: 30-50

Torben Hagerup, Arno Schmitt, Helmut Seidl: FORK: A High-Level Language for PRAMs. PARLE (1) 1991: 304-320

Helmut Seidl: Deciding Equivalence of Finite Tree Automata. SIAM J. Comput. 19(3): 424-437 (1990)

Helmut Seidl: Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. CAAP 1990: 269-284

Andreas Goerdt, Helmut Seidl: Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990: 148-158

Helmut Seidl: On the Finite Degree of Ambiguity of Finite Tree Automata. Acta Inf. 26(6): 527-542 (1989)

Helmut Seidl: On the Finite Degree of Ambiguity of Finite Tree Automata. FCT 1989: 395-404

Helmut Seidl: Deciding Equivalence of Finite Tree Automata. STACS 1989: 480-492

Helmut Seidl: Parameter-Reduction of Higher Level Grammars (Extended Abstract). CAAP 1988: 52-71

Helmut Seidl: Parameter Reduction of Higher Level Grammars. Theor. Comput. Sci. 55(1): 47-85 (1987)

Andreas Weber, Helmut Seidl: On the Degree of Ambiguity of Finite Automata. MFCS 1986: 620-629

Helmut Seidl: A quadratic regularity test for non-deleting macro S grammars. FCT 1985: 422-430