A quadratic regularity test for non-deleting macro S grammars. - Helmut Seidl (FCT, 1985)

On the Degree of Ambiguity of Finite Automata. - Andreas Weber; Helmut Seidl (MFCS, 1986)

Parameter Reduction of Higher Level Grammars. - Helmut Seidl (Theor. Comput. Sci., 1987)

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

On the Finite Degree of Ambiguity of Finite Tree Automata. - Helmut Seidl (FCT, 1989)

Deciding Equivalence of Finite Tree Automata. - Helmut Seidl (STACS, 1989)

Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. - Helmut Seidl (CAAP, 1990)

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. - Andreas Goerdt; Helmut Seidl (IMYCS, 1990)

Tree Automata for Code Selection. - Christian Ferdinand; Helmut Seidl; Reinhard Wilhelm (Code Generation, 1991)

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

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

Ambiguity and valuedness. - Helmut Seidl (Tree Automata and Languages, 1992)

Baumautomaten zur Codeselektion. - Christian Ferdinand; Helmut Seidl; Reinhard Wilhelm (Informatik, 1992)

Finite Tree Automata with Cost Functions. - Helmut Seidl (CAAP, 1992)

Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. - Helmut Seidl (Theor. Comput. Sci., 1992)

When Is a Functional Tree Transduction Deterministic? - Helmut Seidl (TAPSOFT, 1993)

Least Solutions of Equations over N. - Helmut Seidl (ICALP, 1994)

Haskell Overloading is DEXPTIME-Complete. - Helmut Seidl (Inf. Process. Lett., 1994)

Equivalence of Finite-Valued Tree Transducers Is Decidable. - Helmut Seidl (Math. Syst. Theory, 1994)

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

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

Integer Constraints to Stop Deforestation. - Helmut Seidl (ESOP, 1996)

A Modal Mu-Calculus for Durational Transition Systems. - Helmut Seidl (LICS, 1996)

An Even Faster Solver for General Systems of Equations. - Christian Fecht; Helmut Seidl (SAS, 1996)

Fast and Simple Nested Fixpoints. - Helmut Seidl (Inf. Process. Lett., 1996)

Least and Greatest Solutions of Equations over N. - Helmut Seidl (Nord. J. Comput., 1996)

Language Support for Synchronous Parallel Critical Sections. - Christoph W. Keßler; Helmut Seidl (APDC, 1997)

Constraints to Stop Higher-Order Deforestation. - Helmut Seidl; Morten Heine Sørensen (POPL, 1997)

Disjuntive Completion Is Not "Optimal". - Helmut Seidl; Christian Fecht (ILPS, 1997)

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

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

Model-Checking for L2 - Helmut Seidl (Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997)

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

Locating Matches of Tree Patterns in Forests. - Andreas Neumann 001; Helmut Seidl (FSTTCS, 1998)

Constraints to Stop Deforestation. - Helmut Seidl; Morten Heine Sørensen (Sci. Comput. Program., 1998)

On Guarding Nested Fixpoints. - Helmut Seidl; Andreas Neumann 001 (CSL, 1999)

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

On distributive fixed-point expressions. - Helmut Seidl; Damian Niwinski (RAIRO Theor. Informatics Appl., 1999)

A Faster Solver for General Systems of Equations. - Christian Fecht; Helmut Seidl (Sci. Comput. Program., 1999)

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

Constraint-Based Inter-Procedural Analysis of Parallel Programs. - Helmut Seidl; Bernhard Steffen (ESOP, 2000)

Interprocedural Analyses: A Comparison. - Helmut Seidl; Christian Fecht (J. Log. Program., 2000)

Control-Flow Analysis in Cubic Time. - Flemming Nielson; Helmut Seidl (ESOP, 2001)

Synchronized Tree Languages Revisited and New Applications. - Valérie Gouranton; Pierre Réty; Helmut Seidl (FoSSaCS, 2001)

Weakly Regular Relations and Applications. - Sébastien Limet; Pierre Réty; Helmut Seidl (RTA, 2001)

On optimal slicing of parallel programs. - Markus Müller-Olm; Helmut Seidl (STOC, 2001)

Cryptographic Analysis in Cubic Time. - Flemming Nielson; Hanne Riis Nielson; Helmut Seidl (TOSCA, 2001)

Succinct Solvers - Flemming Nielson; Helmut Seidl (Universität Trier, Mathematik/Informatik, Forschungsbericht, 2001)

Transparent teleteaching. - Peter Ziewer; Helmut Seidl (ASCILITE, 2002)

Automatic Complexity Analysis. - Flemming Nielson; Hanne Riis Nielson; Helmut Seidl (ESOP, 2002)

Binary Queries. - Alexandru Berlea; Helmut Seidl (Extreme Markup Languages®, 2002)

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

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

Polynomial Constants Are Decidable. - Markus Müller-Olm; Helmut Seidl (SAS, 2002)

Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. - Flemming Nielson; Hanne Riis Nielson; Helmut Seidl (SAS, 2002)

A Succinct Solver for ALFP. - Flemming Nielson; Helmut Seidl; Hanne Riis Nielson (Nord. J. Comput., 2002)

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

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

Numerical document queries. - Helmut Seidl; Thomas Schwentick; Anca Muscholl (PODS, 2003)

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

Annotiertes Lecture Recording. - Peter Ziewer; Helmut Seidl (DeLFI, 2004)

A Note on Karr's Algorithm. - Markus Müller-Olm; Helmut Seidl (ICALP, 2004)

Counting in Trees for Free. - Helmut Seidl; Thomas Schwentick; Anca Muscholl; Peter Habermehl (ICALP, 2004)

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

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

Precise interprocedural analysis through linear algebra. - Markus Müller-Olm; Helmut Seidl (POPL, 2004)

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

Computing polynomial program invariants. - Markus Müller-Olm; Helmut Seidl (Inf. Process. Lett., 2004)

Macro forest transducers. - Thomas Perst; Helmut Seidl (Inf. Process. Lett., 2004)

Binary Queries for Document Trees. - Alexandru Berlea; Helmut Seidl (Nord. J. Comput., 2004)

On the Complexity of Equational Horn Clauses. - Kumar Neeraj Verma; Helmut Seidl; Thomas Schwentick (CADE, 2005)

Analysis of Modular Arithmetic. - Markus Müller-Olm; Helmut Seidl (ESOP, 2005)

Interprocedural Herbrand Equalities. - Markus Müller-Olm; Helmut Seidl; Bernhard Steffen (ESOP, 2005)

XML type checking with macro tree transducers. - Sebastian Maneth; Alexandru Berlea; Thomas Perst; Helmut Seidl (PODS, 2005)

A Generic Framework for Interprocedural Analysis of Numerical Properties. - Markus Müller-Olm; Helmut Seidl (SAS, 2005)

Checking Herbrand Equalities and Beyond. - Markus Müller-Olm; Oliver Rüthing; Helmut Seidl (VMCAI, 2005)

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. - Helmut Seidl; Kumar Neeraj Verma (Program Analysis and Compilation, 2006)

Interprocedurally Analyzing Polynomial Identities. - Markus Müller-Olm; Michael Petter; Helmut Seidl (STACS, 2006)

Computing Game Values for Crash Games. - Thomas Gawlitza; Helmut Seidl (ATVA, 2007)

Precise Relational Invariants Through Strategy Iteration. - Thomas Gawlitza; Helmut Seidl (CSL, 2007)

Precise Fixpoint Computation Through Strategy Iteration. - Thomas Gawlitza; Helmut Seidl (ESOP, 2007)

Interprocedurally Analysing Linear Inequality Relations. - Helmut Seidl; Andrea Flexeder; Michael Petter (ESOP, 2007)

Exact XML Type Checking in Polynomial Time. - Sebastian Maneth; Thomas Perst; Helmut Seidl (ICDT, 2007)

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. - Sebastian Maneth; Helmut Seidl (PLAN-X, 2007)

Counting in trees. - Helmut Seidl; Thomas Schwentick; Anca Muscholl (Logic and Automata, 2008)

Upper Adjoints for Fast Inter-procedural Variable Equalities. - Markus Müller-Olm; Helmut Seidl (ESOP, 2008)

Precise Interval Analysis vs. Parity Games. - Thomas Gawlitza; Helmut Seidl (FM, 2008)

Lightweight Verification 2008. - Martin Leucker; Helmut Seidl (GI Jahrestagung (2), 2008)

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

Analysing All Polynomial Equations in . - Helmut Seidl; Andrea Flexeder; Michael Petter (SAS, 2008)

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

Games through Nested Fixpoints. - Thomas Gawlitza; Helmut Seidl (CAV, 2009)

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

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

Region Analysis for Race Detection. - Helmut Seidl; Vesal Vojdani (SAS, 2009)

Program Analysis through Finite Tree Automata. - Helmut Seidl (CIAA, 2009)

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

Compiler Design - Virtual Machines. - Reinhard Wilhelm; Helmut Seidl (Springer, 2010)

Interprocedural Control Flow Reconstruction. - Andrea Flexeder; Bogdan Mihaila; Michael Petter; Helmut Seidl (APLAS, 2010)

Abstract Interpretation over Zones without Widening. - Thomas Martin Gawlitza; Helmut Seidl (WING@ETAPS/IJCAR, 2010)

Minimization of Deterministic Bottom-Up Tree Transducers. - Sylvia Friese; Helmut Seidl; Sebastian Maneth (Developments in Language Theory, 2010)

What Is a Pure Functional? - Martin Hofmann 001; Aleksandr Karbyshev; Helmut Seidl (ICALP (2), 2010)

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

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. - Thomas Martin Gawlitza; Helmut Seidl (SAS, 2010)

Verifying a Local Generic Solver in Coq. - Martin Hofmann 001; Aleksandr Karbyshev; Helmut Seidl (SAS, 2010)

Normalization of Linear Horn Clauses. - Thomas Martin Gawlitza; Helmut Seidl; Kumar Neeraj Verma (SBMF, 2010)

Shape Analysis of Low-Level C with Overlapping Structures. - Jörg Kreiker; Helmut Seidl; Vesal Vojdani (VMCAI, 2010)

Praktische Programmverifikation durch statische Analyse. - Helmut Seidl (Inform. Spektrum, 2010)

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 (POPL, 2011)

Side-Effect Analysis of Assembly Code. - Andrea Flexeder; Michael Petter; Helmut Seidl (SAS, 2011)

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 (VMCAI, 2011)

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

Extending H1-clauses with disequalities. - Helmut Seidl; Andreas Reuß (Inf. Process. Lett., 2011)

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

Solving systems of rational equations through strategy iteration. - Thomas Martin Gawlitza; Helmut Seidl (ACM Trans. Program. Lang. Syst., 2011)

Compiler Design - Analysis and Transformation. - Helmut Seidl; Reinhard Wilhelm; Sebastian Hack (Springer, 2012)

Type Checking of Tree Walking Transducers. - Sebastian Maneth; Sylvia Friese; Helmut Seidl (Modern Applications of Automata Theory, 2012)

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

Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. - Máté Kovács; Helmut Seidl (ESSoS, 2012)

Extending ${ cal H}_1$ -Clauses with Path Disequalities. - Helmut Seidl; Andreas Reuß (FoSSaCS, 2012)

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

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. - Andreas Reuß; Helmut Seidl (CIAA, 2012)

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

Precise Program Analysis through Strategy Iteration and Optimization. - Thomas Martin Gawlitza; Helmut Seidl (Software Safety and Security, 2012)

Compiler Design - Syntactic and Semantic Analysis. - Reinhard Wilhelm; Helmut Seidl; Sebastian Hack (Springer, 2013)

Relational abstract interpretation for the verification of 2-hypersafety properties. - Máté Kovács; Helmut Seidl; Bernd Finkbeiner (CCS, 2013)

How to combine widening and narrowing for non-monotonic systems of equations. - Kalmer Apinis; Helmut Seidl; Vesal Vojdani (PLDI, 2013)

Contextual Locking for Dynamic Pushdown Networks. - Peter Lammich; Markus Müller-Olm; Helmut Seidl; Alexander Wenner (SAS, 2013)

Look-Ahead Removal for Top-Down Tree Transducers. - Joost Engelfriet; Sebastian Maneth; Helmut Seidl (CoRR, 2013)

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). - Sebastian Maneth; Helmut Seidl (Dagstuhl Reports, 2013)

How to Remove the Look-Ahead of Top-Down Tree Transducers. - Joost Engelfriet; Sebastian Maneth; Helmut Seidl (Developments in Language Theory, 2014)

Interprocedural Information Flow Analysis of XML Processors. - Helmut Seidl; Máté Kovács (LATA, 2014)

Parametric Strategy Iteration. - Helmut Seidl; Thomas Martin Gawlitza; Martin D. Schwarz (SCSS, 2014)

Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. - Martin D. Schwarz; Helmut Seidl; Vesal Vojdani; Kalmer Apinis (VMCAI, 2014)

Numerical invariants through convex relaxation and max-strategy iteration. - Thomas Martin Gawlitza; Helmut Seidl (Formal Methods Syst. Des., 2014)

Frameworks for Interprocedural Analysis of Concurrent Programs. - Helmut Seidl; Kalmer Apinis; Vesal Vojdani (Software Systems Safety, 2014)

An Analysis of Universal Information Flow Based on Self-Composition. - Christian Müller 008; Máté Kovács; Helmut Seidl (CSF, 2015)

Inter-procedural Two-Variable Herbrand Equalities. - Stefan Schulze Frielinghaus; Michael Petter; Helmut Seidl (ESOP, 2015)

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. - Helmut Seidl; Sebastian Maneth; Gregor Kemper (FOCS, 2015)

Transforming XML Streams with References. - Sebastian Maneth; Alberto Ordóñez Pereira; Helmut Seidl (SPIRE, 2015)

Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. - Bernd Finkbeiner; Helmut Seidl; Christian Müller 008 (ATVA, 2016)

Enhancing Top-Down Solving with Widening and Narrowing. - Kalmer Apinis; Helmut Seidl; Vesal Vojdani (Semantics, Logics, and Calculi, 2016)

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

Enforcing Termination of Interprocedural Analysis. - Stefan Schulze Frielinghaus; Helmut Seidl; Ralf Vogler (SAS, 2016)

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

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

Equivalence - Combinatorics, Algebra, Proofs. - Helmut Seidl; Sebastian Maneth; Gregor Kemper; Joost Engelfriet (Dependable Software Systems Engineering, 2016)

Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. - Helmut Seidl; Ralf Vogler (ATVA, 2017)

Verifying Security Policies in Multi-agent Workflows with Loops. - Bernd Finkbeiner; Christian Müller 008; Helmut Seidl; Eugen Zalinescu (CCS, 2017)

Reachability for Dynamic Parametric Processes. - Anca Muscholl; Helmut Seidl; Igor Walukiewicz (VMCAI, 2017)

Formal Methods of Transformations (Dagstuhl Seminar 17142). - Emmanuel Filiot; Sebastian Maneth; Helmut Seidl (Dagstuhl Reports, 2017)

Inductive Invariants for Noninterference in Multi-agent Workflows. - Christian Müller 008; Helmut Seidl; Eugen Zalinescu (CSF, 2018)

Three Improvements to the Top-Down Solver. - Helmut Seidl; Ralf Vogler (PPDP, 2018)

Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. - Michael Luttenberger; Raphaela Palenta; Helmut Seidl (STACS, 2018)

Balancedness of MSO transductions in polynomial time. - Sebastian Maneth; Helmut Seidl (Inf. Process. Lett., 2018)

Paths, tree homomorphisms and disequalities for -clauses. - Andreas Reuß; Helmut Seidl (Math. Struct. Comput. Sci., 2018)

Synthesizing Efficient Low-Precision Kernels. - Anastasiia Izycheva; Eva Darulova; Helmut Seidl (ATVA, 2019)

Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. - Helmut Seidl; Raphaela Palenta; Sebastian Maneth (FoSSaCS, 2019)

How to Win First Order Safety Games - Software Artifact. - Helmut Seidl; Christian Müller 008; Bernd Finkbeiner (Zenodo, 2019)

How to Win First Order Safety Games - Software Artifact. - Helmut Seidl; Christian Müller 008; Bernd Finkbeiner (Zenodo, 2019)

Incremental Abstract Interpretation. - Helmut Seidl; Julian Erhard; Ralf Vogler (From Lambda Calculus to Cybersecurity Through Program Analysis, 2020)

Equivalence of Linear Tree Transducers with Output in the Free Group. - Raphaela Löbel; Michael Luttenberger; Helmut Seidl (DLT, 2020)

On the Balancedness of Tree-to-Word Transducers. - Raphaela Löbel; Michael Luttenberger; Helmut Seidl (DLT, 2020)

When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? - Sebastian Maneth; Helmut Seidl (ICALP, 2020)

Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. - Anastasiia Izycheva; Eva Darulova; Helmut Seidl (SAS, 2020)

Stratified Guarded First-Order Transition Systems. - Christan Müller; Helmut Seidl (SAS, 2020)

How to Win First-Order Safety Games. - Helmut Seidl; Christian Müller 008; Bernd Finkbeiner (VMCAI, 2020)

Definability Results for Top-Down Tree Transducers. - Sebastian Maneth; Helmut Seidl; Martin Vu (DLT, 2021)

Improving Thread-Modular Abstract Interpretation. - Michael Schwarz 007; Simmo Saan; Helmut Seidl; Kalmer Apinis; Julian Erhard; Vesal Vojdani (SAS, 2021)

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

How to Decide Functionality of Compositions of Top-Down Tree Transducers. - Sebastian Maneth; Helmut Seidl; Martin Vu (CAI, 2022)

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

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. - Michael Schwarz 007; Simmo Saan; Helmut Seidl; Julian Erhard; Vesal Vojdani (ESOP, 2023)

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

Octagons Revisited - Elegant Proofs and Simplified Algorithms. - Michael Schwarz 007; Helmut Seidl (SAS, 2023)

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

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

The Top-Down Solver - An Exercise in A2I. - Sarah Tilscher; Yannick Stade; Michael Schwarz 007; Ralf Vogler; Helmut Seidl (Challenges of Software Verification, 2023)

Correctness Witness Validation by Abstract Interpretation. - Simmo Saan; Michael Schwarz 007; Julian Erhard; Helmut Seidl; Sarah Tilscher; Vesal Vojdani (Zenodo, 2023)

Goblint at SV-COMP 2024. - Simmo Saan; Julian Erhard; Michael Schwarz 007; Stanimir Bozhilov; Karoliine Holter; Sarah Tilscher; Vesal Vojdani; Helmut Seidl (Zenodo, 2023)

Goblint at SV-COMP 2024. - Simmo Saan; Julian Erhard; Michael Schwarz 007; Stanimir Bozhilov; Karoliine Holter; Sarah Tilscher; Vesal Vojdani; Helmut Seidl (Zenodo, 2023)

Goblint at SV-COMP 2024. - Simmo Saan; Julian Erhard; Michael Schwarz 007; Stanimir Bozhilov; Karoliine Holter; Sarah Tilscher; Vesal Vojdani; Helmut Seidl (Zenodo, 2023)

Goblint at SV-COMP 2024. - Simmo Saan; Julian Erhard; Michael Schwarz 007; Stanimir Bozhilov; Karoliine Holter; Sarah Tilscher; Vesal Vojdani; Helmut Seidl (Zenodo, 2023)

Goblint at SV-COMP 2024. - Simmo Saan; Michael Schwarz 007; Julian Erhard; Helmut Seidl; Sarah Tilscher; Vesal Vojdani (Zenodo, 2023)

Goblint at SV-COMP 2024. - Simmo Saan; Michael Schwarz 007; Julian Erhard; Helmut Seidl; Sarah Tilscher; Vesal Vojdani (Zenodo, 2023)

2-Pointer Logic. - Helmut Seidl; Julian Erhard; Michael Schwarz 007; Sarah Tilscher (Taming the Infinities of Concurrency, 2024)

The Top-Down Solver Verified: Building Confidence in Static Analyzers. - Yannick Stade; Sarah Tilscher; Helmut Seidl (CAV (1), 2024)

C-2PO: A Weakly Relational Pointer Domain: "These Are Not the Memory Cells You Are Looking For". - Rebecca Ghidini; Julian Erhard; Michael Schwarz 007; Helmut Seidl (NSAD@SAS, 2024)

When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly. - Julian Erhard; Johanna Franziska Schinabeck; Michael Schwarz 007; Helmut Seidl (SOAP@PLDI, 2024)

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

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

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

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

Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts (Extended Version). - Julian Erhard; Manuel Bentele; Matthias Heizmann; Dominik Klumpp; Simmo Saan; Frank Schüssele; Michael Schwarz 007; Helmut Seidl; Sarah Tilscher; Vesal Vojdani (CoRR, 2024)

Prenex universal first-order safety properties. - Besik Dundua; Ioane Kapanadze; Helmut Seidl (Inf. Process. Lett., 2024)

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

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

C-2PO: A Weakly Relational Pointer Domain. - Rebecca Ghidini; Michael Schwarz 007; Julian Erhard; Helmut Seidl (Zenodo, 2024)

Non-numerical weakly relational domains. - Helmut Seidl; Julian Erhard; Sarah Tilscher; Michael Schwarz 007 (Int. J. Softw. Tools Technol. Transf., 2024)

Artifact for the VMCAI'2025 Paper "Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts". - Julian Erhard; Manuel Bentele; Matthias Heizmann; Dominik Klumpp; Simmo Saan; Frank Schüssele; Michael Schwarz 007; Helmut Seidl; Sarah Tilscher; Vesal Vojdani (Zenodo, 2024)

Goblint at SV-COMP 2025. - Simmo Saan; Karoliine Holter; Julian Erhard; Michael Schwarz 007; Sarah Tilscher; Vesal Vojdani; Helmut Seidl (Zenodo, 2024)

When long jumps fall short: control-flow tracking and misuse detection for nonlocal jumps in C. - Julian Erhard; Michael Schwarz 007; Vesal Vojdani; Simmo Saan; Helmut Seidl (Int. J. Softw. Tools Technol. Transf., 2024)

Goblint at SV-COMP 2025. - Simmo Saan; Karoliine Holter; Julian Erhard; Michael Schwarz 007; Sarah Tilscher; Vesal Vojdani; Helmut Seidl (Zenodo, 2024)

Interactive abstract interpretation: reanalyzing multithreaded C programs for cheap. - Julian Erhard; Simmo Saan; Sarah Tilscher; Michael Schwarz 007; Karoliine Holter; Vesal Vojdani; Helmut Seidl (Int. J. Softw. Tools Technol. Transf., 2024)

Dead Gate Elimination. - Yanbin Chen; Christian B. Mendl; Helmut Seidl (ICCS (3), 2025)

Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts. - Julian Erhard; Manuel Bentele; Matthias Heizmann; Dominik Klumpp; Simmo Saan; Frank Schüssele; Michael Schwarz 007; Helmut Seidl; Sarah Tilscher; Vesal Vojdani (VMCAI (1), 2025)

Taking Out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses. - Fabian Stemmler; Michael Schwarz 007; Julian Erhard; Sarah Tilscher; Helmut Seidl (Proc. ACM Program. Lang., 2025)

Artifact for 'Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses'. - Fabian Stemmler; Michael Schwarz 007; Julian Erhard; Sarah Tilscher; Helmut Seidl (Zenodo, 2025)

Artifact for 'Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses'. - Fabian Stemmler; Michael Schwarz 007; Julian Erhard; Sarah Tilscher; Helmut Seidl (Zenodo, 2025)

Artifact for 'Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses'. - Fabian Stemmler; Michael Schwarz 007; Julian Erhard; Sarah Tilscher; Helmut Seidl (Zenodo, 2025)

Artifact for 'Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses'. - Fabian Stemmler; Michael Schwarz 007; Julian Erhard; Sarah Tilscher; Helmut Seidl (Zenodo, 2025)

Correctness Proofs for Top-Down Solvers with Widening and Narrowing in Isabelle. - Sarah Tilscher; Alexandra Graß; Helmut Seidl; Yannick Stade (Zenodo, 2025)

Stratified guarded first-order transition systems. - Christian Müller; Helmut Seidl (Formal Methods Syst. Des., 2025)

Context Gas and friends: taming context-sensitivity on the fly. - Julian Erhard; Johanna Franziska Schinabeck; Michael Schwarz 007; Helmut Seidl (Int. J. Softw. Tools Technol. Transf., 2025)

Correctness Proofs for Top-Down Solvers with Widening and Narrowing in Isabelle. - Sarah Tilscher; Alexandra Graß; Helmut Seidl; Yannick Stade (Zenodo, 2025)