Lehrstuhl Informatik II   
Sprachen und Beschreibungsstrukturen      
   Home Personen Professoren Prof. Dr. Helmut Seidl login

Prof. Dr. Helmut Seidl

Name:Prof. Dr. Helmut Seidl
Raum:02.07.054
Tel:+49 89 289 18155
eMail:seidl<at>in.tum.de
Visitenkarte:

  • Sprechzeiten
  •   Donnerstag: 14.00 bis 16.00 Uhr

 

  • Research interests
    • Automatic Program Analysis
    • Design and Implementation of Programming Languages
    • Semi-structured Data
    • Tree Automata
  • Publications

Publications of Helmut Seidl

Books

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

    Reference: Bibtex Electronic Copy: DOI

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

    Reference: Bibtex Electronic Copy: DOI

  3. Reinhard Wilhelm and Helmut Seidl. Übersetzerbau 2: Syntaktische und semantische Analyse. Springer, 2012.

    Detail: Abstract Reference: Bibtex

  4. Reinhard Wilhelm and Helmut Seidl. Compiler Design - Virtual Machines. Springer, 2010.

    Reference: Bibtex Electronic Copy: DOI

  5. Reinhard Wilhelm and Helmut Seidl. Übersetzerbau 3: Analyse und Transformation. Springer, 2010.

    Detail: Abstract Reference: Bibtex

  6. Reinhard Wilhelm and Helmut Seidl. Übersetzerbau: Virtuelle Maschinen. Springer, 2007.

    Detail: Abstract Reference: Bibtex


Journal Articles

The following articles appeared in peer-reviewed journals. The copyright of these articles lies with the respective journals.

  1. Andreas Reuß and Helmut Seidl. Paths, Tree Homomorphisms, and Disequalities for H1-Clauses. Mathematical Structures in Computer Science, :1--61, 2017.

    Detail: Abstract Reference: Bibtex Electronic Copy: DOI

  2. Stefan Schulze Frielinghaus, Michael Petter and Helmut Seidl. Inter-procedural Two-Variable Herbrand Equalities. Logical Methods in Computer Science, 13(2), 2017.

    Reference: Bibtex Electronic Copy: DOI

  3. Stefan Schulze Frielinghaus, Helmut Seidl and Ralf Vogler. Enforcing Termination of Interprocedural Analysis. Formal Methods in System Design, , 2017.

    Reference: Bibtex Electronic Copy: DOI

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

    Reference: Bibtex Electronic Copy: DOI

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

    Reference: Bibtex Electronic Copy: DOI

  6. Thomas Martin Gawlitza and Helmut Seidl. Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods in System Design, 44(2):101--148, 2014.

    Reference: Bibtex Electronic Copy: DOI

  7. Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert and Eric Goubault. Abstract interpretation meets convex optimization. J. Symb. Comput., 47(12):1416--1446, 2012.

    Reference: Bibtex Electronic Copy: DOI

  8. Helmut Seidl and Andreas Reuß. Extending H1-Clauses with Disequalities. Information Processing Letters, 111(20):1007-1013, 2011.

    Detail: Abstract Reference: Bibtex

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

    Reference: Bibtex Electronic Copy: DOI

  10. Sylvia Friese, Helmut Seidl and Sebastian Maneth. Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci., 22(7):1607--1623, 2011.

    Reference: Bibtex Electronic Copy: DOI

  11. Andrea Flexeder, Markus Müller-Olm, Michael Petter and Helmut Seidl. Fast Interprocedural Linear Two-Variable Equalities. ACM Trans. Program. Lang. Syst., 33(6), 2011.

    Detail: Abstract Download: PDF Reference: Bibtex Electronic Copy: DOI

  12. Joost Engelfriet, Sebastian Maneth and Helmut Seidl. Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci., 75(5):271--286, 2009.

    Detail: Abstract Download: PDF Reference: Bibtex Electronic Copy: DOI

  13. Helmut Seidl and Kumar Neeraj Verma. Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log., 9(4), 2008.

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

  15. Blaise Genest, Anca Muscholl, Helmut Seidl and Marc Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci., 72(4):617-647, 2006.

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

  17. Markus Müller-Olm and Helmut Seidl. Computing Polynomial Program Invariants. Inf. Process. Lett., 91(5):233-244, 2004.

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

  20. Flemming Nielson, Hanne Riis Nielson and Helmut Seidl. Cryptographic Analysis in Cubic Time. Electr. Notes Theor. Comput. Sci., 62, 2001.

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

  25. Helmut Seidl. Least and Greatest Solutions of Equations over $\cal N$. Nord. J. Comput., 3(1):41-62, 1996.

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

  29. Helmut Seidl. Equivalence of Finite-Valued Tree Transducers Is Decidable. Mathematical Systems Theory, 27(4):285-346, 1994.

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

  32. Andreas Weber and Helmut Seidl. On finitely generated monoids of matrices with entries in $\mathcal {N}$. ITA, 25:19-38, 1991.

    Detail: Abstract Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex

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

    Detail: Abstract Download: PDF Reference: Bibtex


Conference Papers

The following papers were published in peer-reviewed conferences. The copyright of these papers lies with the respective publishers.

  1. Helmut Seidl, Sebastian Maneth, Gregor Kemper and Joost Engelfriet. Equivalence - Combinatorics, Algebra, Proofs. In Javier Esparza, Orna Grumberg and Salomon Sickert, editors, Dependable Software Systems Engineering, volume 45 of NATO Science for Peace and Security Series - D: Information and Communication Security, pages 202--243, 2016. IOS Press.

    Reference: Bibtex Electronic Copy: DOI

  2. Stefan Schulze Frielinghaus, Helmut Seidl and Ralf Vogler. Enforcing Termination of Interprocedural Analysis. In Xavier Rival, editor, Proceedings of the 23rd International Symposium on Static Analysis, SAS, volume 9837 of Lecture Notes in Computer Science, pages 447--468, 2016. Springer.

    Reference: Bibtex The original publication is available at www.springerlink.com

  3. Kalmer Apinis, Helmut Seidl and Vesal Vojdani. Enhancing Top-Down Solving with Widening and Narrowing. In Christian W. Probst, Chris Hankin and René Rydhof Hansen, editors, Semantics, Logics, and Calculi - Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays, pages 272--288, 2016. Springer, LNCS 9560.

    Reference: Bibtex Electronic Copy: DOI

  4. Helmut Seidl, Sebastian Maneth and Gregor Kemper. Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 943--962, 2015. IEEE Computer Society.

    Reference: Bibtex Electronic Copy: DOI

  5. Christian Müller, Máté Kovács and Helmut Seidl. An Analysis of Universal Information Flow Based on Self-Composition. In Cedric Fournet, Michael W. Hicks and Luca Vigano, editors, IEEE 28th Computer Security Foundations Symposium, CSF 2015, Verona, Italy, 13-17 July, 2015, pages 380--393, 2015. IEEE Computer Society.

    Reference: Bibtex Electronic Copy: DOI

  6. Sebastian Maneth, Alberto Ordonez Pereira and Helmut Seidl. Transforming XML Streams with References. In Costas S. Iliopoulos, Simon J. Puglisi and Emine Yilmaz, editors, String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, pages 33--45, 2015. Springer, LNCS 9309.

    Reference: Bibtex Electronic Copy: DOI

  7. Stefan Schulze Frielinghaus, Michael Petter and Helmut Seidl. Inter-procedural Two-Variable Herbrand Equalities. In Jan Vitek, editor, Proceedings of the 24th European Symposium on Programming, ESOP, volume 9032 of Lecture Notes in Computer Science, pages 457--482, 2015. Springer.

    Reference: Bibtex The original publication is available at www.springerlink.com

  8. Helmut Seidl and Mate Kovacs. Interprocedural Information Flow Analysis of XML Processors. In Adrian Horia Dediu, Carlos Martin-Vide, Jose Luis Sierra-Rodriguez and Bianca Truthe, editors, Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings, pages 34--61, 2014. Springer, LNCS 8370.

    Reference: Bibtex Electronic Copy: DOI

  9. Helmut Seidl, Thomas Martin Gawlitza and Martin S. Schwarz. Parametric Strategy Iteration. In Temur Kutsia and Andrei Voronkov, editors, 6th International Symposium on Symbolic Computation in Software Science, SCSS 2014, Gammarth, La Marsa, Tunisia, December 7-8, 2014, volume 30 of EPiC Series in Computing, pages 62--76, 2014. EasyChair.

    Reference: Bibtex

  10. Helmut Seidl, Kalmer Apinis and Vesal Vojdani. Frameworks for Interprocedural Analysis of Concurrent Programs. In Orna Grumberg, Helmut Seidl and Maximilian Irlbeck, editors, Software Systems Safety, volume 36 of NATO Science for Peace and Security Series, D: Information and Communication Security, pages 309--347, 2014. IOS Press.

    Reference: Bibtex Electronic Copy: DOI

  11. Martin D. Schwarz, Helmut Seidl, Vesal Vojdani and Kalmer Apinis. Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. In Kenneth L. McMillan and Xavier Rival, editors, Verification, Model Checking, and Abstract Interpretation - 15th International Conference, VMCAI 2014, San Diego, CA, USA, January 19-21, 2014, Proceedings, pages 21--38, 2014. Springer, LNCS 8318.

    Reference: Bibtex Electronic Copy: DOI

  12. Martin D. Schwarz, Helmut Seidl, Vesal Vojdani and Kalmer Apinis. Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. Verification, Model Checking, and Abstract Interpretation, volume 8318 of Lecture Notes in Computer Science, pages 21-38, 2014. Springer Berlin Heidelberg.

    Detail: Abstract Download: PDF Reference: Bibtex Electronic Copy: DOI

  13. Joost Engelfriet, Sebastian Maneth and Helmut Seidl. How to Remove the Look-Ahead of Top-Down Tree Transducers. In Arseny M. Shur and Mikhail V. Volkov, editors, Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings, pages 103--115, 2014. Springer, LNCS 8633.

    Reference: Bibtex Electronic Copy: DOI

  14. Kalmer Apinis, Helmut Seidl and Vesal Vojdani. How to combine widening and narrowing for non-monotonic systems of equations. Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation, pages 377--386, 2013.

    Detail: Abstract Download: PDF Reference: Bibtex

  15. Peter Lammich, Markus Müller-Olm, Helmut Seidl and Alexander Wenner. Contextual Locking for Dynamic Pushdown Networks. In Francesco Logozzo and Manuel Fähndrich, editors, Static Analysis - 20th International Symposium, SAS 2013, Seattle, WA, USA, June 20-22, 2013. Proceedings, pages 477--498, 2013. Springer, LNCS 7935.

    Reference: Bibtex Electronic Copy: DOI

  16. Mate Kovacs, Helmut Seidl and Bernd Finkbeiner. Relational abstract interpretation for the verification of 2-hypersafety properties. In Ahmad-Reza Sadeghi, Virgil D. Gligor and Moti Yung, editors, 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4-8, 2013, pages 211--222, 2013. ACM.

    Reference: Bibtex Electronic Copy: DOI

  17. Helmut Seidl and Andreas Reuß. Extending H1-Clauses with Path Disequalities. In Lars Birkedal, editor, FoSSaCS, pages 165-179, 2012. Springer, LNCS 7213.

    Detail: Abstract Reference: Bibtex

  18. Andreas Reuß and Helmut Seidl. Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses. In Nelma Moreira and Rogério Reis, editors, CIAA, pages 301-312, 2012. Springer, LNCS 7381.

    Detail: Abstract Reference: Bibtex

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

    Reference: Bibtex Electronic Copy: DOI

  20. Máté Kovács and Helmut Seidl. Runtime Enforcement of Information Flow Security in Tree Manipulating Processes. In Gilles Barthe, Benjamin Livshits and Riccardo Scandariato, editors, Engineering Secure Software and Systems - 4th International Symposium, ESSoS 2012, Eindhoven, The Netherlands, February, 16-17, 2012. Proceedings, pages 46--59, 2012. Springer, LNCS 7159.

    Reference: Bibtex Electronic Copy: DOI

  21. Thomas Martin Gawlitza and Helmut Seidl. Precise Program Analysis through Strategy Iteration and Optimization. In Tobias Nipkow, Orna Grumberg and Benedikt Hauptmann, editors, Software Safety and Security - Tools for Analysis and Verification, volume 33 of NATO Science for Peace and Security Series - D: Information and Communication Security, pages 348--384, 2012. IOS Press.

    Reference: Bibtex Electronic Copy: DOI

  22. Rayna Dimitrova, Bernd Finkbeiner, Mate Kovacs, Markus N. Rabe and Helmut Seidl. Model Checking Information Flow in Reactive Systems. In Viktor Kuncak and Andrey Rybalchenko, editors, Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings, pages 169--185, 2012. Springer, LNCS 7148.

    Reference: Bibtex Electronic Copy: DOI

  23. K. Apinis, H. Seidl and V. Vojdani. Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis. APLAS, pages 157-172, 2012. LNCS 7705, Springer.

    Detail: Abstract Download: PDF Reference: Bibtex

  24. Martin D Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich and Markus Müller-Olm. Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol. POPL'11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 93–104, Austin, Texas, USA, 2011. ACM.

    Detail: Abstract Download: PDF Reference: Bibtex Electronic Copy: DOI

  25. Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl and Alexander Wenner. Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. In Ranjit Jhala and David A. Schmidt, editors, Verification, Model Checking, and Abstract Interpretation - 12th International Conference, VMCAI 2011, Austin, TX, USA, January 23-25, 2011. Proceedings, pages 199--213, 2011. Springer, LNCS 6538.

    Reference: Bibtex Electronic Copy: DOI

  26. Andrea Flexeder, Michael Petter and Helmut Seidl. Side-Effect Analysis of Assembly Code. 18th International Symposium on Static Analysis, pages 77-94, Venice, Italy, 2011.

    Detail: Abstract Download: PDF Reference: Bibtex Electronic Copy: DOI

  27. Andrea Flexeder, Bogdan Mihaila, Michael Petter and Helmut Seidl. Interprocedural Control Flow Reconstruction. In Kazunori Ueda, editor, Asian Symposium on Program Languages and Systems, volume 6461 of Lecture Notes in Computer Science, pages 188-203, Shanghai, China, November 2010. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  28. Martin Hofmann, Aleksandr Karbyshev and Helmut Seidl. Verifying a Local Generic Solver in Coq. In Radhia Cousot and Matthieu Martel, editors, Static Analysis, volume 6337 of Lecture Notes in Computer Science, pages 340-355, September 2010. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  29. Martin Hofmann, Aleksandr Karbyshev and Helmut Seidl. What Is a Pure Functional?. In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide and Paul G. Spirakis, editors, ICALP (2), volume 6199 of Lecture Notes in Computer Science, pages 199-210, July 2010. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  30. Jörg Kreiker, Helmut Seidl and Vesal Vojdani. Shape Analysis of Low-Level C with Overlapping Structures. In Gilles Barthe and Manuel V. Hermenegildo, editors, Verification, Model Checking, and Abstract Interpretation, volume 5944 of Lecture Notes in Computer Science, pages 214-230, Madrid, Spain, January 2010. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  31. Andreas Reuß and Helmut Seidl. Bottom-up Tree Automata with Term Constraints. In Christian G. Fermüller and Andrei Voronkov, editors, LPAR-17, volume 6397 of LNCS, pages 581-593, 2010. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com

  32. Thomas Martin Gawlitza and Helmut Seidl. Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. In Radhia Cousot and Matthieu Martel, editors, Static Analysis - 17th International Symposium, SAS 2010, Perpignan, France, September 14-16, 2010. Proceedings, pages 271--286, 2010. Springer, LNCS 6337.

    Reference: Bibtex Electronic Copy: DOI

  33. Sylvia Friese, Helmut Seidl and Sebastian Maneth. Minimization of Deterministic Bottom-Up Tree Transducers. In Yuan Gao, Hanlin Lu, Shinnosuke Seki and Sheng Yu, editors, Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings, pages 185--196, 2010. Springer, LNCS 6224.

    Reference: Bibtex Electronic Copy: DOI

  34. Helmut Seidl, Vesal Vojdani and Varmo Vene. A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. In Ana Cavalcanti and Dennis Dams, editors, Formal Methods, volume 5850 of Lecture Notes in Computer Science, Eindhoven, The Netherlands, November 2009. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  35. Helmut Seidl and Vesal Vojdani. Region Analysis for Race Detection. In Jens Palsberg and Zhendong Su, editors, Static Analysis, volume 5673 of Lecture Notes in Computer Science, pages 171-187, Los Angeles, CA, USA, August 2009. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  36. Helmut Seidl. Program Analysis through Finite Tree Automata. In Sebastian Maneth, editor, Implementation and Application of Automata, volume 5642 of Lecture Notes in Computer Science, pages 3, Sydney, Australia, July 2009. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  37. Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. In Ralf Treinen, editor, Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 118-132, Brasília, Brazil, June 2009. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  38. Thomas Gawlitza and Helmut Seidl. Games through Nested Fixpoints. In Ahmed Bouajjani and Oded Maler, editors, Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, volume 5643 of Lecture Notes in Computer Science, pages 291-305, Grenoble, France, June 2009. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  39. Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre and Reinhard Wilhelm. Polynomial Precise Interval Analysis Revisited. In Susanne Albers, Helmut Alt and Stefan Näher, editors, Efficient Algorithms, pages 422-437, 2009. Springer, LNCS 5760.

    Detail: Abstract Download: PDF Reference: Bibtex

  40. Martin Leucker and Helmut Seidl. Lightweight Verification 2008. In Heinz-Gerd Hegering, Axel Lehmann, Hans Jürgen Ohlbach and Christian Scheideler, editors, Beherrschbare Systeme - dank Informatik,Band 2, volume 134 of LNI, pages 965-966, Munich, Germany, September 2008. GI.

    Reference: Bibtex

  41. Helmut Seidl, Andrea Flexeder and Michael Petter. Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$. In María Alpuente and Germán Vidal, editors, Static Analysis, volume 5079 of Lecture Notes in Computer Science, pages 299-314, Valencia, Spain, July 2008. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  42. Javier Esparza, Thomas Gawlitza, Stefan Kiefer and Helmut Seidl. Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir and Igor Walukiewicz, editors, Automata, Languages and Programming(1)Tack A: Algorithms, Automata, Complexity,and Games, volume 5125 of Lecture Notes in Computer Science, pages 698-710, Reykjavik, Iceland, July 2008. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  43. Thomas Gawlitza and Helmut Seidl. Precise Interval Analysis vs. Parity Games. In Jorge Cuéllar, T. S. E. Maibaum and Kaisa Sere, editors, FM, volume 5014 of Lecture Notes in Computer Science, pages 342-357, Turku, Finland, May 2008. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  44. Markus Müller-Olm and Helmut Seidl. Upper Adjoints for Fast Inter-procedural Variable Equalities. In Sophia Drossopoulou, editor, Programming Languages and Systems, volume 4960 of Lecture Notes in Computer Science, pages 178-192, Budapest, Hungary, April 2008. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  45. Helmut Seidl, Thomas Schwentick and Anca Muscholl. Counting in trees. In Jörg Flum, Erich Grädel and Thomas Wilke, editors, Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., pages 575--612, 2008. Springer, Texts in Logic and Games 2.

    Reference: Bibtex

  46. Thomas Gawlitza and Helmut Seidl. Computing Game Values for Crash Games. In Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino and Yoshio Okamura, editors, Automated Technology for Verification and Analysis, volume 4762 of Lecture Notes in Computer Science, pages 177-191, Tokyo, Japan, October 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  47. Thomas Gawlitza and Helmut Seidl. Precise Relational Invariants Through Strategy Iteration. In Jacques Duparc and Thomas A. Henzinger, editors, Computer Science Logic, volume 4646 of Lecture Notes in Computer Science, pages 23-40, Lausanne, Switzerland, September 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  48. Helmut Seidl, Andrea Flexeder and Michael Petter. Interprocedurally Analysing Linear Inequality Relations. In Rocco De Nicola, editor, Programming Languages and Systems, volume 4421 of Lecture Notes in Computer Science, pages 284-299, Braga, Portugal, April 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  49. Thomas Gawlitza and Helmut Seidl. Precise Fixpoint Computation Through Strategy Iteration. In Rocco De Nicola, editor, Programming Languages and Systems, volume 4421 of Lecture Notes in Computer Science, pages 300-315, Braga, Portugal, April 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  50. 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. FoSSaCS, volume 4423 of Lecture Notes in Computer Science, Braga, Portugal, March 2007. Springer.

    Reference: Bibtex The original publication is available at www.springerlink.com

  51. Sebastian Maneth, Thomas Perst and Helmut Seidl. Exact XML Type Checking in Polynomial Time. In Thomas Schwentick and Dan Suciu, editors, ICDT, volume 4353 of Lecture Notes in Computer Science, pages 254-268, Barcelona, Spain, January 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  52. Sebastian Maneth and Helmut Seidl. Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. Programming Language Technologies for XML, pages 73-79, Nice, France, January 2007.

    Detail: Abstract Download: PDF Reference: Bibtex

  53. Helmut Seidl and Kumar Neeraj Verma. Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. In Thomas W. Reps, Mooly Sagiv and Jörg Bauer, editors, Program Analysis and Compilation, Theory and Practice, volume 4444 of Lecture Notes in Computer Science, pages 97-119, 2007. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  54. Markus Müller-Olm, Michael Petter and Helmut Seidl. Interprocedurally Analyzing Polynomial Identities. In Bruno Durand and Wolfgang Thomas, editors, 23rd Annual Symposium on Theoretical Aspects of Computer Science, volume 3884 of Lecture Notes in Computer Science, pages 50-67, Marseille, France, February 2006. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  55. Andrea Flexeder, Michael Petter and Helmut Seidl. Interprocedurally Analysing Linear Inequalities. 18th Nordic Workshop on Programming Theory, Reykjavik, Iceland, 2006.

    Detail: Abstract Download: PDF Reference: Bibtex

  56. Markus Müller-Olm and Helmut Seidl. A Generic Framework for Interprocedural Analysis of Numerical Properties. In Chris Hankin and Igor Siveroni, editors, Static Analysis, volume 3672 of Lecture Notes in Computer Science, pages 235-250, London, UK, September 2005. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  57. Kumar Neeraj Verma, Helmut Seidl and Thomas Schwentick. On the Complexity of Equational Horn Clauses. In Robert Nieuwenhuis, editor, Automated Deduction - CADE-20, volume 3632 of Lecture Notes in Computer Science, pages 337-352, Tallinn, Estonia, July 2005. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  58. Sebastian Maneth, Alexandru Berlea, Thomas Perst and Helmut Seidl. XML type checking with macro tree transducers. In Chen Li, editor, Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART, pages 283-294, Baltimore, Maryland, June 2005. ACM.

    Detail: Abstract Download: PDF Reference: Bibtex

  59. Markus Müller-Olm, Helmut Seidl and Bernhard Steffen. Interprocedural Herbrand Equalities. In Shmuel Sagiv, editor, Programming Languages and Systems, volume 3444 of Lecture Notes in Computer Science, pages 31-45, Edinburgh, UK, April 2005. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  60. Markus Müller-Olm and Helmut Seidl. Analysis of Modular Arithmetic. In Shmuel Sagiv, editor, Programming Languages and Systems, volume 3444 of Lecture Notes in Computer Science, pages 46-60, Edinburgh, UK, April 2005. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  61. Markus Müller-Olm, Oliver Rüthing and Helmut Seidl. Checking Herbrand Equalities and Beyond. In Radhia Cousot, editor, Verification, Model Checking, and Abstract Interpretation, volume 3385 of Lecture Notes in Computer Science, pages 79-96, Paris, France, January 2005. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  62. Peter Ziewer and Helmut Seidl. Annotiertes Lecture Recording. In Gregor Engels and Silke Seehusen, editors, Die e-Learning Fachtagung Informatik, volume 52 of LNI, pages 43-54, Paderborn, Germany, September 2004. GI.

    Detail: Abstract Download: PDF Reference: Bibtex

  63. Helmut Seidl, Thomas Schwentick, Anca Muscholl and Peter Habermehl. Counting in Trees for Free. In Josep Díaz, Juhani Karhumäki, Arto Lepistö and Donald Sannella, editors, Automata, Languages and Programming, volume 3142 of Lecture Notes in Computer Science, pages 1136-1149, Turku, Finland, July 2004. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  64. Markus Müller-Olm and Helmut Seidl. A Note on Karr's Algorithm. In Josep Díaz, Juhani Karhumäki, Arto Lepistö and Donald Sannella, editors, Automata, Languages and Programming, volume 3142 of Lecture Notes in Computer Science, pages 1016-1028, Turku, Finland, July 2004. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  65. Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard and Helmut Seidl. The Succinct Solver Suite. In Kurt Jensen and Andreas Podelski, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of Lecture Notes in Computer Science, pages 251-265, Barcelona, Spain, April 2004. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  66. Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. In Franz Baader and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lecture Notes in Computer Science, pages 79-94, Montevideo, Uruguay, March 2004. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  67. Markus Müller-Olm and Helmut Seidl. A Generic Framework for Interprocedural Analyses of Numerical Properties. In Franz Baader and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, volume 3452 of Lecture Notes in Computer Science, pages 432-432, Montevideo, Uruguay, March 2004. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  68. Markus Müller-Olm and Helmut Seidl. Precise interprocedural analysis through linear algebra. In Neil D. Jones and Xavier Leroy, editors, Principles of Programming Languages, pages 330-341, Venice,Italy, January 2004. ACM.

    Detail: Abstract Download: PDF Reference: Bibtex

  69. Helmut Seidl, Thomas Schwentick and Anca Muscholl. Numerical document queries. Principles of Database Systems, pages 155-166, San Diego, CA, USA, June 2003. ACM.

    Detail: Abstract Download: PDF Reference: Bibtex

  70. Peter Ziewer and Helmut Seidl. Transparent teleteaching. In Andy Williamson, Cathy Gunn, Alison Young and Tony Clear, editors, Winds of Changing in the Sea of Learning, pages 749-758, Auckland, New Zealand, December 2002. UNITEC Institute of Technology, Auckland, New Zealand.

    Detail: Abstract Download: PDF Reference: Bibtex

  71. Flemming Nielson, Hanne Riis Nielson and Helmut Seidl. Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. In Manuel V. Hermenegildo and Germán Puebla, editors, Static Analysis, volume 2477 of Lecture Notes in Computer Science, pages 20-35, Madrid, Spain, September 2002. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  72. Markus Müller-Olm and Helmut Seidl. Polynomial Constants Are Decidable. In Manuel V. Hermenegildo and Germán Puebla, editors, Static Analysis, volume 2477 of Lecture Notes in Computer Science, pages 4-19, Madrid, Spain, September 2002. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  73. Thomas Perst and Helmut Seidl. A Type-safe Macro System for XML. Extreme Markup Languages, Montréal, Quebec, Canada, August 2002.

    Detail: Abstract Download: PDF Reference: Bibtex

  74. Alexandru Berlea and Helmut Seidl. Binary Queries. Extreme Markup Languages, Montréal, Quebec, Canada, August 2002.

    Detail: Abstract Download: PDF Reference: Bibtex

  75. Blaise Genest, Anca Muscholl, Helmut Seidl and Marc Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. In Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz and Ricardo Conejo, editors, Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 657-668, Malaga, Spain, July 2002. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  76. Flemming Nielson, Hanne Riis Nielson and Helmut Seidl. Automatic Complexity Analysis. In Daniel Le Métayer, editor, Programming Languages and Systems, volume 2305 of Lecture Notes in Computer Science, pages 243-261, Grenoble, France, April 2002. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  77. Sébastien Limet, Pierre Réty and Helmut Seidl. Weakly Regular Relations and Applications. In Aart Middeldorp, editor, Rewriting Techniques and Applications, volume 2051 of Lecture Notes in Computer Science, pages 185-200, Utrecht, The Netherlands, May 2001. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  78. Flemming Nielson and Helmut Seidl. Control-Flow Analysis in Cubic Time. In David Sands, editor, Programming Languages and Systems, volume 2028 of Lecture Notes in Computer Science, pages 252-268, Genova, Italy, April 2001. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  79. Valérie Gouranton, Pierre Réty and Helmut Seidl. Synchronized Tree Languages Revisited and New Applications. In Furio Honsell and Marino Miculan, editors, Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 214-229, Genova, Italy, April 2001. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  80. Markus Müller-Olm and Helmut Seidl. On optimal slicing of parallel programs. STOC, pages 647-656, Hersonissos, Greece, 2001.

    Detail: Abstract Download: PDF Reference: Bibtex

  81. Helmut Seidl and Bernhard Steffen. Constraint-Based Inter-Procedural Analysis of Parallel Programs. In Gert Smolka, editor, Programming Languages and Systems, volume 1782 of Lecture Notes in Computer Science, pages 351-365, Berlin, Germany, March 2000. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  82. Helmut Seidl and Andreas Neumann. On Guarding Nested Fixpoints. In Jörg Flum and Mario Rodríguez-Artalejo, editors, Computer Science Logic, volume 1683 of Lecture Notes in Computer Science, pages 484-498, Madrid, Spain, September 1999. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  83. Christoph W. Kessler and Helmut Seidl. ForkLight: A Control-Synchronous Parallel Programming Language. High-Performance Computing and Networking, pages 525-534, Amsterdam, The Netherlands, April 1999.

    Detail: Abstract Download: PDF Reference: Bibtex

  84. Andreas Neumann and Helmut Seidl. Locating Matches of Tree Patterns in Forests. In Vikraman Arvind and Ramaswamy Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1530 of Lecture Notes in Computer Science, pages 134-145, Chennai, India, December 1998. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  85. Christian Fecht and Helmut Seidl. Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. In Chris Hankin, editor, Programming Languages and Systems, volume 1381 of Lecture Notes in Computer Science, pages 90-104, Lisbon, Portugal, April 1998. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  86. Christoph W. Kessler and Helmut Seidl. Language Support for Synchronous Parallel Critical Sections. Advances in Parallel and Distributed Computing Conference, pages 92-99, Shanghai, China, March 1997. IEEE Computer Society.

    Detail: Abstract Download: PDF Reference: Bibtex

  87. Helmut Seidl and Christian Fecht. Disjunctive Completion Is Not "Optimal". ILPS, pages 408, 1997.

    Download: PDF Reference: Bibtex

  88. Helmut Seidl and Morten Heine Sørensen. Constraints to Stop Higher-Order Deforestation. Principles of programming languages, pages 400-413, 1997.

    Detail: Abstract Download: PDF Reference: Bibtex

  89. Christian Fecht and Helmut Seidl. An Even Faster Solver for General Systems of Equations. In Radhia Cousot and David A. Schmidt, editors, Static Analysis, volume 1145 of Lecture Notes in Computer Science, pages 189-204, Aachen, Germany, September 1996. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  90. Helmut Seidl. Integer Constraints to Stop Deforestation. In Hanne Riis Nielson, editor, Programming Languages and Systems, volume 1058 of Lecture Notes in Computer Science, pages 326-340, Linköping, Sweden, April 1996. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  91. Helmut Seidl. A Modal $\mu$-Calculus for Durational Transition Systems. LICS, pages 128-137, 1996.

    Detail: Abstract Download: PDF Reference: Bibtex

  92. Helmut Seidl. Least Solutions of Equations over $\nu$. In Serge Abiteboul and Eli Shamir, editors, Automata, Languages and Programming, volume 820 of Lecture Notes in Computer Science, pages 400-411, Jerusalem, Israel, July 1994. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  93. Helmut Seidl. When Is a Functional Tree Transduction Deterministic?. In Marie-Claude Gaudel and Jean-Pierre Jouannaud, editors, Theory and Practice of Software Development, volume 668 of Lecture Notes in Computer Science, pages 251-265, Orsay, France, April 1993. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com

  94. Helmut Seidl. Finite Tree Automata with Cost Functions. In Jean-Claude Raoult, editor, Trees in Algebra and Programming, volume 581 of Lecture Notes in Computer Science, pages 279-299, Rennes, France, February 1992. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  95. Helmut Seidl. Ambiguity and valuedness. Tree Automata and Languages, pages 355-380, 1992.

    Reference: Bibtex

  96. Torben Hagerup, Arno Schmitt and Helmut Seidl. FORK: A High-Level Language for PRAMs. In Emile H. L. Aarts, Jan van Leeuwen and Martin Rem, editors, Parallel Architectures and Languages Europe, Volume 1, volume 505 of Lecture Notes in Computer Science, pages 304-320, Eindhoven, The Netherlands, June 1991. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com

  97. Christian Ferdinand, Helmut Seidl and Reinhard Wilhelm. Tree Automata for Code Selection. Code Generation, pages 30-50, 1991.

    Detail: Abstract Reference: Bibtex

  98. Andreas Goerdt and Helmut Seidl. Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. In Jürgen Dassow and Jozef Kelemen, editors, Aspects and Prospects of Theoretical Computer Scienc, volume 464 of Lecture Notes in Computer Science, pages 148-158, Smolenice, Czechoslovakia, November 1990. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com

  99. Helmut Seidl. Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. In André Arnold, editor, CAAP, volume 431 of Lecture Notes in Computer Science, pages 269-284, Copenhagen, Denmark, May 1990. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com

  100. Helmut Seidl. On the Finite Degree of Ambiguity of Finite Tree Automata. In János Csirik, János Demetrovics and Ferenc Gécseg, editors, Fundamentals of Computation Theory, volume 380 of Lecture Notes in Computer Science, pages 395-404, Szeged, Hungary, August 1989. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  101. Helmut Seidl. Deciding Equivalence of Finite Tree Automata. In Burkhard Monien and Robert Cori, editors, Theoretical Aspects of Computer Science, volume 349 of Lecture Notes in Computer Science, pages 480-492, Paderborn, Germany, February 1989. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com

  102. Helmut Seidl. Parameter-Reduction of Higher Level Grammars (Extended Abstract). In Max Dauchet and Maurice Nivat, editors, Trees in Algebra and Programming, volume 299 of Lecture Notes in Computer Science, pages 52-71, Nancy, France, March 1988. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  103. Andreas Weber and Helmut Seidl. On the Degree of Ambiguity of Finite Automata. In Jozef Gruska, Branislav Rovan and Juraj Wiedermann, editors, Mathematical Foundations of Computer Science, volume 233 of Lecture Notes in Computer Science, pages 620-629, Bratislava, Czechoslovakia, August 1986. Springer.

    Detail: Abstract Download: PDF Reference: Bibtex The original publication is available at www.springerlink.com

  104. Helmut Seidl. A quadratic regularity test for non-deleting macro S grammars. In Lothar Budach, editor, Fundamentals of Computation Theory, volume 199 of Lecture Notes in Computer Science, pages 422-430, Cottbus, Germany, September 1985. Springer.

    Detail: Abstract Reference: Bibtex The original publication is available at www.springerlink.com


Workshop Papers and Technical Reports

  1. Martin Hofmann, Aleksandr Karbyshev and Helmut Seidl. On the Verification of Local Generic Solvers. , 2013. Technische Universität München.

    Download: PDF Reference: Bibtex Electronic Copy: DOI

  2. Andrea Flexeder, Michael Petter and Helmut Seidl. Improvements on the cache behaviour prediction by modular arithmetic. , 2009.

    Detail: Abstract Download: PDF Reference: Bibtex

  3. Andrea Flexeder, Michael Petter and Helmut Seidl. Analysis of executables for WCET concerns. , 2008.

    Detail: Abstract Download: PDF Reference: Bibtex

  4. Sebastian Maneth, Thomas Perst and Helmut Seidl. Exact XML Type Checking in Polynomial Time. , volume 06-04 of Forschungsbericht, 2006. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Download: PDF Reference: Bibtex

  5. Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. , volume abs/cs/0511014 of Forschungsbericht, 2005. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Download: PDF Reference: Bibtex

  6. Michael Petter and Helmut Seidl. Inferring Polynomial Invariants with Polyinvar. , 2005.

    Download: PDF Reference: Bibtex

  7. Michael Petter and Helmut Seidl. Inferring Polynomial Invariants. Workshop on Numerical and Symbolic Abstract Domains, Paris, France, 2005.

    Detail: Abstract Download: PDF Reference: Bibtex

  8. Helmut Seidl, Varmo Vene and Markus Müller-Olm. Interprocedural Invariants. , volume 02-10 of Forschungsbericht, 2002. Universität Trier, Mathematik/Informatik.

    Reference: Bibtex

  9. Helmut Seidl and Aditya V. Nori. On the Expressiveness of Tree Set Operators. , volume 02-17 of Forschungsbericht, 2002. Universität Trier, Mathematik/Informatik.

    Reference: Bibtex

  10. Markus Müller-Olm and Helmut Seidl. Polynomial Constants are Decidable. , volume 02-09 of Forschungsbericht, 2002. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  11. Flemming Nielson and Helmut Seidl. Succinct Solvers. , volume 01-12 of Forschungsbericht, 2001. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Download: PDF Reference: Bibtex

  12. Christoph W. Kessler, Helmut Seidl and Craig Smith. The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations. , volume 99-10 of Forschungsbericht, 1999. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  13. Andreas Neumann and Helmut Seidl. Locating Matches of Tree Patterns in Forests. , volume 98-08 of Forschungsbericht, 1998. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  14. Christoph W. Kessler and Helmut Seidl. ForkLight: A Control-Synchronous Parallel Programming Language. , volume 98-13 of Forschungsbericht, 1998. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

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

    Detail: Abstract Reference: Bibtex

  16. Helmut Seidl. Model-Checking for L_2. , volume 97-18 of Forschungsbericht, 1997. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  17. Helmut Seidl and Christian Fecht. Interprocedural Analysis Based on PDAs. , volume 97-06 of Forschungsbericht, 1997. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  18. Helmut Seidl. Fast and Simple Nested Fixpoints. , volume 59 of Forschungsbericht, pages 303-308, 1996. Inf. Process. Lett..

    Detail: Abstract Reference: Bibtex

  19. Christian Fecht and Helmut Seidl. An Even Faster Solver for General Systems of Equations. , volume 96-11 of Forschungsbericht, 1996. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  20. Helmut Seidl. A Modal µ-Calculus for Durational Transition Systems. , volume 95-08 of Forschungsbericht, 1995. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  21. Christoph W. Kessler and Helmut Seidl. Language Support for Synchronous Parallel Critical Sections. , volume 95-23 of Forschungsbericht, 1995. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Reference: Bibtex

  22. Christoph W. Kessler and Helmut Seidl. Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language. , volume 95-05 of Forschungsbericht, 1995. Universität Trier, Mathematik/Informatik.

    Detail: Abstract Download: PDF Reference: Bibtex



TUM - Lehrstuhl Informatik II (Sprachen und Beschreibungsstrukturen) Thanks: Tango and TinyMCE     Generationszeit: 30 ms