Helmut Seidl - RankMe

255 papers A* 18A 21B 42C 11Journal 104Unranked 48

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Dead gate elimination in hybrid quantum-classical programs. J. Comput. Sci. Yanbin Chen, Christian B. Mendl, Helmut Seidl
2026	—	`conf`	Goblint: A Portfolio for Mixed Flow-Sensitive Abstract Interpretation - (Competition Contribution). TACAS (2) Simmo Saan, Ali Rasim Kocal, Michael Petter, Karoliine Holter, Julian Erhard, Michael Schwarz, Vesal Vojdani, Helmut Seidl
2026	—	`conf`	Max-Policy Iteration, Revisited. ESOP (2) David Monniaux, Helmut Seidl
2026	J	`jnl`	Same Engine, Multiple Gears: Parallelizing Fixpoint Iteration at Different Granularities (Extended Version). CoRR Ali Rasim Kocal, Michael Schwarz, Simmo Saan, Helmut Seidl
2026	—	`conf`	Same Engine, Multiple Gears: Parallelizing Fixpoint Iteration at Different Granularities. TACAS (2) Ali Rasim Kocal, Michael Schwarz, Simmo Saan, Helmut Seidl
2025	J	`jnl`	Context Gas and friends: taming context-sensitivity on the fly. Int. J. Softw. Tools Technol. Transf. Julian Erhard, Johanna Franziska Schinabeck, Michael Schwarz, Helmut Seidl
2025	—	`conf`	Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts. VMCAI (1) Julian Erhard, Manuel Bentele, Matthias Heizmann, Dominik Klumpp, Simmo Saan, Frank Schüssele, Michael Schwarz, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
2025	—	`conf`	Dead Gate Elimination. ICCS (3) Yanbin Chen, Christian B. Mendl, Helmut Seidl
2025	J	`jnl`	Dead Gate Elimination. CoRR Yanbin Chen, Christian B. Mendl, Helmut Seidl
2025	J	`jnl`	Stratified guarded first-order transition systems. Formal Methods Syst. Des. Christian Müller, Helmut Seidl
2025	J	`jnl`	Taking Out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses. Proc. ACM Program. Lang. Fabian Stemmler, Michael Schwarz, Julian Erhard, Sarah Tilscher, Helmut Seidl
2025	J	`jnl`	Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses. CoRR Fabian Stemmler, Michael Schwarz, Julian Erhard, Sarah Tilscher, Helmut Seidl
2025	J	`jnl`	When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? CoRR Sebastian Maneth, Helmut Seidl
2024	—	`conf`	2-Pointer Logic. Taming the Infinities of Concurrency Helmut Seidl, Julian Erhard, Michael Schwarz, Sarah Tilscher
2024	—	`conf`	C-2PO: A Weakly Relational Pointer Domain: "These Are Not the Memory Cells You Are Looking For". NSAD@SAS Rebecca Ghidini, Julian Erhard, Michael Schwarz, Helmut Seidl
2024	J	`jnl`	Checking in polynomial time whether or not a regular tree language is deterministic top-down. Inf. Process. Lett. Sebastian Maneth, Helmut Seidl
2024	—	`conf`	Correctness Witness Validation by Abstract Interpretation. VMCAI (1) Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
2024	J	`jnl`	Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts (Extended Version). CoRR Julian Erhard, Manuel Bentele, Matthias Heizmann, Dominik Klumpp, Simmo Saan, Frank Schüssele, Michael Schwarz, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
2024	J	`jnl`	Functionality of compositions of top-down tree transducers is decidable. Inf. Comput. Sebastian Maneth, Helmut Seidl, Martin Vu
2024	—	`conf`	Goblint Validator: Correctness Witness Validation by Abstract Interpretation - (Competition Contribution). TACAS (3) Simmo Saan, Julian Erhard, Michael Schwarz, Stanimir Bozhilov, Karoliine Holter, Sarah Tilscher, Vesal Vojdani, Helmut Seidl
2024	—	`conf`	Goblint: Abstract Interpretation for Memory Safety and Termination - (Competition Contribution). TACAS (3) Simmo Saan, Julian Erhard, Michael Schwarz, Stanimir Bozhilov, Karoliine Holter, Sarah Tilscher, Vesal Vojdani, Helmut Seidl
2024	J	`jnl`	Interactive abstract interpretation: reanalyzing multithreaded C programs for cheap. Int. J. Softw. Tools Technol. Transf. Julian Erhard, Simmo Saan, Sarah Tilscher, Michael Schwarz, Karoliine Holter, Vesal Vojdani, Helmut Seidl
2024	J	`jnl`	Non-Numerical Weakly Relational Domains. CoRR Helmut Seidl, Julian Erhard, Sarah Tilscher, Michael Schwarz
2024	J	`jnl`	Non-numerical weakly relational domains. Int. J. Softw. Tools Technol. Transf. Helmut Seidl, Julian Erhard, Sarah Tilscher, Michael Schwarz
2024	J	`jnl`	Partial Correctness of the Top-Down Solver. Arch. Formal Proofs Yannick Stade, Sarah Tilscher, Helmut Seidl
2024	J	`jnl`	Prenex universal first-order safety properties. Inf. Process. Lett. Besik Dundua, Ioane Kapanadze, Helmut Seidl
2024	—	`conf`	The Top-Down Solver Verified: Building Confidence in Static Analyzers. CAV (1) Yannick Stade, Sarah Tilscher, Helmut Seidl
2024	J	`jnl`	When long jumps fall short: control-flow tracking and misuse detection for nonlocal jumps in C. Int. J. Softw. Tools Technol. Transf. Julian Erhard, Michael Schwarz, Vesal Vojdani, Simmo Saan, Helmut Seidl
2024	—	`conf`	When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly. SOAP@PLDI Julian Erhard, Johanna Franziska Schinabeck, Michael Schwarz, Helmut Seidl
2023	J	`jnl`	Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down. CoRR Sebastian Maneth, Helmut Seidl
2023	A	`conf`	Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. ESOP Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani
2023	J	`jnl`	Clustered Relational Thread-Modular Abstract Interpretation with Local Traces. CoRR Michael Schwarz, Simmo Saan, Helmut Seidl, Julian Erhard, Vesal Vojdani
2023	J	`jnl`	Correctness Witness Validation by Abstract Interpretation. CoRR Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
2023	J	`jnl`	Deciding origin equivalence of weakly self-nesting macro tree transducers. Inf. Process. Lett. Sebastian Maneth, Helmut Seidl
2023	J	`jnl`	Definability Results for Top-Down Tree Transducers. Int. J. Found. Comput. Sci. Sebastian Maneth, Helmut Seidl, Martin Vu
2023	—	`conf`	Goblint: Autotuning Thread-Modular Abstract Interpretation - (Competition Contribution). TACAS (2) Simmo Saan, Michael Schwarz, Julian Erhard, Manuel Pietsch, Helmut Seidl, Sarah Tilscher, Vesal Vojdani
2023	B	`conf`	Octagons Revisited - Elegant Proofs and Simplified Algorithms. SAS Michael Schwarz, Helmut Seidl
2023	—	`ch.`	The Top-Down Solver - An Exercise in A Challenges of Software Verification Sarah Tilscher, Yannick Stade, Michael Schwarz, Ralf Vogler, Helmut Seidl
2023	—	`conf`	When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C. SOAP@PLDI Michael Schwarz, Julian Erhard, Vesal Vojdani, Simmo Saan, Helmut Seidl
2022	—	`conf`	How to Decide Functionality of Compositions of Top-Down Tree Transducers. CAI Sebastian Maneth, Helmut Seidl, Martin Vu
2022	J	`jnl`	How to decide Functionality of Compositions of Top-Down Tree Transducers. CoRR Sebastian Maneth, Helmut Seidl, Martin Vu
2022	J	`jnl`	Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap. CoRR Julian Erhard, Simmo Saan, Sarah Tilscher, Michael Schwarz, Karoliine Holter, Vesal Vojdani, Helmut Seidl
2022	C	`ed.`	Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings ICTAC Helmut Seidl, Zhiming Liu, Corina S. Pasareanu
2021	C	`conf`	Definability Results for Top-Down Tree Transducers. DLT Sebastian Maneth, Helmut Seidl, Martin Vu
2021	J	`jnl`	Definability Results for Top-Down Tree Transducers. CoRR Sebastian Maneth, Helmut Seidl, Martin Vu
2021	—	`conf`	Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution). TACAS (2) Simmo Saan, Michael Schwarz, Kalmer Apinis, Julian Erhard, Helmut Seidl, Ralf Vogler, Vesal Vojdani
2021	B	`conf`	Improving Thread-Modular Abstract Interpretation. SAS Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani
2021	J	`jnl`	Improving Thread-Modular Abstract Interpretation. CoRR Michael Schwarz, Simmo Saan, Helmut Seidl, Kalmer Apinis, Julian Erhard, Vesal Vojdani
2021	J	`jnl`	On the Balancedness of Tree-to-Word Transducers. Int. J. Found. Comput. Sci. Raphaela Löbel, Michael Luttenberger, Helmut Seidl
2021	J	`jnl`	Three improvements to the top-down solver. Math. Struct. Comput. Sci. Helmut Seidl, Ralf Vogler
2020	B	`conf`	Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. SAS Anastasiia Izycheva, Eva Darulova, Helmut Seidl
2020	C	`conf`	Equivalence of Linear Tree Transducers with Output in the Free Group. DLT Raphaela Löbel, Michael Luttenberger, Helmut Seidl
2020	J	`jnl`	Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR Raphaela Löbel, Michael Luttenberger, Helmut Seidl
2020	B	`conf`	How to Win First-Order Safety Games. VMCAI Helmut Seidl, Christian Müller, Bernd Finkbeiner
2020	—	`conf`	Incremental Abstract Interpretation. From Lambda Calculus to Cybersecurity Through Program Analysis Helmut Seidl, Julian Erhard, Ralf Vogler
2020	C	`conf`	On the Balancedness of Tree-to-Word Transducers. DLT Raphaela Löbel, Michael Luttenberger, Helmut Seidl
2020	B	`conf`	Stratified Guarded First-Order Transition Systems. SAS Christan Müller, Helmut Seidl
2020	A*	`conf`	When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP Sebastian Maneth, Helmut Seidl
2019	J	`jnl`	Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR Helmut Seidl, Raphaela Palenta, Sebastian Maneth
2019	B	`conf`	Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS Helmut Seidl, Raphaela Palenta, Sebastian Maneth
2019	J	`jnl`	How to Win First-Order Safety Games. CoRR Helmut Seidl, Christian Müller, Bernd Finkbeiner
2019	J	`jnl`	On the Balancedness of Tree-to-word Transducers. CoRR Raphaela Löbel, Michael Luttenberger, Helmut Seidl
2019	B	`conf`	Synthesizing Efficient Low-Precision Kernels. ATVA Anastasiia Izycheva, Eva Darulova, Helmut Seidl
2018	J	`jnl`	Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. Sebastian Maneth, Helmut Seidl
2018	A	`conf`	Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS Michael Luttenberger, Raphaela Palenta, Helmut Seidl
2018	J	`jnl`	Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler
2018	J	`jnl`	Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM Helmut Seidl, Sebastian Maneth, Gregor Kemper
2018	A	`conf`	Inductive Invariants for Noninterference in Multi-agent Workflows. CSF Christian Müller, Helmut Seidl, Eugen Zalinescu
2018	J	`jnl`	Paths, tree homomorphisms and disequalities for -clauses. Math. Struct. Comput. Sci. Andreas Reuß, Helmut Seidl
2018	C	`conf`	Three Improvements to the Top-Down Solver. PPDP Helmut Seidl, Ralf Vogler
2017	J	`jnl`	Computing the longest common prefix of a context-free language in polynomial time. CoRR Michael Luttenberger, Raphaela Palenta, Helmut Seidl
2017	J	`jnl`	Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports Emmanuel Filiot, Sebastian Maneth, Helmut Seidl
2017	J	`jnl`	Inter-procedural Two-Variable Herbrand Equalities. Log. Methods Comput. Sci. Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
2017	B	`conf`	Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. ATVA Helmut Seidl, Ralf Vogler
2017	B	`conf`	Reachability for Dynamic Parametric Processes. VMCAI Anca Muscholl, Helmut Seidl, Igor Walukiewicz
2017	A*	`conf`	Verifying Security Policies in Multi-agent Workflows with Loops. CCS Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu
2017	J	`jnl`	Verifying Security Policies in Multi-agent Workflows with Loops. CoRR Bernd Finkbeiner, Christian Müller, Helmut Seidl, Eugen Zalinescu
2016	J	`jnl`	Efficiently intertwining widening and narrowing. Sci. Comput. Program. Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani
2016	B	`conf`	Enforcing Termination of Interprocedural Analysis. SAS Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler
2016	J	`jnl`	Enforcing Termination of Interprocedural Analysis. CoRR Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler
2016	—	`conf`	Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi Kalmer Apinis, Helmut Seidl, Vesal Vojdani
2016	—	`ch.`	Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet
2016	J	`jnl`	Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2016	J	`jnl`	Reachability for dynamic parametric processes. CoRR Anca Muscholl, Helmut Seidl, Igor Walukiewicz
2016	B	`conf`	Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA Bernd Finkbeiner, Helmut Seidl, Christian Müller
2016	A*	`conf`	Static race detection for device drivers: the Goblint approach. ASE Vesal Vojdani, Kalmer Apinis, Vootele Rõtov, Helmut Seidl, Varmo Vene, Ralf Vogler
2015	A	`conf`	An Analysis of Universal Information Flow Based on Self-Composition. CSF Christian Müller, Máté Kovács, Helmut Seidl
2015	J	`jnl`	Efficiently intertwining widening and narrowing. CoRR Gianluca Amato, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani
2015	A*	`conf`	Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS Helmut Seidl, Sebastian Maneth, Gregor Kemper
2015	J	`jnl`	Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR Helmut Seidl, Sebastian Maneth, Gregor Kemper
2015	A	`conf`	Inter-procedural Two-Variable Herbrand Equalities. ESOP Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
2015	C	`conf`	Transforming XML Streams with References. SPIRE Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl
2014	—	`ch.`	Frameworks for Interprocedural Analysis of Concurrent Programs. Software Systems Safety Helmut Seidl, Kalmer Apinis, Vesal Vojdani
2014	C	`conf`	How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2014	J	`jnl`	Inter-procedural Two-Variable Herbrand Equalities. CoRR Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
2014	C	`conf`	Interprocedural Information Flow Analysis of XML Processors. LATA Helmut Seidl, Máté Kovács
2014	J	`jnl`	Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. Thomas Martin Gawlitza, Helmut Seidl
2014	—	`conf`	Parametric Strategy Iteration. SCSS Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz
2014	J	`jnl`	Parametric Strategy Iteration. CoRR Thomas Martin Gawlitza, Martin D. Schwarz, Helmut Seidl
2014	B	`conf`	Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Kalmer Apinis
2014	—	`book`	Software Systems Safety Software Systems Safety Orna Grumberg, Helmut Seidl, Maximilian Irlbeck
2014	B	`ed.`	Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings SAS Markus Müller-Olm, Helmut Seidl
2013	—	`book`	Compiler Design - Syntactic and Semantic Analysis. Reinhard Wilhelm, Helmut Seidl, Sebastian Hack
2013	B	`conf`	Contextual Locking for Dynamic Pushdown Networks. SAS Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner
2013	A*	`conf`	How to combine widening and narrowing for non-monotonic systems of equations. PLDI Kalmer Apinis, Helmut Seidl, Vesal Vojdani
2013	J	`jnl`	Look-Ahead Removal for Top-Down Tree Transducers. CoRR Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2013	A*	`conf`	Relational abstract interpretation for the verification of 2-hypersafety properties. CCS Máté Kovács, Helmut Seidl, Bernd Finkbeiner
2013	J	`jnl`	Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports Sebastian Maneth, Helmut Seidl
2012	J	`jnl`	Abstract interpretation meets convex optimization. J. Symb. Comput. Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault
2012	—	`book`	Compiler Design - Analysis and Transformation. Helmut Seidl, Reinhard Wilhelm, Sebastian Hack
2012	C	`conf`	Crossing the Syntactic Barrier: Hom-Disequalities for H CIAA Andreas Reuß, Helmut Seidl
2012	B	`conf`	Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS Helmut Seidl, Andreas Reuß
2012	B	`conf`	Model Checking Information Flow in Reactive Systems. VMCAI Rayna Dimitrova, Bernd Finkbeiner, Máté Kovács, Markus N. Rabe, Helmut Seidl
2012	J	`jnl`	Numerical Invariants through Convex Relaxation and Max-Strategy Iteration CoRR Thomas Martin Gawlitza, Helmut Seidl
2012	—	`ch.`	Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security Thomas Martin Gawlitza, Helmut Seidl
2012	A	`ed.`	Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings ESOP Helmut Seidl
2012	—	`conf`	Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS Máté Kovács, Helmut Seidl
2012	B	`conf`	Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS Kalmer Apinis, Helmut Seidl, Vesal Vojdani
2012	—	`ch.`	Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory Sebastian Maneth, Sylvia Friese, Helmut Seidl
2011	J	`jnl`	Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. Sylvia Friese, Helmut Seidl, Sebastian Maneth
2011	J	`jnl`	Extending H Inf. Process. Lett. Helmut Seidl, Andreas Reuß
2011	J	`jnl`	Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. Andrea Flexeder, Markus Müller-Olm, Michael Petter, Helmut Seidl
2011	B	`conf`	Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner
2011	B	`conf`	Side-Effect Analysis of Assembly Code. SAS Andrea Flexeder, Michael Petter, Helmut Seidl
2011	J	`jnl`	Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. Thomas Martin Gawlitza, Helmut Seidl
2011	A*	`conf`	Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich, Markus Müller-Olm
2010	—	`conf`	Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR Thomas Martin Gawlitza, Helmut Seidl
2010	—	`conf`	Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) Andreas Reuß, Helmut Seidl
2010	—	`book`	Compiler Design - Virtual Machines. Reinhard Wilhelm, Helmut Seidl
2010	B	`conf`	Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS Thomas Martin Gawlitza, Helmut Seidl
2010	B	`conf`	Interprocedural Control Flow Reconstruction. APLAS Andrea Flexeder, Bogdan Mihaila, Michael Petter, Helmut Seidl
2010	C	`conf`	Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory Sylvia Friese, Helmut Seidl, Sebastian Maneth
2010	—	`conf`	Normalization of Linear Horn Clauses. SBMF Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma
2010	J	`jnl`	Praktische Programmverifikation durch statische Analyse. Inform. Spektrum Helmut Seidl
2010	B	`conf`	Shape Analysis of Low-Level C with Overlapping Structures. VMCAI Jörg Kreiker, Helmut Seidl, Vesal Vojdani
2010	B	`conf`	Verifying a Local Generic Solver in Coq. SAS Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
2010	—	`conf`	What Is a Pure Functional? ICALP (2) Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
2009	B	`conf`	A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. FM Helmut Seidl, Vesal Vojdani, Varmo Vene
2009	J	`jnl`	Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2009	—	`conf`	Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA Helmut Seidl, Kumar Neeraj Verma
2009	A*	`conf`	Games through Nested Fixpoints. CAV Thomas Gawlitza, Helmut Seidl
2009	—	`conf`	Polynomial Precise Interval Analysis Revisited. Efficient Algorithms Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm
2009	C	`conf`	Program Analysis through Finite Tree Automata. CIAA Helmut Seidl
2009	B	`conf`	Region Analysis for Race Detection. SAS Helmut Seidl, Vesal Vojdani
2008	B	`conf`	Analysing All Polynomial Equations in . SAS Helmut Seidl, Andrea Flexeder, Michael Petter
2008	—	`conf`	Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl
2008	—	`conf`	Counting in trees. Logic and Automata Helmut Seidl, Thomas Schwentick, Anca Muscholl
2008	J	`jnl`	Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. Helmut Seidl, Kumar Neeraj Verma
2008	—	`conf`	Lightweight Verification 2008. GI Jahrestagung (2) Martin Leucker, Helmut Seidl
2008	B	`conf`	Precise Interval Analysis vs. Parity Games. FM Thomas Gawlitza, Helmut Seidl
2008	A	`conf`	Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP Markus Müller-Olm, Helmut Seidl
2007	J	`jnl`	Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. Markus Müller-Olm, Helmut Seidl
2007	B	`conf`	Computing Game Values for Crash Games. ATVA Thomas Gawlitza, Helmut Seidl
2007	—	`conf`	Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X Sebastian Maneth, Helmut Seidl
2007	A	`conf`	Exact XML Type Checking in Polynomial Time. ICDT Sebastian Maneth, Thomas Perst, Helmut Seidl
2007	B	`ed.`	Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings FoSSaCS Helmut Seidl
2007	A	`conf`	Interprocedurally Analysing Linear Inequality Relations. ESOP Helmut Seidl, Andrea Flexeder, Michael Petter
2007	A	`conf`	Precise Fixpoint Computation Through Strategy Iteration. ESOP Thomas Gawlitza, Helmut Seidl
2007	B	`conf`	Precise Relational Invariants Through Strategy Iteration. CSL Thomas Gawlitza, Helmut Seidl
2006	—	`conf`	Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation Helmut Seidl, Kumar Neeraj Verma
2006	J	`jnl`	Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht Sebastian Maneth, Thomas Perst, Helmut Seidl
2006	J	`jnl`	Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
2006	A	`conf`	Interprocedurally Analyzing Polynomial Identities. STACS Markus Müller-Olm, Michael Petter, Helmut Seidl
2005	B	`conf`	A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS Markus Müller-Olm, Helmut Seidl
2005	A	`conf`	Analysis of Modular Arithmetic. ESOP Markus Müller-Olm, Helmut Seidl
2005	B	`conf`	Checking Herbrand Equalities and Beyond. VMCAI Markus Müller-Olm, Oliver Rüthing, Helmut Seidl
2005	J	`jnl`	Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying CoRR Helmut Seidl, Kumar Neeraj Verma
2005	A	`conf`	Interprocedural Herbrand Equalities. ESOP Markus Müller-Olm, Helmut Seidl, Bernhard Steffen
2005	A	`conf`	On the Complexity of Equational Horn Clauses. CADE Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
2005	A*	`conf`	XML type checking with macro tree transducers. PODS Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl
2004	B	`conf`	A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR Markus Müller-Olm, Helmut Seidl
2004	A*	`conf`	A Note on Karr's Algorithm. ICALP Markus Müller-Olm, Helmut Seidl
2004	—	`conf`	Annotiertes Lecture Recording. DeLFI Peter Ziewer, Helmut Seidl
2004	J	`jnl`	Binary Queries for Document Trees. Nord. J. Comput. Alexandru Berlea, Helmut Seidl
2004	J	`jnl`	Computing polynomial program invariants. Inf. Process. Lett. Markus Müller-Olm, Helmut Seidl
2004	A*	`conf`	Counting in Trees for Free. ICALP Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
2004	B	`conf`	Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR Helmut Seidl, Kumar Neeraj Verma
2004	J	`jnl`	Macro forest transducers. Inf. Process. Lett. Thomas Perst, Helmut Seidl
2004	A*	`conf`	Precise interprocedural analysis through linear algebra. POPL Markus Müller-Olm, Helmut Seidl
2004	A	`conf`	The Succinct Solver Suite. TACAS Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl
2003	J	`jnl`	(Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends Markus Müller-Olm, Helmut Seidl
2003	A*	`conf`	Numerical document queries. PODS Helmut Seidl, Thomas Schwentick, Anca Muscholl
2002	J	`jnl`	A Succinct Solver for ALFP. Nord. J. Comput. Flemming Nielson, Helmut Seidl, Hanne Riis Nielson
2002	—	`conf`	A Type-safe Macro System for XML. Extreme Markup Languages® Thomas Perst, Helmut Seidl
2002	A	`conf`	Automatic Complexity Analysis. ESOP Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
2002	—	`conf`	Binary Queries. Extreme Markup Languages® Alexandru Berlea, Helmut Seidl
2002	A*	`conf`	Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
2002	J	`jnl`	Interprocedural Invariants Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl, Varmo Vene, Markus Müller-Olm
2002	B	`conf`	Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
2002	J	`jnl`	On the Expressiveness of Tree Set Operators Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl, Aditya V. Nori
2002	B	`conf`	Polynomial Constants Are Decidable. SAS Markus Müller-Olm, Helmut Seidl
2002	J	`jnl`	Polynomial Constants are Decidable Universität Trier, Mathematik/Informatik, Forschungsbericht Markus Müller-Olm, Helmut Seidl
2002	—	`conf`	Transparent teleteaching. ASCILITE Peter Ziewer, Helmut Seidl
2001	A	`conf`	Control-Flow Analysis in Cubic Time. ESOP Flemming Nielson, Helmut Seidl
2001	—	`conf`	Cryptographic Analysis in Cubic Time. TOSCA Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
2001	A*	`conf`	On optimal slicing of parallel programs. STOC Markus Müller-Olm, Helmut Seidl
2001	J	`jnl`	Succinct Solvers Universität Trier, Mathematik/Informatik, Forschungsbericht Flemming Nielson, Helmut Seidl
2001	B	`conf`	Synchronized Tree Languages Revisited and New Applications. FoSSaCS Valérie Gouranton, Pierre Réty, Helmut Seidl
2001	—	`conf`	Weakly Regular Relations and Applications. RTA Sébastien Limet, Pierre Réty, Helmut Seidl
2000	A	`conf`	Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP Helmut Seidl, Bernhard Steffen
2000	J	`jnl`	Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. Helmut Seidl, Bernhard Steffen
2000	J	`jnl`	Interprocedural Analyses: A Comparison. J. Log. Program. Helmut Seidl, Christian Fecht
1999	J	`jnl`	A Faster Solver for General Systems of Equations. Sci. Comput. Program. Christian Fecht, Helmut Seidl
1999	—	`conf`	ForkLight: A Control-Synchronous Parallel Programming Language. HPCN Europe Christoph W. Keßler, Helmut Seidl
1999	B	`conf`	On Guarding Nested Fixpoints. CSL Helmut Seidl, Andreas Neumann
1999	J	`jnl`	On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. Helmut Seidl, Damian Niwinski
1999	J	`jnl`	The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations Universität Trier, Mathematik/Informatik, Forschungsbericht Christoph W. Keßler, Helmut Seidl, Craig Smith
1998	J	`jnl`	Constraints to Stop Deforestation. Sci. Comput. Program. Helmut Seidl, Morten Heine Sørensen
1998	J	`jnl`	ForkLight: A Control-Synchronous Parallel Programming Language Universität Trier, Mathematik/Informatik, Forschungsbericht Christoph W. Keßler, Helmut Seidl
1998	J	`jnl`	Locating Matches of Tree Patterns in Forests Universität Trier, Mathematik/Informatik, Forschungsbericht Andreas Neumann, Helmut Seidl
1998	—	`conf`	Locating Matches of Tree Patterns in Forests. FSTTCS Andreas Neumann, Helmut Seidl
1998	A	`conf`	Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. ESOP Christian Fecht, Helmut Seidl
1998	J	`jnl`	Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nord. J. Comput. Christian Fecht, Helmut Seidl
1997	A*	`conf`	Constraints to Stop Higher-Order Deforestation. POPL Helmut Seidl, Morten Heine Sørensen
1997	—	`conf`	Disjuntive Completion Is Not "Optimal". ILPS Helmut Seidl, Christian Fecht
1997	J	`jnl`	Interprocedural Analysis Based on PDAs Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl, Christian Fecht
1997	—	`conf`	Language Support for Synchronous Parallel Critical Sections. APDC Christoph W. Keßler, Helmut Seidl
1997	J	`jnl`	Model-Checking for L Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl
1997	J	`jnl`	Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl, Christian Fecht
1997	J	`jnl`	The Fork95 parallel programming language: Design, implementation, application. Int. J. Parallel Program. Christoph W. Keßler, Helmut Seidl
1996	A*	`conf`	A Modal Mu-Calculus for Durational Transition Systems. LICS Helmut Seidl
1996	J	`jnl`	An Even Faster Solver for General Systems of Equations Universität Trier, Mathematik/Informatik, Forschungsbericht Christian Fecht, Helmut Seidl
1996	B	`conf`	An Even Faster Solver for General Systems of Equations. SAS Christian Fecht, Helmut Seidl
1996	J	`jnl`	Fast and Simple Nested Fixpoints Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl
1996	J	`jnl`	Fast and Simple Nested Fixpoints. Inf. Process. Lett. Helmut Seidl
1996	A	`conf`	Integer Constraints to Stop Deforestation. ESOP Helmut Seidl
1996	J	`jnl`	Least and Greatest Solutions of Equations over N. Nord. J. Comput. Helmut Seidl
1995	J	`jnl`	A Modal µ-Calculus for Durational Transition Systems Universität Trier, Mathematik/Informatik, Forschungsbericht Helmut Seidl
1995	J	`jnl`	Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language Universität Trier, Mathematik/Informatik, Forschungsbericht Christoph W. Keßler, Helmut Seidl
1995	J	`jnl`	Language Support for Synchronous Parallel Critical Sections Universität Trier, Mathematik/Informatik, Forschungsbericht Christoph W. Keßler, Helmut Seidl
1994	J	`jnl`	Equivalence of Finite-Valued Tree Transducers Is Decidable. Math. Syst. Theory Helmut Seidl
1994	J	`jnl`	Finite Tree Automata with Cost Functions. Theor. Comput. Sci. Helmut Seidl
1994	J	`jnl`	Haskell Overloading is DEXPTIME-Complete. Inf. Process. Lett. Helmut Seidl
1994	A*	`conf`	Least Solutions of Equations over N. ICALP Helmut Seidl
1994	J	`jnl`	Tree Automata for Code Selection. Acta Informatica Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm
1993	—	`conf`	When Is a Functional Tree Transduction Deterministic? TAPSOFT Helmut Seidl
1992	—	`ch.`	Ambiguity and valuedness. Tree Automata and Languages Helmut Seidl
1992	—	`ch.`	Baumautomaten zur Codeselektion. Informatik Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm
1992	J	`jnl`	FORK: A high-level language for PRAMs. Future Gener. Comput. Syst. Torben Hagerup, Arno Schmitt, Helmut Seidl
1992	—	`conf`	Finite Tree Automata with Cost Functions. CAAP Helmut Seidl
1992	J	`jnl`	Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. Theor. Comput. Sci. Helmut Seidl
1991	—	`conf`	FORK: A High-Level Language for PRAMs. PARLE (1) Torben Hagerup, Arno Schmitt, Helmut Seidl
1991	J	`jnl`	On finitely generated monoids of matrices with entries in N. RAIRO Theor. Informatics Appl. Andreas Weber, Helmut Seidl
1991	J	`jnl`	On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. Andreas Weber, Helmut Seidl
1991	—	`conf`	Tree Automata for Code Selection. Code Generation Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm
1990	—	`conf`	Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS Andreas Goerdt, Helmut Seidl
1990	J	`jnl`	Deciding Equivalence of Finite Tree Automata. SIAM J. Comput. Helmut Seidl
1990	—	`conf`	Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. CAAP Helmut Seidl
1989	A	`conf`	Deciding Equivalence of Finite Tree Automata. STACS Helmut Seidl
1989	B	`conf`	On the Finite Degree of Ambiguity of Finite Tree Automata. FCT Helmut Seidl
1989	J	`jnl`	On the Finite Degree of Ambiguity of Finite Tree Automata. Acta Informatica Helmut Seidl
1988	—	`conf`	Parameter-Reduction of Higher Level Grammars (Extended Abstract). CAAP Helmut Seidl
1987	J	`jnl`	Parameter Reduction of Higher Level Grammars. Theor. Comput. Sci. Helmut Seidl
1986	B	`conf`	On the Degree of Ambiguity of Finite Automata. MFCS Andreas Weber, Helmut Seidl
1985	B	`conf`	A quadratic regularity test for non-deleting macro S grammars. FCT Helmut Seidl