Prof. Dr. Helmut Seidl
Publications in Conferences since 1994:
- Shape Analysis of Low-Level C with Overlapping Structures.
Jörg Kreiker, Helmut Seidl, Vesal Vojdani.
Model Checking, and Abstract Interpretation, 11th Int. Conf., (VMCAI) LNCS 5944, Springer,
214-230, 2010
- Games through Nested Fixpoints.
Thomas Gawlitza, Helmut Seidl.
Computer Aided Verification, 21st Int. Conf. (CAV), LNCS 5643, Springer, 291-305, 2009
- Polynomial Precise Interval Analysis Revisited.
Thomas Gawlitza, Jerome Leroux, Jan Reineke, Helmut Seidl, Gregoire Sutre, Reinhard Wilhelm.
Efficient Algorithms. Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday.
LNCS 5760 Springer, 422-437, 2009
- A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.
Helmut Seidl, Vesal Vojdani, Varmo Vene.
Formal Methods (FM), Second World Congress. LNCS 5850, Springer, 644-659, 2009
- Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.
Helmut Seidl, Kumar Neeraj Verma.
Rewriting Techniques and Applications, 20th Int. Conf. (RTA). LNCS 5595, Springer,
118-132, 2009
- Region Analysis for Race Detection.
Helmut Seidl, Vesal Vojdani.
Static Analysis, 16th Int. Symp. (SAS), LNCS 5673, Springer, 171-187, 2009
- Upper Adjoints for Fast Inter-procedural Variable Equalities.
Markus Müller-Olm, Helmut Seidl.
Programming Languages and Systems, 17th European Symp. on Programming (ESOP),
LNCS 4960, Springer, 178-192, 2008
- Precise Interval Analysis vs. Parity Games.
Thomas Gawlitza, Helmut Seidl.
Formal Methods, 15th Int. Symp. on Formal Methods (FM), LNCS 5014, Springer,
342-357, 2008
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl.
Automata, Languages and Programming, 35th International Colloquium (ICALP),
Part I: Tack A: Algorithms, Automata, Complexity, and Games, LNCS 5125, Springer,
698-710, 2008
- Analysing All Polynomial Equations.
Helmut Seidl, Andrea Flexeder, Michael Petter.
Static Analysis, 15th Int. Symp. (SAS), LNCS 5079, Springer, 299-314, 2008
- Computing Game Values for Crash Games.
Thomas Gawlitza, Helmut Seidl.
5th Int. Symp. on Automated Technology for Verification and Analysis (ATVA), LNCS 4762, 177-191, 2007.
- Precise Relational Invariants Through Strategy Iteration.
Thomas Gawlitza, Helmut Seidl.
21th Computer Science Logic (CSL), LNCS 4646, 23-40, 2007.
- Interprocedurally Analysing Linear Inequality Relations
Helmut Seidl, Andrea Flexeder, Michael Petter.
European Symposium on Programming (ESOP), LNCS 4421, 284-289, 2007.
- Precise Fixpoint computation Through Strategy Iteration
Thomas Gawlitza, Helmut Seidl.
European Symposium on Programming (ESOP), LNCS 4421, 300-315, 2007.
- Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
Sebastian Maneth, Helmut Seidl.
Poceedings of PLAN-X 2007.
- Exact XML Type Checking in Polynomial Time
Sebastian Maneth, Thomas Perst, Helmut Seidl.
Int. Conf. on Database Theory (ICDT). LNCS 4353, 2007, pages 254-268.
- Polynomial Precise Interval Analysis Revisited
Thomas Gawlitza, Jan Reineke, Helmut Seidl, Reinhard Wilhelm.
Technical Report, TU München, 2006.
- Interprocedurally Analyzing Polynomial Identities
Markus Müller-Olm, Michael Petter, Helmut Seidl
23rd Ann. Symp. on Theoretical Aspects of Computer Science (STACS),
LNCS 3884, 2006, pages 50-67
- XML type checking with macro tree transducers
Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl.
24th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS),
2005, pages 283-294
- A Generic Framework for Interprocedural Analysis of Numerical Properties
Markus Müller-Olm, Helmut Seidl.
12th Static Analysis Symposium (SAS), LNCS 3672, 2005, pages 235-250
- On the Complexity of Equational Horn Clauses
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
20th Int. Conf. on Automated Deduction (CADE), LNCS 3632, 2005, pages 337-352
- Interprocedural Herbrand Equalities.
Markus Müller-Olm, Helmut Seidl, and Bernhard Steffen.
14th European Symposium on Programming (ESOP), LNCS 3444, 2005, pages 31-45.
Extensions of some parts can also be found at:
Interprocedural Analysis (Almost) for Free.
Technical Report 790, Fachbereich Informatik, Universität Dortmund, July 2004.
- Analysis of Modular Arithmetic.
Markus Müller-Olm and Helmut Seidl.
14th European Symposium on Programming (ESOP), LNCS 3444, 2005. Extensions of some parts can also be found in:
Interprocedural Analysis of Modular Arithmetic.
Technical Report 789, Fachbereich Informatik, Universität Dortmund, July 2004.
- Checking Herbrand Equalities and Beyond.
Markus Müller-Olm, Oliver Rüthing, and Helmut Seidl.
Verification Meets Model-Checking and Abstract Interpretation (VMCAI), LNCS 3385, 2005,
pages 79-96.
- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
Helmut Seidl and Kumar Neeraj Verma.
11th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), LNCS 3452, 79-94, Springer-Verlag, 2005.
- Annotiertes Lecture Recording,
Peter Ziewer and Helmut Seidl.
DELFI 2004: Die e-Learning Fachtagung Informatik. LNI 52 GI, 2004. pages 43-54.
- Counting in Trees for Free.
Helmut Seidl,
Thomas Schwentick, and
Anca Muscholl
31 Int. Coll. on Automata, Languages and Programming (ICALP),
LNCS 3142, 1136-1149, 2004
- A Note on Karr's Algorithm.
Markus Müller-Olm
and Helmut Seidl.
31 Int. Coll. on Automata, Languages and Programming (ICALP),
LNCS 3142, 1016-1028, 2004
- The Succinct Solver Suite
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl.
10th TACAS, LNCS 2988, 251-265, 2004
- Program Analysis through Linear Algebra.
Markus Müller-Olm
and Helmut Seidl.
ACM Symposium on Principles of Programming Languages (POPL), 330-341, 2004.
- Numerical Document Queries.
Helmut Seidl,
Thomas Schwentick, and
Anca Muscholl
ACM Conference on Principles of Database Systems (PODS), 155-166, 2003
- Transparent TeleTeaching.
Peter Ziewer and Helmut Seidl.
ASCILITE 2002
- Polynomial Constants are Decidable.
Markus Müller-Olm
and Helmut Seidl.
9th Static Analysis Symposium (SAS),
LNCS 2477, 4-19, 2002
- Normalizable Horn Clauses,
Strongly Recognizable Relations and Spi.
Flemming Nielson,
Hanne Riis Nielson
and Helmut Seidl.
9th Static Analysis Symposium (SAS),
LNCS 2477, 20-35, 2002
- A Type-safe Macro System for XML.
Thomas Perst and Helmut Seidl.
Extreme Markup Languages, 2002 Conference,
Montreal, August 2002.
- Binary Queries.
Alexandru Berlea and Helmut Seidl.
Extreme Markup Languages, 2002 Conference, Montreal, August 2002
- Infinite-State High-Level MSCs:
Model-Checking and Realizability.
Blaise Genest, Anca Muscholl,
Helmut Seidl, Marc Zeitoun.
29th Int. Coll. on Automata, Languages and Programming (ICALP),
LNCS 2380,
657-668, 2002
- Automatic Complexity Analysis.
Flemming Nielson,
Hanne Riis Nielson
and Helmut Seidl.
11th European Symposium on Programming (ESOP),
LNCS 2305, 243-261, 2002
- Succinct Solvers.
Flemming Nielson
and Helmut Seidl.
Technical Report 01-12, University of Trier, 2001
- FXT - a Transformation Tool for XML Documents.
Alexandru Berlea and Helmut Seidl.
2001 XML Conference and Exhibition, Orlando, Florida
- Weakly Regular Relations and Applications.
Helmut Seidl,
Pierre Rety, Sebastien Limet
Rewriting Theory and Applications (RTA), LNCS 2051, 185-200, 2001.
- On Optimal Slicing of Parallel Programs.
Markus Müller-Olm
and Helmut Seidl.
ACM Symposium on Theory of Computing (STOC), 647-656, 2001.
- Synchronized Tree Languages Revisited and New Applications.
Helmut Seidl,
Pierre Rety
and Valérie Gouranton
Foundations of Software Science and Computation
Structures (FoSSaCS),
LNCS 2030, 214-229, 2001
- Control-flow Analysis in Cubic Time.
Flemming Nielson
and Helumt Seidl.
10th European Symposium on Programming (ESOP),
LNCS 2028, 252-268, 2001.
- Constraint-Based Inter-Procedural Analysis of
Parallel Programs.
Helmut Seidl and
Bernhard
Steffen.
9th European Symposium on Programming (ESOP),
LNCS 1782, 351-365, 2000.
- On Guarding Nested Fixpoints.
Helmut Seidl and Andreas Neumann.
Annual Conference of the European Association of Logic in
Computer Science (CSL),
LNCS 1683,
484-498, 1999.
- ForkLight:
A Control-Synchronous Parallel Programming Language.
Christoph Keßler and Helmut Seidl
Technical Report No. 98-13, University of Trier.
HPCN'99,
LNCS 1593, 525-534, 1999.
- Locating Matches
of Tree Patterns in Forests.
Andreas Neumann and Helmut Seidl.
18th FSTTCS, LNCS 1530, 134-145, 1998.
Long version: Tech. Report 98-08.
- On Distributive Fixpoint Expressions.
Helmut Seidl and
Damian Niwinski).
Technical Report, Warsaw, 1998.
Short version in FICS'98.
-
Propagating Differences: An Efficient New Fixpoint Algorithm
for Distributive Constraint Systems.
Christian Fecht and Helmut Seidl.
European Symposium on Programming (ESOP), LNCS 1381, 90-104, 1998.
-
Disjunctive Completion Is Not ``Optimal''.
Helmut Seidl and Christian Fecht.
International Logic Programming Symposium (ILPS), 408, 1997.
- Interprocedural Analysis Based on PDAs.
Helmut Seidl and Christian Fecht.
Verification, Model Checking and Abstract Interpretation.
A Workshop in Association with ILPS'97
A long version also available as
Tutorial ETAPS'98.
- Constraints to Stop Higher-Order
Deforestation.
Helmut Seidl and Morten H. Sorensen.
Principles of Programming Languages (POPL), 400-413, 1997.
- An Even Faster Solver for General Systems of Equations.
Christian Fecht
and Helmut Seidl.
Static Analysis Symposium (SAS), LNCS 1145, 189-204, 1996.
- Integer Constraints to Stop Deforestation.
Helmut Seidl.
European Symposium on Programming (ESOP), LNCS 1058, 326-340, 1996.
- A Modal Mu Calculus for Durational Transition
Systems.
Helmut Seidl.
Logic in Computer Science (LICS), 128-137, 1996.
-
Language Support for Synchronous Parallel Critical Sections.
Christoph Keßler
and Helmut Seidl.
Tech. Report 95-23, Trier 1995 and
Advances in Parallel and Distributed Computing, 1997
-
Integrating Synchronous and Asynchronous Paradigms:
the Fork95 Parallel Programming Language.
Christoph Keßler and Helmut Seidl.
Tech. Report 95-05 and
Proc. of IEEE Working Conference MPPM'95, 134-141
- Least Solutions of Equations over N.
Helmut Seidl.
International Colloquium on Automata, Languages and Programming
(ICALP), LNCS 820, 400-411, 1994
Helmut Seidl - Conference Publications -
Jan. 26, 2010