Foto von Helmut Seidl

Prof. Dr. Helmut Seidl

Forschungsschwerpunkte

  • Automatische Programmanalyse
  • Design und Implementierung von Programmiersprachen
  • Semi-strukturierte Daten
  • Baumautomaten

Veröffentlichungen

Mon, 01 Jan 2024 00:00:00 +0100

Partial Correctness of the Top-Down Solver.

Yannick Stade, Sarah Tilscher, Helmut Seidl:
Partial Correctness of the Top-Down Solver. Arch. Formal Proofs 2024 (2024)
Quelle

Mon, 01 Jan 2024 00:00:00 +0100

Functionality of compositions of top-down tree transducers is decidable.

Sebastian Maneth, Helmut Seidl, Martin Vu:
Functionality of compositions of top-down tree transducers is decidable. Inf. Comput. 296: 105131 (2024)
Quelle

Thu, 01 Feb 2024 00:00:00 +0100

Checking in polynomial time whether or not a regular tree language is deterministic top-down.

Sebastian Maneth, Helmut Seidl:
Checking in polynomial time whether or not a regular tree language is deterministic top-down. Inf. Process. Lett. 184: 106449 (2024)
Quelle

Mon, 01 Jan 2024 00:00:00 +0100

Goblint Validator: Correctness Witness Validation by Abstract Interpretation - (Competition Contribution).

Simmo Saan, Julian Erhard, Michael Schwarz, Stanimir Bozhilov, Karoliine Holter, Sarah Tilscher, Vesal Vojdani, Helmut Seidl:
Goblint Validator: Correctness Witness Validation by Abstract Interpretation - (Competition Contribution). TACAS (3) 2024: 335-340
Quelle

Mon, 01 Jan 2024 00:00:00 +0100

Goblint: Abstract Interpretation for Memory Safety and Termination - (Competition Contribution).

Simmo Saan, Julian Erhard, Michael Schwarz, Stanimir Bozhilov, Karoliine Holter, Sarah Tilscher, Vesal Vojdani, Helmut Seidl:
Goblint: Abstract Interpretation for Memory Safety and Termination - (Competition Contribution). TACAS (3) 2024: 381-386
Quelle

Mon, 01 Jan 2024 00:00:00 +0100

Correctness Witness Validation by Abstract Interpretation.

Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, Vesal Vojdani:
Correctness Witness Validation by Abstract Interpretation. VMCAI (1) 2024: 74-97
Quelle

Mon, 01 Jan 2024 00:00:00 +0100

Non-Numerical Weakly Relational Domains.

Helmut Seidl, Julian Erhard, Sarah Tilscher, Michael Schwarz:
Non-Numerical Weakly Relational Domains. CoRR abs/2401.05165 (2024)
Quelle

Wed, 01 Feb 2023 00:00:00 +0100

Definability Results for Top-Down Tree Transducers.

Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. Int. J. Found. Comput. Sci. 34(2&3): 253-287 (2023)
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Deciding origin equivalence of weakly self-nesting macro tree transducers.

Sebastian Maneth, Helmut Seidl:
Deciding origin equivalence of weakly self-nesting macro tree transducers. Inf. Process. Lett. 180: 106332 (2023)
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces.

Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani:
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. ESOP 2023: 28-58
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C.

Michael Schwarz, Julian Erhard, Vesal Vojdani, Simmo Saan, Helmut Seidl:
When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C. SOAP@PLDI 2023: 20-26
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Octagons Revisited - Elegant Proofs and Simplified Algorithms.

Michael Schwarz, Helmut Seidl:
Octagons Revisited - Elegant Proofs and Simplified Algorithms. SAS 2023: 485-507
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Goblint: Autotuning Thread-Modular Abstract Interpretation - (Competition Contribution).

Simmo Saan, Michael Schwarz, Julian Erhard, Manuel Pietsch, Helmut Seidl, Sarah Tilscher, Vesal Vojdani:
Goblint: Autotuning Thread-Modular Abstract Interpretation - (Competition Contribution). TACAS (2) 2023: 547-552
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces.

Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani:
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. CoRR abs/2301.06439 (2023)
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down.

Sebastian Maneth, Helmut Seidl:
Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down. CoRR abs/2306.00573 (2023)
Quelle

Sun, 01 Jan 2023 00:00:00 +0100

Correctness Witness Validation by Abstract Interpretation.

Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, Vesal Vojdani:
Correctness Witness Validation by Abstract Interpretation. CoRR abs/2310.16572 (2023)
Quelle

Sat, 01 Jan 2022 00:00:00 +0100

How to Decide Functionality of Compositions of Top-Down Tree Transducers.

Sebastian Maneth, Helmut Seidl, Martin Vu:
How to Decide Functionality of Compositions of Top-Down Tree Transducers. CAI 2022: 175-191
Quelle

Sat, 01 Jan 2022 00:00:00 +0100

Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings.

Helmut Seidl, Zhiming Liu, Corina S. Pasareanu:
Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings. Lecture Notes in Computer Science 13572, Springer 2022, ISBN 978-3-031-17714-9 [contents]
Quelle

Sat, 01 Jan 2022 00:00:00 +0100

How to decide Functionality of Compositions of Top-Down Tree Transducers.

Sebastian Maneth, Helmut Seidl, Martin Vu:
How to decide Functionality of Compositions of Top-Down Tree Transducers. CoRR abs/2209.01044 (2022)
Quelle

Sat, 01 Jan 2022 00:00:00 +0100

Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap.

Julian Erhard, Simmo Saan, Sarah Tilscher, Michael Schwarz, Karoliine Holter, Vesal Vojdani, Helmut Seidl:
Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap. CoRR abs/2209.10445 (2022)
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

On the Balancedness of Tree-to-Word Transducers.

Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. Int. J. Found. Comput. Sci. 32(6): 761-783 (2021)
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

Three improvements to the top-down solver.

Helmut Seidl, Ralf Vogler:
Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31(9): 1090-1134 (2021)
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

Definability Results for Top-Down Tree Transducers.

Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. DLT 2021: 291-303
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

Improving Thread-Modular Abstract Interpretation.

Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani:
Improving Thread-Modular Abstract Interpretation. SAS 2021: 359-383
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution).

Simmo Saan, Michael Schwarz, Kalmer Apinis, Julian Erhard, Helmut Seidl, Ralf Vogler, Vesal Vojdani:
Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution). TACAS (2) 2021: 438-442
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

Definability Results for Top-Down Tree Transducers.

Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. CoRR abs/2105.14860 (2021)
Quelle

Fri, 01 Jan 2021 00:00:00 +0100

Improving Thread-Modular Abstract Interpretation.

Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani:
Improving Thread-Modular Abstract Interpretation. CoRR abs/2108.07613 (2021)
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

Incremental Abstract Interpretation.


Wed, 01 Jan 2020 00:00:00 +0100

Equivalence of Linear Tree Transducers with Output in the Free Group.

Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
Equivalence of Linear Tree Transducers with Output in the Free Group. DLT 2020: 207-221
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

On the Balancedness of Tree-to-Word Transducers.

Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-Word Transducers. DLT 2020: 222-236
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?

Sebastian Maneth, Helmut Seidl:
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP 2020: 134:1-134:18
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

Stratified Guarded First-Order Transition Systems.

Christan Müller, Helmut Seidl:
Stratified Guarded First-Order Transition Systems. SAS 2020: 113-133
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis.

Anastasiia Izycheva, Eva Darulova, Helmut Seidl:
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. SAS 2020: 156-177
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

How to Win First-Order Safety Games.

Helmut Seidl, Christian Müller, Bernd Finkbeiner:
How to Win First-Order Safety Games. VMCAI 2020: 426-448
Quelle

Wed, 01 Jan 2020 00:00:00 +0100

Equivalence of Linear Tree Transducers with Output in the Free Group.

Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR abs/2001.03480 (2020)
Quelle

Tue, 01 Jan 2019 00:00:00 +0100

Synthesizing Efficient Low-Precision Kernels.

Anastasiia Izycheva, Eva Darulova, Helmut Seidl:
Synthesizing Efficient Low-Precision Kernels. ATVA 2019: 294-313
Quelle

Tue, 01 Jan 2019 00:00:00 +0100

Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time.

Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS 2019: 488-504
Quelle

Tue, 01 Jan 2019 00:00:00 +0100

Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time.

Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR abs/1902.03858 (2019)
Quelle

Tue, 01 Jan 2019 00:00:00 +0100

How to Win First-Order Safety Games.

Helmut Seidl, Christian Müller, Bernd Finkbeiner:
How to Win First-Order Safety Games. CoRR abs/1908.05964 (2019)
Quelle

Tue, 01 Jan 2019 00:00:00 +0100

On the Balancedness of Tree-to-word Transducers.

Raphaela Löbel, Michael Luttenberger, Helmut Seidl:
On the Balancedness of Tree-to-word Transducers. CoRR abs/1911.13054 (2019)
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Enforcing termination of interprocedural analysis.

Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. 53(2): 313-338 (2018)
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Balancedness of MSO transductions in polynomial time.

Sebastian Maneth, Helmut Seidl:
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133: 26-32 (2018)
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable.

Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65(4): 21:1-21:30 (2018)
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Paths, tree homomorphisms and disequalities for -clauses.

Andreas Reuß, Helmut Seidl:
Paths, tree homomorphisms and disequalities for -clauses. Math. Struct. Comput. Sci. 28(10): 1786-1846 (2018)
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Inductive Invariants for Noninterference in Multi-agent Workflows.

Christian Müller, Helmut Seidl, Eugen Zalinescu:
Inductive Invariants for Noninterference in Multi-agent Workflows. CSF 2018: 247-261
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Three Improvements to the Top-Down Solver.

Helmut Seidl, Ralf Vogler:
Three Improvements to the Top-Down Solver. PPDP 2018: 21:1-21:14
Quelle

Mon, 01 Jan 2018 00:00:00 +0100

Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.

Michael Luttenberger, Raphaela Palenta, Helmut Seidl:
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS 2018: 48:1-48:13
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Inter-procedural Two-Variable Herbrand Equalities.

Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. Log. Methods Comput. Sci. 13(2) (2017)
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking.

Helmut Seidl, Ralf Vogler:
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. ATVA 2017: 3-22
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Verifying Security Policies in Multi-agent Workflows with Loops.

Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu:
Verifying Security Policies in Multi-agent Workflows with Loops. CCS 2017: 633-645
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Reachability for Dynamic Parametric Processes.

Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Computing the longest common prefix of a context-free language in polynomial time.

Michael Luttenberger, Raphaela Palenta, Helmut Seidl:
Computing the longest common prefix of a context-free language in polynomial time. CoRR abs/1702.06698 (2017)
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Verifying Security Policies in Multi-agent Workflows with Loops.

Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu:
Verifying Security Policies in Multi-agent Workflows with Loops. CoRR abs/1708.09013 (2017)
Quelle

Sun, 01 Jan 2017 00:00:00 +0100

Formal Methods of Transformations (Dagstuhl Seminar 17142).

Emmanuel Filiot, Sebastian Maneth, Helmut Seidl:
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 (2017)
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Efficiently intertwining widening and narrowing.

Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120: 1-24 (2016)
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Look-ahead removal for total deterministic top-down tree transducers.

Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616: 18-58 (2016)
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.

Bernd Finkbeiner, Helmut Seidl, Christian Müller:
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA 2016: 157-173
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Enhancing Top-Down Solving with Widening and Narrowing.

Kalmer Apinis, Helmut Seidl, Vesal Vojdani:
Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi 2016: 272-288
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Static race detection for device drivers: the Goblint approach.

Vesal Vojdani, Kalmer Apinis, Vootele Rõtov, Helmut Seidl, Varmo Vene, Ralf Vogler:
Static race detection for device drivers: the Goblint approach. ASE 2016: 391-402
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Enforcing Termination of Interprocedural Analysis.

Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing Termination of Interprocedural Analysis. SAS 2016: 447-468
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Equivalence - Combinatorics, Algebra, Proofs.


Fri, 01 Jan 2016 00:00:00 +0100

Enforcing Termination of Interprocedural Analysis.

Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing Termination of Interprocedural Analysis. CoRR abs/1606.07687 (2016)
Quelle

Fri, 01 Jan 2016 00:00:00 +0100

Reachability for dynamic parametric processes.

Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016)
Quelle

Thu, 01 Jan 2015 00:00:00 +0100

An Analysis of Universal Information Flow Based on Self-Composition.

Christian Müller, Máté Kovács, Helmut Seidl:
An Analysis of Universal Information Flow Based on Self-Composition. CSF 2015: 380-393
Quelle

Thu, 01 Jan 2015 00:00:00 +0100

Inter-procedural Two-Variable Herbrand Equalities.

Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. ESOP 2015: 457-482
Quelle

Thu, 01 Jan 2015 00:00:00 +0100

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.

Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS 2015: 943-962
Quelle

Thu, 01 Jan 2015 00:00:00 +0100

Transforming XML Streams with References.

Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl:
Transforming XML Streams with References. SPIRE 2015: 33-45
Quelle

Thu, 01 Jan 2015 00:00:00 +0100

Efficiently intertwining widening and narrowing.

Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Efficiently intertwining widening and narrowing. CoRR abs/1503.00883 (2015)
Quelle

Thu, 01 Jan 2015 00:00:00 +0100

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.

Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR abs/1503.09163 (2015)
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Numerical invariants through convex relaxation and max-strategy iteration.

Thomas Martin Gawlitza, Helmut Seidl:
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. 44(2): 101-148 (2014)
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

How to Remove the Look-Ahead of Top-Down Tree Transducers.

Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory 2014: 103-115
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Interprocedural Information Flow Analysis of XML Processors.

Helmut Seidl, Máté Kovács:
Interprocedural Information Flow Analysis of XML Processors. LATA 2014: 34-61
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Parametric Strategy Iteration.

Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz:
Parametric Strategy Iteration. SCSS 2014: 62-76
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs.

Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Kalmer Apinis:
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI 2014: 21-38
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Frameworks for Interprocedural Analysis of Concurrent Programs.

Helmut Seidl, Kalmer Apinis, Vesal Vojdani:
Frameworks for Interprocedural Analysis of Concurrent Programs. Software Systems Safety 2014: 309-347
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings.

Markus Müller-Olm, Helmut Seidl:
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8723, Springer 2014, ISBN 978-3-319-10935-0 [contents]
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Software Systems Safety.

Orna Grumberg, Helmut Seidl, Maximilian Irlbeck:
Software Systems Safety. NATO Science for Peace and Security Series, D: Information and Communication Security 36, IOS Press 2014, ISBN 978-1-61499-384-1 [contents]
Quelle

Wed, 01 Jan 2014 00:00:00 +0100

Parametric Strategy Iteration.


Wed, 01 Jan 2014 00:00:00 +0100

Inter-procedural Two-Variable Herbrand Equalities.

Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. CoRR abs/1410.4416 (2014)
Quelle

Tue, 01 Jan 2013 00:00:00 +0100

Compiler Design - Syntactic and Semantic Analysis.

Reinhard Wilhelm, Helmut Seidl, Sebastian Hack:
Compiler Design - Syntactic and Semantic Analysis. Springer 2013, ISBN 978-3-642-17539-8, pp. I-X, 1-225
Quelle

Tue, 01 Jan 2013 00:00:00 +0100

Relational abstract interpretation for the verification of 2-hypersafety properties.

Máté Kovács, Helmut Seidl, Bernd Finkbeiner:
Relational abstract interpretation for the verification of 2-hypersafety properties. CCS 2013: 211-222
Quelle

Tue, 01 Jan 2013 00:00:00 +0100

How to combine widening and narrowing for non-monotonic systems of equations.

Kalmer Apinis, Helmut Seidl, Vesal Vojdani:
How to combine widening and narrowing for non-monotonic systems of equations. PLDI 2013: 377-386
Quelle

Tue, 01 Jan 2013 00:00:00 +0100

Contextual Locking for Dynamic Pushdown Networks.

Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498
Quelle

Tue, 01 Jan 2013 00:00:00 +0100

Look-Ahead Removal for Top-Down Tree Transducers.

Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 (2013)
Quelle

Tue, 01 Jan 2013 00:00:00 +0100

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).

Sebastian Maneth, Helmut Seidl:
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3(5): 1-18 (2013)
Quelle

Sun, 01 Jan 2012 00:00:00 +0100

Compiler Design - Analysis and Transformation.

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

Sun, 01 Jan 2012 00:00:00 +0100

Abstract interpretation meets convex optimization.

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)
Quelle

Sun, 01 Jan 2012 00:00:00 +0100

Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis.

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

Sun, 01 Jan 2012 00:00:00 +0100

Runtime Enforcement of Information Flow Security in Tree Manipulating Processes.

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

Sun, 01 Jan 2012 00:00:00 +0100

Extending ${\cal H}_1$ -Clauses with Path Disequalities.

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

Sun, 01 Jan 2012 00:00:00 +0100

Model Checking Information Flow in Reactive Systems.

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

Sun, 01 Jan 2012 00:00:00 +0100

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses.

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

Sun, 01 Jan 2012 00:00:00 +0100

Type Checking of Tree Walking Transducers.

Sebastian Maneth, Sylvia Friese, Helmut Seidl:
Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory 2012: 325-372
Quelle

Sun, 01 Jan 2012 00:00:00 +0100

Precise Program Analysis through Strategy Iteration and Optimization.

Thomas Martin Gawlitza, Helmut Seidl:
Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security 2012: 348-384
Quelle

Sun, 01 Jan 2012 00:00:00 +0100

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.

Helmut Seidl:
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 [contents]
Quelle

Sun, 01 Jan 2012 00:00:00 +0100

Numerical Invariants through Convex Relaxation and Max-Strategy Iteration.

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

Sat, 01 Jan 2011 00:00:00 +0100

Earliest Normal Form and Minimization for Bottom-up Tree Transducers.

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)
Quelle

Sat, 01 Jan 2011 00:00:00 +0100

Extending H1-clauses with disequalities.

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

Sat, 01 Jan 2011 00:00:00 +0100

Solving systems of rational equations through strategy iteration.

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

Sat, 01 Jan 2011 00:00:00 +0100

Fast interprocedural linear two-variable equalities.

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

Sat, 01 Jan 2011 00:00:00 +0100

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol.

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
Quelle

Sat, 01 Jan 2011 00:00:00 +0100

Side-Effect Analysis of Assembly Code.

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

Sat, 01 Jan 2011 00:00:00 +0100

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation.

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
Quelle

Fri, 01 Jan 2010 00:00:00 +0100

Compiler Design - Virtual Machines.

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

Fri, 01 Jan 2010 00:00:00 +0100

Praktische Programmverifikation durch statische Analyse.

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

Fri, 01 Jan 2010 00:00:00 +0100

Interprocedural Control Flow Reconstruction.

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

Fri, 01 Jan 2010 00:00:00 +0100

Abstract Interpretation over Zones without Widening.

Thomas Martin Gawlitza, Helmut Seidl:
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR 2010: 12-43
Quelle

Fri, 01 Jan 2010 00:00:00 +0100

Minimization of Deterministic Bottom-Up Tree Transducers.

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

Fri, 01 Jan 2010 00:00:00 +0100

What Is a Pure Functional?

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

Fri, 01 Jan 2010 00:00:00 +0100

Bottom-Up Tree Automata with Term Constraints.

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

Fri, 01 Jan 2010 00:00:00 +0100

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.

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

Fri, 01 Jan 2010 00:00:00 +0100

Verifying a Local Generic Solver in Coq.

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

Fri, 01 Jan 2010 00:00:00 +0100

Normalization of Linear Horn Clauses.

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

Fri, 01 Jan 2010 00:00:00 +0100

Shape Analysis of Low-Level C with Overlapping Structures.

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

Thu, 01 Jan 2009 00:00:00 +0100

Deciding equivalence of top-down XML transformations in polynomial time.

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)
Quelle

Thu, 01 Jan 2009 00:00:00 +0100

Polynomial Precise Interval Analysis Revisited.


Thu, 01 Jan 2009 00:00:00 +0100

Games through Nested Fixpoints.

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

Thu, 01 Jan 2009 00:00:00 +0100

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.

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

Thu, 01 Jan 2009 00:00:00 +0100

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.

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

Thu, 01 Jan 2009 00:00:00 +0100

Region Analysis for Race Detection.

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

Thu, 01 Jan 2009 00:00:00 +0100

Program Analysis through Finite Tree Automata.

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

Tue, 01 Jan 2008 00:00:00 +0100

Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.

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): 28:1-28:45 (2008)
Quelle

Tue, 01 Jan 2008 00:00:00 +0100

Counting in trees.


Tue, 01 Jan 2008 00:00:00 +0100

Upper Adjoints for Fast Inter-procedural Variable Equalities.

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

Tue, 01 Jan 2008 00:00:00 +0100

Precise Interval Analysis vs. Parity Games.

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

Tue, 01 Jan 2008 00:00:00 +0100

Lightweight Verification 2008.

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

Tue, 01 Jan 2008 00:00:00 +0100

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.

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

Tue, 01 Jan 2008 00:00:00 +0100

Analysing All Polynomial Equations in .

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

Mon, 01 Jan 2007 00:00:00 +0100

Analysis of modular arithmetic.

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

Mon, 01 Jan 2007 00:00:00 +0100

Computing Game Values for Crash Games.

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

Mon, 01 Jan 2007 00:00:00 +0100

Precise Relational Invariants Through Strategy Iteration.

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

Mon, 01 Jan 2007 00:00:00 +0100

Interprocedurally Analysing Linear Inequality Relations.

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

Mon, 01 Jan 2007 00:00:00 +0100

Precise Fixpoint Computation Through Strategy Iteration.

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

Mon, 01 Jan 2007 00:00:00 +0100

Exact XML Type Checking in Polynomial Time.

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

Mon, 01 Jan 2007 00:00:00 +0100

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.

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

Mon, 01 Jan 2007 00:00:00 +0100

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.

Helmut Seidl:
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 [contents]
Quelle

Sun, 01 Jan 2006 00:00:00 +0100

Infinite-state high-level MSCs: Model-checking and realizability.

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)
Quelle

Sun, 01 Jan 2006 00:00:00 +0100

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.

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

Sun, 01 Jan 2006 00:00:00 +0100

Interprocedurally Analyzing Polynomial Identities.

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

Sun, 01 Jan 2006 00:00:00 +0100

Exact XML Type Checking in Polynomial Time.

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

Sat, 01 Jan 2005 00:00:00 +0100

On the Complexity of Equational Horn Clauses.

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

Sat, 01 Jan 2005 00:00:00 +0100

Interprocedural Herbrand Equalities.

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

Sat, 01 Jan 2005 00:00:00 +0100

Analysis of Modular Arithmetic.

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

Sat, 01 Jan 2005 00:00:00 +0100

XML type checking with macro tree transducers.

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

Sat, 01 Jan 2005 00:00:00 +0100

A Generic Framework for Interprocedural Analysis of Numerical Properties.

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

Sat, 01 Jan 2005 00:00:00 +0100

Checking Herbrand Equalities and Beyond.

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

Sat, 01 Jan 2005 00:00:00 +0100

Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.

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

Thu, 01 Jan 2004 00:00:00 +0100

Macro forest transducers.

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

Thu, 01 Jan 2004 00:00:00 +0100

Computing polynomial program invariants.

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

Thu, 01 Jan 2004 00:00:00 +0100

Binary Queries for Document Trees.

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

Thu, 01 Jan 2004 00:00:00 +0100

Annotiertes Lecture Recording.

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

Thu, 01 Jan 2004 00:00:00 +0100

A Note on Karr's Algorithm.

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

Thu, 01 Jan 2004 00:00:00 +0100

Counting in Trees for Free.

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

Thu, 01 Jan 2004 00:00:00 +0100

Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.

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

Thu, 01 Jan 2004 00:00:00 +0100

A Generic Framework for Interprocedural Analyses of Numerical Properties.

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

Thu, 01 Jan 2004 00:00:00 +0100

Precise interprocedural analysis through linear algebra.

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

Thu, 01 Jan 2004 00:00:00 +0100

The Succinct Solver Suite.


Wed, 01 Jan 2003 00:00:00 +0100

(Linear) Algebra for Program Analysis Dynamische Programmanalyse.

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

Wed, 01 Jan 2003 00:00:00 +0100

Numerical document queries.

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

Tue, 01 Jan 2002 00:00:00 +0100

A Succinct Solver for ALFP.

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

Tue, 01 Jan 2002 00:00:00 +0100

Transparent teleteaching.

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

Tue, 01 Jan 2002 00:00:00 +0100

Automatic Complexity Analysis.

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

Tue, 01 Jan 2002 00:00:00 +0100

Binary Queries.


Tue, 01 Jan 2002 00:00:00 +0100

A Type-safe Macro System for XML.

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

Tue, 01 Jan 2002 00:00:00 +0100

Infinite-State High-Level MSCs: Model-Checking and Realizability.

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

Tue, 01 Jan 2002 00:00:00 +0100

Polynomial Constants Are Decidable.

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

Tue, 01 Jan 2002 00:00:00 +0100

Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.

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

Tue, 01 Jan 2002 00:00:00 +0100

Polynomial Constants are Decidable.

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

Tue, 01 Jan 2002 00:00:00 +0100

Interprocedural Invariants.

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

Tue, 01 Jan 2002 00:00:00 +0100

On the Expressiveness of Tree Set Operators.

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

Mon, 01 Jan 2001 00:00:00 +0100

Control-Flow Analysis in Cubic Time.

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

Mon, 01 Jan 2001 00:00:00 +0100

Synchronized Tree Languages Revisited and New Applications.

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

Mon, 01 Jan 2001 00:00:00 +0100

Weakly Regular Relations and Applications.

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

Mon, 01 Jan 2001 00:00:00 +0100

On optimal slicing of parallel programs.

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

Mon, 01 Jan 2001 00:00:00 +0100

Cryptographic Analysis in Cubic Time.

Flemming Nielson, Hanne Riis Nielson, Helmut Seidl:
Cryptographic Analysis in Cubic Time. TOSCA 2001: 7-23
Quelle

Mon, 01 Jan 2001 00:00:00 +0100

Succinct Solvers.

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

Sat, 01 Jan 2000 00:00:00 +0100

Interprocedural Analyses: A Comparison.

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

Sat, 01 Jan 2000 00:00:00 +0100

Constraint-Based Inter-Procedural Analysis of Parallel Programs.

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

Sat, 01 Jan 2000 00:00:00 +0100

Constraint-Based Inter-Procedural Analysis of Parallel Programs.

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

Fri, 01 Jan 1999 00:00:00 +0100

On distributive fixed-point expressions.

Helmut Seidl, Damian Niwinski:
On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. 33(4/5): 427-446 (1999)
Quelle

Fri, 01 Jan 1999 00:00:00 +0100

A Faster Solver for General Systems of Equations.

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

Fri, 01 Jan 1999 00:00:00 +0100

On Guarding Nested Fixpoints.

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

Fri, 01 Jan 1999 00:00:00 +0100

ForkLight: A Control-Synchronous Parallel Programming Language.

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

Fri, 01 Jan 1999 00:00:00 +0100

The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations.

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)
Quelle

Thu, 01 Jan 1998 00:00:00 +0100

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.

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

Thu, 01 Jan 1998 00:00:00 +0100

Constraints to Stop Deforestation.

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

Thu, 01 Jan 1998 00:00:00 +0100

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.

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

Thu, 01 Jan 1998 00:00:00 +0100

Locating Matches of Tree Patterns in Forests.

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

Thu, 01 Jan 1998 00:00:00 +0100

Locating Matches of Tree Patterns in Forests.

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

Thu, 01 Jan 1998 00:00:00 +0100

ForkLight: A Control-Synchronous Parallel Programming Language.

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

Wed, 01 Jan 1997 00:00:00 +0100

The Fork95 parallel programming language: Design, implementation, application.

Christoph W. Keßler, Helmut Seidl:
The Fork95 parallel programming language: Design, implementation, application. Int. J. Parallel Program. 25(1): 17-50 (1997)
Quelle

Wed, 01 Jan 1997 00:00:00 +0100

Language Support for Synchronous Parallel Critical Sections.

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

Wed, 01 Jan 1997 00:00:00 +0100

Constraints to Stop Higher-Order Deforestation.

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

Wed, 01 Jan 1997 00:00:00 +0100

Disjuntive Completion Is Not "Optimal".

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

Wed, 01 Jan 1997 00:00:00 +0100

Interprocedural Analysis Based on PDAs.

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

Wed, 01 Jan 1997 00:00:00 +0100

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.

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

Wed, 01 Jan 1997 00:00:00 +0100

Model-Checking for L2.

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

Mon, 01 Jan 1996 00:00:00 +0100

Fast and Simple Nested Fixpoints.

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

Mon, 01 Jan 1996 00:00:00 +0100

Least and Greatest Solutions of Equations over N.

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

Mon, 01 Jan 1996 00:00:00 +0100

Integer Constraints to Stop Deforestation.

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

Mon, 01 Jan 1996 00:00:00 +0100

A Modal Mu-Calculus for Durational Transition Systems.

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

Mon, 01 Jan 1996 00:00:00 +0100

An Even Faster Solver for General Systems of Equations.

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

Mon, 01 Jan 1996 00:00:00 +0100

Fast and Simple Nested Fixpoints.

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

Mon, 01 Jan 1996 00:00:00 +0100

An Even Faster Solver for General Systems of Equations.

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

Sun, 01 Jan 1995 00:00:00 +0100

Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language.

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)
Quelle

Sun, 01 Jan 1995 00:00:00 +0100

A Modal µ-Calculus for Durational Transition Systems.

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

Sun, 01 Jan 1995 00:00:00 +0100

Language Support for Synchronous Parallel Critical Sections.

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

Sat, 01 Jan 1994 00:00:00 +0100

Tree Automata for Code Selection.

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

Sat, 01 Jan 1994 00:00:00 +0100

Haskell Overloading is DEXPTIME-Complete.

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

Sat, 01 Jan 1994 00:00:00 +0100

Equivalence of Finite-Valued Tree Transducers Is Decidable.

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

Sat, 01 Jan 1994 00:00:00 +0100

Finite Tree Automata with Cost Functions.

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

Sat, 01 Jan 1994 00:00:00 +0100

Least Solutions of Equations over N.

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

Fri, 01 Jan 1993 00:00:00 +0100

When Is a Functional Tree Transduction Deterministic?

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

Wed, 01 Jan 1992 00:00:00 +0100

FORK: A high-level language for PRAMs.

Torben Hagerup, Arno Schmitt, Helmut Seidl:
FORK: A high-level language for PRAMs. Future Gener. Comput. Syst. 8(4): 379-393 (1992)
Quelle

Wed, 01 Jan 1992 00:00:00 +0100

Single-Valuedness of Tree Transducers is Decidable in Polynomial Time.

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

Wed, 01 Jan 1992 00:00:00 +0100

Finite Tree Automata with Cost Functions.

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

Wed, 01 Jan 1992 00:00:00 +0100

Ambiguity and valuedness.

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

Wed, 01 Jan 1992 00:00:00 +0100

Baumautomaten zur Codeselektion.

Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm:
Baumautomaten zur Codeselektion. Informatik 1992: 121-144
Quelle

Tue, 01 Jan 1991 00:00:00 +0100

On finitely generated monoids of matrices with entries in N.

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

Tue, 01 Jan 1991 00:00:00 +0100

On the Degree of Ambiguity of Finite Automata.

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

Tue, 01 Jan 1991 00:00:00 +0100

Tree Automata for Code Selection.

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

Tue, 01 Jan 1991 00:00:00 +0100

FORK: A High-Level Language for PRAMs.

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

Mon, 01 Jan 1990 00:00:00 +0100

Deciding Equivalence of Finite Tree Automata.

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

Mon, 01 Jan 1990 00:00:00 +0100

Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.

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

Mon, 01 Jan 1990 00:00:00 +0100

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.

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

Sun, 01 Jan 1989 00:00:00 +0100

On the Finite Degree of Ambiguity of Finite Tree Automata.

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

Sun, 01 Jan 1989 00:00:00 +0100

On the Finite Degree of Ambiguity of Finite Tree Automata.

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

Sun, 01 Jan 1989 00:00:00 +0100

Deciding Equivalence of Finite Tree Automata.

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

Fri, 01 Jan 1988 00:00:00 +0100

Parameter-Reduction of Higher Level Grammars (Extended Abstract).

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

Thu, 01 Jan 1987 00:00:00 +0100

Parameter Reduction of Higher Level Grammars.

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

Wed, 01 Jan 1986 00:00:00 +0100

On the Degree of Ambiguity of Finite Automata.

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

Tue, 01 Jan 1985 00:00:00 +0100

A quadratic regularity test for non-deleting macro S grammars.

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