2021
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)
mehr
On the Balancedness of Tree-to-Word Transducers. Int. J. Found. Comput. Sci. 32(6): 761-783 (2021)
2021
Definability Results for Top-Down Tree Transducers.
Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. DLT 2021: 291-303
mehr
Definability Results for Top-Down Tree Transducers. DLT 2021: 291-303
2021
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
mehr
Improving Thread-Modular Abstract Interpretation. SAS 2021: 359-383
2021
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
mehr
Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution). TACAS (2) 2021: 438-442
2021
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)
mehr
Definability Results for Top-Down Tree Transducers. CoRR abs/2105.14860 (2021)
2021
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)
mehr
Improving Thread-Modular Abstract Interpretation. CoRR abs/2108.07613 (2021)
2020
Incremental Abstract Interpretation.
Helmut Seidl, Julian Erhard, Ralf Vogler:
Incremental Abstract Interpretation. From Lambda Calculus to Cybersecurity Through Program Analysis 2020: 132-148
mehr
Incremental Abstract Interpretation. From Lambda Calculus to Cybersecurity Through Program Analysis 2020: 132-148
2020
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
mehr
Equivalence of Linear Tree Transducers with Output in the Free Group. DLT 2020: 207-221
2020
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
mehr
On the Balancedness of Tree-to-Word Transducers. DLT 2020: 222-236
2020
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
mehr
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP 2020: 134:1-134:18
2020
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
mehr
, Helmut Seidl:Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. SAS 2020: 156-177
2020
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
mehr
How to Win First-Order Safety Games. VMCAI 2020: 426-448
2020
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)
mehr
Equivalence of Linear Tree Transducers with Output in the Free Group. CoRR abs/2001.03480 (2020)
2019
Synthesizing Efficient Low-Precision Kernels.
Anastasiia Izycheva, Eva Darulova, Helmut Seidl:
Synthesizing Efficient Low-Precision Kernels. ATVA 2019: 294-313
mehr
Synthesizing Efficient Low-Precision Kernels. ATVA 2019: 294-313
2019
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
mehr
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS 2019: 488-504
2019
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)
mehr
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR abs/1902.03858 (2019)
2019
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)
mehr
How to Win First-Order Safety Games. CoRR abs/1908.05964 (2019)
2019
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)
mehr
On the Balancedness of Tree-to-word Transducers. CoRR abs/1911.13054 (2019)
2018
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)
mehr
, Helmut Seidl, Ralf Vogler:Enforcing termination of interprocedural analysis. Formal Methods Syst. Des. 53(2): 313-338 (2018)
2018
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)
mehr
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133: 26-32 (2018)
2018
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)
mehr
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65(4): 21:1-21:30 (2018)
2018
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)
mehr
Paths, tree homomorphisms and disequalities for -clauses. Math. Struct. Comput. Sci. 28(10): 1786-1846 (2018)
2018
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
mehr
, Helmut Seidl, Eugen Zalinescu:Inductive Invariants for Noninterference in Multi-agent Workflows. CSF 2018: 247-261
2018
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
mehr
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. STACS 2018: 48:1-48:13
2017
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)
mehr
Inter-procedural Two-Variable Herbrand Equalities. Log. Methods Comput. Sci. 13(2) (2017)
2017
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
mehr
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. ATVA 2017: 3-22
2017
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
mehr
, Helmut Seidl, Eugen Zalinescu:Verifying Security Policies in Multi-agent Workflows with Loops. CCS 2017: 633-645
2017
Reachability for Dynamic Parametric Processes.
Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441
mehr
Reachability for Dynamic Parametric Processes. VMCAI 2017: 424-441
2017
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)
mehr
Computing the longest common prefix of a context-free language in polynomial time. CoRR abs/1702.06698 (2017)
2017
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)
mehr
Verifying Security Policies in Multi-agent Workflows with Loops. CoRR abs/1708.09013 (2017)
2017
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)
mehr
, Sebastian Maneth, Helmut Seidl:Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 (2017)
2016
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)
mehr
, Francesca Scozzari, Helmut Seidl, Kalmer Apinis, Vesal Vojdani:Efficiently intertwining widening and narrowing. Sci. Comput. Program. 120: 1-24 (2016)
2016
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)
mehr
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616: 18-58 (2016)
2016
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
mehr
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. ATVA 2016: 157-173
2016
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
mehr
Enhancing Top-Down Solving with Widening and Narrowing. Semantics, Logics, and Calculi 2016: 272-288
2016
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
mehr
Static race detection for device drivers: the Goblint approach. ASE 2016: 391-402
2016
Enforcing Termination of Interprocedural Analysis.
Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing Termination of Interprocedural Analysis. SAS 2016: 447-468
mehr
Enforcing Termination of Interprocedural Analysis. SAS 2016: 447-468
2016
Equivalence - Combinatorics, Algebra, Proofs.
Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet:
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243
mehr
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243
2016
Enforcing Termination of Interprocedural Analysis.
Stefan Schulze Frielinghaus, Helmut Seidl, Ralf Vogler:
Enforcing Termination of Interprocedural Analysis. CoRR abs/1606.07687 (2016)
mehr
Enforcing Termination of Interprocedural Analysis. CoRR abs/1606.07687 (2016)
2016
Reachability for dynamic parametric processes.
Anca Muscholl, Helmut Seidl, Igor Walukiewicz:
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016)
mehr
Reachability for dynamic parametric processes. CoRR abs/1609.05385 (2016)
2015
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
mehr
, Máté Kovács, Helmut Seidl:An Analysis of Universal Information Flow Based on Self-Composition. CSF 2015: 380-393
2015
Inter-procedural Two-Variable Herbrand Equalities.
Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. ESOP 2015: 457-482
mehr
Inter-procedural Two-Variable Herbrand Equalities. ESOP 2015: 457-482
2015
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
mehr
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS 2015: 943-962
2015
Transforming XML Streams with References.
Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl:
Transforming XML Streams with References. SPIRE 2015: 33-45
mehr
Transforming XML Streams with References. SPIRE 2015: 33-45
2015
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)
mehr
Efficiently intertwining widening and narrowing. CoRR abs/1503.00883 (2015)
2015
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)
mehr
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR abs/1503.09163 (2015)
2014
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)
mehr
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. 44(2): 101-148 (2014)
2014
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
mehr
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory 2014: 103-115
2014
Interprocedural Information Flow Analysis of XML Processors.
Helmut Seidl, Máté Kovács:
Interprocedural Information Flow Analysis of XML Processors. LATA 2014: 34-61
mehr
Interprocedural Information Flow Analysis of XML Processors. LATA 2014: 34-61
2014
Parametric Strategy Iteration.
Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz:
Parametric Strategy Iteration. SCSS 2014: 62-76
mehr
Parametric Strategy Iteration. SCSS 2014: 62-76
2014
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
mehr
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. VMCAI 2014: 21-38
2014
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
mehr
Frameworks for Interprocedural Analysis of Concurrent Programs. Software Systems Safety 2014: 309-347
2014
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]
mehr
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]
2014
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]
mehr
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]
2014
Parametric Strategy Iteration.
Thomas Martin Gawlitza, Martin D. Schwarz, Helmut Seidl:
Parametric Strategy Iteration. CoRR abs/1406.5457 (2014)
mehr
Parametric Strategy Iteration. CoRR abs/1406.5457 (2014)
2014
Inter-procedural Two-Variable Herbrand Equalities.
Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl:
Inter-procedural Two-Variable Herbrand Equalities. CoRR abs/1410.4416 (2014)
mehr
Inter-procedural Two-Variable Herbrand Equalities. CoRR abs/1410.4416 (2014)
2013
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
mehr
Compiler Design - Syntactic and Semantic Analysis. Springer 2013, ISBN 978-3-642-17539-8, pp. I-X, 1-225
2013
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
mehr
Relational abstract interpretation for the verification of 2-hypersafety properties. CCS 2013: 211-222
2013
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
mehr
How to combine widening and narrowing for non-monotonic systems of equations. PLDI 2013: 377-386
2013
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
mehr
Contextual Locking for Dynamic Pushdown Networks. SAS 2013: 477-498
2013
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)
mehr
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 (2013)
2013
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)
mehr
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3(5): 1-18 (2013)
2012
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
mehr
Compiler Design - Analysis and Transformation. Springer 2012, ISBN 978-3-642-17547-3, pp. I-XII, 1-177
2012
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)
mehr
Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12): 1416-1446 (2012)
2012
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
mehr
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS 2012: 157-172
2012
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
mehr
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. ESSoS 2012: 46-59
2012
Extending ${\cal H}_1$ -Clauses with Path Disequalities.
Helmut Seidl, Andreas Reuß:
Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS 2012: 165-179
mehr
Extending ${\cal H}_1$ -Clauses with Path Disequalities. FoSSaCS 2012: 165-179
2012
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
mehr
Model Checking Information Flow in Reactive Systems. VMCAI 2012: 169-185
2012
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
mehr
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. CIAA 2012: 301-312
2012
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
mehr
Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory 2012: 325-372
2012
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
mehr
Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security 2012: 348-384
2012
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]
mehr
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]
2012
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)
mehr
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration. CoRR abs/1204.1147 (2012)
2011
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)
mehr
Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22(7): 1607-1623 (2011)
2011
Extending H1-clauses with disequalities.
Helmut Seidl, Andreas Reuß:
Extending H1-clauses with disequalities. Inf. Process. Lett. 111(20): 1007-1013 (2011)
mehr
Extending H1-clauses with disequalities. Inf. Process. Lett. 111(20): 1007-1013 (2011)
2011
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)
mehr
Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33(3): 11:1-11:48 (2011)
2011
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)
mehr
Fast interprocedural linear two-variable equalities. ACM Trans. Program. Lang. Syst. 33(6): 21:1-21:33 (2011)
2011
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
mehr
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL 2011: 93-104
2011
Side-Effect Analysis of Assembly Code.
Andrea Flexeder, Michael Petter, Helmut Seidl:
Side-Effect Analysis of Assembly Code. SAS 2011: 77-94
mehr
Side-Effect Analysis of Assembly Code. SAS 2011: 77-94
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:
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213
mehr
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213
2010
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
mehr
Compiler Design - Virtual Machines. Springer 2010, ISBN 978-3-642-14908-5, pp. I-XIII, 1-187
2010
Praktische Programmverifikation durch statische Analyse.
Helmut Seidl:
Praktische Programmverifikation durch statische Analyse. Inform. Spektrum 33(5): 484-488 (2010)
mehr
Praktische Programmverifikation durch statische Analyse. Inform. Spektrum 33(5): 484-488 (2010)
2010
Interprocedural Control Flow Reconstruction.
Andrea Flexeder, Bogdan Mihaila, Michael Petter, Helmut Seidl:
Interprocedural Control Flow Reconstruction. APLAS 2010: 188-203
mehr
Interprocedural Control Flow Reconstruction. APLAS 2010: 188-203
2010
Abstract Interpretation over Zones without Widening.
Thomas Martin Gawlitza, Helmut Seidl:
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR 2010: 12-43
mehr
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR 2010: 12-43
2010
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
mehr
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196
2010
What Is a Pure Functional?
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
What Is a Pure Functional? ICALP (2) 2010: 199-210
mehr
What Is a Pure Functional? ICALP (2) 2010: 199-210
2010
Bottom-Up Tree Automata with Term Constraints.
Andreas Reuß, Helmut Seidl:
Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) 2010: 581-593
mehr
Bottom-Up Tree Automata with Term Constraints. LPAR (Yogyakarta) 2010: 581-593
2010
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
mehr
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS 2010: 271-286
2010
Verifying a Local Generic Solver in Coq.
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
Verifying a Local Generic Solver in Coq. SAS 2010: 340-355
mehr
Verifying a Local Generic Solver in Coq. SAS 2010: 340-355
2010
Normalization of Linear Horn Clauses.
Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma:
Normalization of Linear Horn Clauses. SBMF 2010: 242-257
mehr
Normalization of Linear Horn Clauses. SBMF 2010: 242-257
2010
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
mehr
Shape Analysis of Low-Level C with Overlapping Structures. VMCAI 2010: 214-230
2009
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)
mehr
Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009)
2009
Polynomial Precise Interval Analysis Revisited.
Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm:
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437
mehr
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437
2009
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
mehr
:A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. FM 2009: 644-659
2009
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
mehr
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. RTA 2009: 118-132
2008
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)
mehr
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)
2008
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
mehr
Upper Adjoints for Fast Inter-procedural Variable Equalities. ESOP 2008: 178-192
2008
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
mehr
, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl:Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710
2008
Analysing All Polynomial Equations in .
Helmut Seidl, Andrea Flexeder, Michael Petter:
Analysing All Polynomial Equations in . SAS 2008: 299-314
mehr
Analysing All Polynomial Equations in . SAS 2008: 299-314
2007
Analysis of modular arithmetic.
Markus Müller-Olm, Helmut Seidl:
Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5): 29 (2007)
mehr
Analysis of modular arithmetic. ACM Trans. Program. Lang. Syst. 29(5): 29 (2007)
2007
Precise Relational Invariants Through Strategy Iteration.
Thomas Gawlitza, Helmut Seidl:
Precise Relational Invariants Through Strategy Iteration. CSL 2007: 23-40
mehr
Precise Relational Invariants Through Strategy Iteration. CSL 2007: 23-40
2007
Interprocedurally Analysing Linear Inequality Relations.
Helmut Seidl, Andrea Flexeder, Michael Petter:
Interprocedurally Analysing Linear Inequality Relations. ESOP 2007: 284-299
mehr
Interprocedurally Analysing Linear Inequality Relations. ESOP 2007: 284-299
2007
Precise Fixpoint Computation Through Strategy Iteration.
Thomas Gawlitza, Helmut Seidl:
Precise Fixpoint Computation Through Strategy Iteration. ESOP 2007: 300-315
mehr
Precise Fixpoint Computation Through Strategy Iteration. ESOP 2007: 300-315
2007
Exact XML Type Checking in Polynomial Time.
Sebastian Maneth, Thomas Perst, Helmut Seidl:
Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268
mehr
Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268
2007
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
mehr
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X 2007: 73-79
2007
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]
mehr
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]
2006
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)
mehr
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006)
2006
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
mehr
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Program Analysis and Compilation 2006: 97-119
2006
Interprocedurally Analyzing Polynomial Identities.
Markus Müller-Olm, Michael Petter, Helmut Seidl:
Interprocedurally Analyzing Polynomial Identities. STACS 2006: 50-67
mehr
Interprocedurally Analyzing Polynomial Identities. STACS 2006: 50-67
2006
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)
mehr
Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04 (2006)
2005
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
mehr
On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
2005
Interprocedural Herbrand Equalities.
Markus Müller-Olm, Helmut Seidl, Bernhard Steffen:
Interprocedural Herbrand Equalities. ESOP 2005: 31-45
mehr
Interprocedural Herbrand Equalities. ESOP 2005: 31-45
2005
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
mehr
XML type checking with macro tree transducers. PODS 2005: 283-294
2005
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
mehr
A Generic Framework for Interprocedural Analysis of Numerical Properties. SAS 2005: 235-250
2005
Checking Herbrand Equalities and Beyond.
Markus Müller-Olm, Oliver Rüthing, Helmut Seidl:
Checking Herbrand Equalities and Beyond. VMCAI 2005: 79-96
mehr
Checking Herbrand Equalities and Beyond. VMCAI 2005: 79-96
2005
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)
mehr
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. CoRR abs/cs/0511014 (2005)
2004
Computing polynomial program invariants.
Markus Müller-Olm, Helmut Seidl:
Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 (2004)
mehr
Computing polynomial program invariants. Inf. Process. Lett. 91(5): 233-244 (2004)
2004
Binary Queries for Document Trees.
Alexandru Berlea, Helmut Seidl:
Binary Queries for Document Trees. Nord. J. Comput. 11(1): 41-71 (2004)
mehr
Binary Queries for Document Trees. Nord. J. Comput. 11(1): 41-71 (2004)
2004
Counting in Trees for Free.
Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl:
Counting in Trees for Free. ICALP 2004: 1136-1149
mehr
Counting in Trees for Free. ICALP 2004: 1136-1149
2004
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
mehr
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR 2004: 79-94
2004
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
mehr
A Generic Framework for Interprocedural Analyses of Numerical Properties. LPAR 2004: 432-432
2004
Precise interprocedural analysis through linear algebra.
Markus Müller-Olm, Helmut Seidl:
Precise interprocedural analysis through linear algebra. POPL 2004: 330-341
mehr
Precise interprocedural analysis through linear algebra. POPL 2004: 330-341
2004
The Succinct Solver Suite.
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl:
The Succinct Solver Suite. TACAS 2004: 251-265
mehr
, Henrik Pilegaard, Helmut Seidl:The Succinct Solver Suite. TACAS 2004: 251-265
2003
(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)
mehr
(Linear) Algebra for Program Analysis Dynamische Programmanalyse. Softwaretechnik-Trends 23(2) (2003)
2002
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)
mehr
A Succinct Solver for ALFP. Nord. J. Comput. 9(4): 335-372 (2002)
2002
Automatic Complexity Analysis.
Flemming Nielson, Hanne Riis Nielson, Helmut Seidl:
Automatic Complexity Analysis. ESOP 2002: 243-261
mehr
Automatic Complexity Analysis. ESOP 2002: 243-261
2002
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
mehr
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002: 657-668
2002
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
mehr
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS 2002: 20-35
2002
Polynomial Constants are Decidable.
Markus Müller-Olm, Helmut Seidl:
Polynomial Constants are Decidable. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09 (2002)
mehr
Polynomial Constants are Decidable. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-09 (2002)
2002
Interprocedural Invariants.
Helmut Seidl, Varmo Vene, Markus Müller-Olm:
Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 (2002)
mehr
Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 (2002)
2002
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)
mehr
On the Expressiveness of Tree Set Operators. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-17 (2002)
2001
Cryptographic Analysis in Cubic Time.
Flemming Nielson, Hanne Riis Nielson, Helmut Seidl:
Cryptographic Analysis in Cubic Time. Electron. Notes Theor. Comput. Sci. 62: 7-23 (2001)
mehr
, Hanne Riis Nielson, Helmut Seidl:Cryptographic Analysis in Cubic Time. Electron. Notes Theor. Comput. Sci. 62: 7-23 (2001)
2001
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
mehr
Synchronized Tree Languages Revisited and New Applications. FoSSaCS 2001: 214-229
2001
Weakly Regular Relations and Applications.
Sébastien Limet, Pierre Réty, Helmut Seidl:
Weakly Regular Relations and Applications. RTA 2001: 185-200
mehr
Weakly Regular Relations and Applications. RTA 2001: 185-200
2001
Succinct Solvers.
Flemming Nielson, Helmut Seidl:
Succinct Solvers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12 (2001)
mehr
Succinct Solvers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12 (2001)
2000
Interprocedural Analyses: A Comparison.
Helmut Seidl, Christian Fecht:
Interprocedural Analyses: A Comparison. J. Log. Program. 43(2): 123-156 (2000)
mehr
Interprocedural Analyses: A Comparison. J. Log. Program. 43(2): 123-156 (2000)
2000
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)
mehr
Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. 7(4): 375- (2000)
2000
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Helmut Seidl, Bernhard Steffen:
Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP 2000: 351-365
mehr
Constraint-Based Inter-Procedural Analysis of Parallel Programs. ESOP 2000: 351-365
1999
On distributive fixed-point expressions.
Helmut Seidl, Damian Niwinski:
On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. 33(4/5): 427-446 (1999)
mehr
On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. 33(4/5): 427-446 (1999)
1999
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)
mehr
A Faster Solver for General Systems of Equations. Sci. Comput. Program. 35(2): 137-161 (1999)
1999
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
mehr
ForkLight: A Control-Synchronous Parallel Programming Language. HPCN Europe 1999: 525-534
1999
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)
mehr
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-10 (1999)
1998
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)
mehr
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nord. J. Comput. 5(4): 304-329 (1998)
1998
Constraints to Stop Deforestation.
Helmut Seidl, Morten Heine Sørensen:
Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 (1998)
mehr
Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 (1998)
1998
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
mehr
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. ESOP 1998: 90-104
1998
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)
mehr
Locating Matches of Tree Patterns in Forests. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-08 (1998)
1998
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)
mehr
ForkLight: A Control-Synchronous Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-13 (1998)
1997
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)
mehr
The Fork95 parallel programming language: Design, implementation, application. Int. J. Parallel Program. 25(1): 17-50 (1997)
1997
Language Support for Synchronous Parallel Critical Sections.
Christoph W. Keßler, Helmut Seidl:
Language Support for Synchronous Parallel Critical Sections. APDC 1997: 92-99
mehr
Language Support for Synchronous Parallel Critical Sections. APDC 1997: 92-99
1997
Constraints to Stop Higher-Order Deforestation.
Helmut Seidl, Morten Heine Sørensen:
Constraints to Stop Higher-Order Deforestation. POPL 1997: 400-413
mehr
Constraints to Stop Higher-Order Deforestation. POPL 1997: 400-413
1997
Interprocedural Analysis Based on PDAs.
Helmut Seidl, Christian Fecht:
Interprocedural Analysis Based on PDAs. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-06 (1997)
mehr
Interprocedural Analysis Based on PDAs. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-06 (1997)
1997
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)
mehr
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-13 (1997)
1997
Model-Checking for L2.
Helmut Seidl:
Model-Checking for L2. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-18 (1997)
mehr
Model-Checking for L2. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-18 (1997)
1996
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
mehr
An Even Faster Solver for General Systems of Equations. SAS 1996: 189-204
1996
Fast and Simple Nested Fixpoints.
Helmut Seidl:
Fast and Simple Nested Fixpoints. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-05 (1996)
mehr
Fast and Simple Nested Fixpoints. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-05 (1996)
1996
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)
mehr
An Even Faster Solver for General Systems of Equations. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-11 (1996)
1995
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)
mehr
Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-05 (1995)
1995
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)
mehr
A Modal µ-Calculus for Durational Transition Systems. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-08 (1995)
1995
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)
mehr
Language Support for Synchronous Parallel Critical Sections. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-23 (1995)
1994
Tree Automata for Code Selection.
Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm:
Tree Automata for Code Selection. Acta Informatica 31(8): 741-760 (1994)
mehr
Tree Automata for Code Selection. Acta Informatica 31(8): 741-760 (1994)
1994
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)
mehr
Equivalence of Finite-Valued Tree Transducers Is Decidable. Math. Syst. Theory 27(4): 285-346 (1994)
1992
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)
mehr
FORK: A high-level language for PRAMs. Future Gener. Comput. Syst. 8(4): 379-393 (1992)
1992
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)
mehr
Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. Theor. Comput. Sci. 106(1): 135-181 (1992)
1992
Baumautomaten zur Codeselektion.
Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm:
Baumautomaten zur Codeselektion. Informatik 1992: 121-144
mehr
Baumautomaten zur Codeselektion. Informatik 1992: 121-144
1991
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)
mehr
On finitely generated monoids of matrices with entries in N. RAIRO Theor. Informatics Appl. 25: 19-38 (1991)
1991
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)
mehr
On the Degree of Ambiguity of Finite Automata. Theor. Comput. Sci. 88(2): 325-349 (1991)
1991
Tree Automata for Code Selection.
Christian Ferdinand, Helmut Seidl, Reinhard Wilhelm:
Tree Automata for Code Selection. Code Generation 1991: 30-50
mehr
Tree Automata for Code Selection. Code Generation 1991: 30-50
1991
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
mehr
FORK: A High-Level Language for PRAMs. PARLE (1) 1991: 304-320
1990
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
mehr
Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. CAAP 1990: 269-284
1990
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
mehr
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. IMYCS 1990: 148-158
1989
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)
mehr
On the Finite Degree of Ambiguity of Finite Tree Automata. Acta Informatica 26(6): 527-542 (1989)