Helmut Seidl

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 70

Top Venues

Publications

Helmut Seidl, Julian Erhard, Sarah Tilscher, Michael Schwarz
Non-Numerical Weakly Relational Domains. CoRR (2024)
Sebastian Maneth, Helmut Seidl
Checking in polynomial time whether or not a regular tree language is deterministic top-down. Inf. Process. Lett. 184 (2024)
Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
Correctness Witness Validation by Abstract Interpretation. VMCAI (1) (2024)
Yannick Stade, Sarah Tilscher, Helmut Seidl
Partial Correctness of the Top-Down Solver. Arch. Formal Proofs 2024 (2024)
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)
Sebastian Maneth, Helmut Seidl, Martin Vu
Functionality of compositions of top-down tree transducers is decidable. Inf. Comput. 296 (2024)
Julian Erhard, Johanna Franziska Schinabeck, Michael Schwarz, Helmut Seidl
When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly. SOAP@PLDI (2024)
Helmut Seidl, Julian Erhard, Michael Schwarz, Sarah Tilscher
2-Pointer Logic. Taming the Infinities of Concurrency (2024)
Yannick Stade, Sarah Tilscher, Helmut Seidl
The Top-Down Solver Verified: Building Confidence in Static Analyzers. CAV (1) (2024)
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)
Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
Correctness Witness Validation by Abstract Interpretation. CoRR (2023)
Sebastian Maneth, Helmut Seidl, Martin Vu
Definability Results for Top-Down Tree Transducers. Int. J. Found. Comput. Sci. 34 (2&3) (2023)
Sebastian Maneth, Helmut Seidl
Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down. CoRR (2023)
Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. CoRR (2023)
Michael Schwarz, Helmut Seidl
Octagons Revisited - Elegant Proofs and Simplified Algorithms. SAS (2023)
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)
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)
Sebastian Maneth, Helmut Seidl
Deciding origin equivalence of weakly self-nesting macro tree transducers. Inf. Process. Lett. 180 (2023)
Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. ESOP (2023)
Julian Erhard, Simmo Saan, Sarah Tilscher, Michael Schwarz, Karoliine Holter, Vesal Vojdani, Helmut Seidl
Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap. CoRR (2022)
Sebastian Maneth, Helmut Seidl, Martin Vu
How to decide Functionality of Compositions of Top-Down Tree Transducers. CoRR (2022)
Sebastian Maneth, Helmut Seidl, Martin Vu
How to Decide Functionality of Compositions of Top-Down Tree Transducers. CAI (2022)
Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani
Improving Thread-Modular Abstract Interpretation. SAS (2021)
Sebastian Maneth, Helmut Seidl, Martin Vu
Definability Results for Top-Down Tree Transducers. DLT (2021)
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)
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
On the Balancedness of Tree-to-Word Transducers. Int. J. Found. Comput. Sci. 32 (6) (2021)
Sebastian Maneth, Helmut Seidl, Martin Vu
Definability Results for Top-Down Tree Transducers. CoRR (2021)
Helmut Seidl, Ralf Vogler
Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31 (9) (2021)
Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani
Improving Thread-Modular Abstract Interpretation. CoRR (2021)
Helmut Seidl, Christian Müller, Bernd Finkbeiner
How to Win First-Order Safety Games. VMCAI (2020)
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR (2020)
Sebastian Maneth, Helmut Seidl
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP (2020)
Anastasiia Izycheva, Eva Darulova, Helmut Seidl
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. SAS (2020)
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
Equivalence of Linear Tree Transducers with Output in the Free Group. DLT (2020)
Helmut Seidl, Julian Erhard, Ralf Vogler
Incremental Abstract Interpretation. From Lambda Calculus to Cybersecurity Through Program Analysis (2020)
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
On the Balancedness of Tree-to-Word Transducers. DLT (2020)
Christan Müller, Helmut Seidl
Stratified Guarded First-Order Transition Systems. SAS (2020)
Helmut Seidl, Raphaela Palenta, Sebastian Maneth
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS (2019)
Anastasiia Izycheva, Eva Darulova, Helmut Seidl
Synthesizing Efficient Low-Precision Kernels. ATVA (2019)
Helmut Seidl, Raphaela Palenta, Sebastian Maneth
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR (2019)
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
On the Balancedness of Tree-to-word Transducers. CoRR (2019)
Helmut Seidl, Christian Müller, Bernd Finkbeiner
How to Win First-Order Safety Games. CoRR (2019)
Helmut Seidl, Sebastian Maneth, Gregor Kemper
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65 (4) (2018)
Sebastian Maneth, Helmut Seidl
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133 (2018)
Andreas Reuß, Helmut Seidl
Paths, tree homomorphisms and disequalities for -clauses. Math. Struct. Comput. Sci. 28 (10) (2018)
Christian Müller, Helmut Seidl, Eugen Zalinescu
Inductive Invariants for Noninterference in Multi-agent Workflows. CSF (2018)
Helmut Seidl, Ralf Vogler
Three Improvements to the Top-Down Solver. PPDP (2018)
Michael Luttenberger, Raphaela Palenta, Helmut Seidl
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS (2018)
Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler
Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. 53 (2) (2018)
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
Reachability for Dynamic Parametric Processes. VMCAI (2017)
Michael Luttenberger, Raphaela Palenta, Helmut Seidl
Computing the longest common prefix of a context-free language in polynomial time. CoRR (2017)
Helmut Seidl, Ralf Vogler
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. ATVA (2017)
Emmanuel Filiot, Sebastian Maneth, Helmut Seidl
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7 (4) (2017)
Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu
Verifying Security Policies in Multi-agent Workflows with Loops. CoRR (2017)
Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu
Verifying Security Policies in Multi-agent Workflows with Loops. CCS (2017)
Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
Inter-procedural Two-Variable Herbrand Equalities. Log. Methods Comput. Sci. 13 (2) (2017)
Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler
Enforcing Termination of Interprocedural Analysis. SAS (2016)
Vesal Vojdani, Kalmer Apinis, Vootele Rõtov, Helmut Seidl, Varmo Vene, Ralf Vogler
Static race detection for device drivers: the Goblint approach. ASE (2016)
Bernd Finkbeiner, Helmut Seidl, Christian Müller
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA (2016)
Anca Muscholl, Helmut Seidl, Igor Walukiewicz
Reachability for dynamic parametric processes. CoRR (2016)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616 (2016)
Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani
Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120 (2016)
Kalmer Apinis, Helmut Seidl, Vesal Vojdani
Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi (2016)
Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler
Enforcing Termination of Interprocedural Analysis. CoRR (2016)
Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl
Transforming XML Streams with References. SPIRE (2015)
Helmut Seidl, Sebastian Maneth, Gregor Kemper
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR (2015)
Helmut Seidl, Sebastian Maneth, Gregor Kemper
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS (2015)
Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
Inter-procedural Two-Variable Herbrand Equalities. ESOP (2015)
Christian Müller, Máté Kovács, Helmut Seidl
An Analysis of Universal Information Flow Based on Self-Composition. CSF (2015)
Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani
Efficiently intertwining widening and narrowing. CoRR (2015)
Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz
Parametric Strategy Iteration. SCSS (2014)
Thomas Martin Gawlitza, Martin D. Schwarz, Helmut Seidl
Parametric Strategy Iteration. CoRR (2014)
Thomas Martin Gawlitza, Helmut Seidl
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. 44 (2) (2014)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory (2014)
Helmut Seidl, Máté Kovács
Interprocedural Information Flow Analysis of XML Processors. LATA (2014)
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Kalmer Apinis
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI (2014)
Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
Inter-procedural Two-Variable Herbrand Equalities. CoRR (2014)
Kalmer Apinis, Helmut Seidl, Vesal Vojdani
How to combine widening and narrowing for non-monotonic systems of equations. PLDI (2013)
Máté Kovács, Helmut Seidl, Bernd Finkbeiner
Relational abstract interpretation for the verification of 2-hypersafety properties. CCS (2013)
Sebastian Maneth, Helmut Seidl
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3 (5) (2013)
Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner
Contextual Locking for Dynamic Pushdown Networks. SAS (2013)
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
Look-Ahead Removal for Top-Down Tree Transducers. CoRR (2013)
Helmut Seidl, Andreas Reuß
Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS (2012)
Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault
Abstract interpretation meets convex optimization. J. Symb. Comput. 47 (12) (2012)
Andreas Reuß, Helmut Seidl
-Clauses. CIAA (2012)
Rayna Dimitrova, Bernd Finkbeiner, Máté Kovács, Markus N. Rabe, Helmut Seidl
Model Checking Information Flow in Reactive Systems. VMCAI (2012)
Máté Kovács, Helmut Seidl
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS (2012)
Thomas Martin Gawlitza, Helmut Seidl
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration CoRR (2012)
Kalmer Apinis, Helmut Seidl, Vesal Vojdani
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS (2012)
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)
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)
Helmut Seidl, Andreas Reuß
-clauses with disequalities. Inf. Process. Lett. 111 (20) (2011)
Andrea Flexeder, Michael Petter, Helmut Seidl
Side-Effect Analysis of Assembly Code. SAS (2011)
Sylvia Friese, Helmut Seidl, Sebastian Maneth
Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22 (7) (2011)
Thomas Martin Gawlitza, Helmut Seidl
Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33 (3) (2011)
Andrea Flexeder, Markus Müller-Olm, Michael Petter, Helmut Seidl
Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33 (6) (2011)
Jörg Kreiker, Helmut Seidl, Vesal Vojdani
Shape Analysis of Low-Level C with Overlapping Structures. VMCAI (2010)
Sylvia Friese, Helmut Seidl, Sebastian Maneth
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory (2010)
Thomas Martin Gawlitza, Helmut Seidl
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS (2010)
Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma
Normalization of Linear Horn Clauses. SBMF (2010)

Helmut Seidl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Helmut Seidl