Helmut Seidl

According to our database1, Helmut Seidl
  • authored at least 178 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Verifying Security Policies in Multi-agent Workflows with Loops.
CoRR, 2017

Computing the longest common prefix of a context-free language in polynomial time.
CoRR, 2017

Reachability for Dynamic Parametric Processes.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Verifying Security Policies in Multi-agent Workflows with Loops.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
Equivalence - Combinatorics, Algebra, Proofs.
Proceedings of the Dependable Software Systems Engineering, 2016

Look-ahead removal for total deterministic top-down tree transducers.
Theor. Comput. Sci., 2016

Efficiently intertwining widening and narrowing.
Sci. Comput. Program., 2016

Reachability for dynamic parametric processes.
CoRR, 2016

Enforcing Termination of Interprocedural Analysis.
CoRR, 2016

Enforcing Termination of Interprocedural Analysis.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Static race detection for device drivers: the Goblint approach.
Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, 2016

Enhancing Top-Down Solving with Widening and Narrowing.
Proceedings of the Semantics, Logics, and Calculi, 2016

Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
CoRR, 2015

Efficiently intertwining widening and narrowing.
CoRR, 2015

Transforming XML Streams with References.
Proceedings of the String Processing and Information Retrieval, 2015

Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Inter-procedural Two-Variable Herbrand Equalities.
Proceedings of the Programming Languages and Systems, 2015

An Analysis of Universal Information Flow Based on Self-Composition.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014
Frameworks for Interprocedural Analysis of Concurrent Programs.
Proceedings of the Software Systems Safety, 2014

Numerical invariants through convex relaxation and max-strategy iteration.
Formal Methods in System Design, 2014

Parametric Strategy Iteration.
CoRR, 2014

Inter-procedural Two-Variable Herbrand Equalities.
CoRR, 2014

Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Parametric Strategy Iteration.
Proceedings of the 6th International Symposium on Symbolic Computation in Software Science, 2014

Interprocedural Information Flow Analysis of XML Processors.
Proceedings of the Language and Automata Theory and Applications, 2014

How to Remove the Look-Ahead of Top-Down Tree Transducers.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).
Dagstuhl Reports, 2013

Look-Ahead Removal for Top-Down Tree Transducers.
CoRR, 2013

Contextual Locking for Dynamic Pushdown Networks.
Proceedings of the Static Analysis - 20th International Symposium, 2013

How to combine widening and narrowing for non-monotonic systems of equations.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Relational abstract interpretation for the verification of 2-hypersafety properties.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Compiler Design - Syntactic and Semantic Analysis.
Springer, ISBN: 978-3-642-17539-8, 2013

2012
Precise Program Analysis through Strategy Iteration and Optimization.
Proceedings of the Software Safety and Security - Tools for Analysis and Verification, 2012

Abstract interpretation meets convex optimization.
J. Symb. Comput., 2012

Numerical Invariants through Convex Relaxation and Max-Strategy Iteration
CoRR, 2012

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses.
Proceedings of the Implementation and Application of Automata, 2012

Model Checking Information Flow in Reactive Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Extending ${\cal H}_1$ -Clauses with Path Disequalities.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Runtime Enforcement of Information Flow Security in Tree Manipulating Processes.
Proceedings of the Engineering Secure Software and Systems - 4th International Symposium, 2012

Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis.
Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

Type Checking of Tree Walking Transducers.
Modern Applications of Automata Theory, 2012

Compiler Design - Analysis and Transformation.
Springer, ISBN: 978-3-642-17547-3, 2012

2011
Solving systems of rational equations through strategy iteration.
ACM Trans. Program. Lang. Syst., 2011

Fast interprocedural linear two-variable equalities.
ACM Trans. Program. Lang. Syst., 2011

Extending H1-clauses with disequalities.
Inf. Process. Lett., 2011

Earliest Normal Form and Minimization for Bottom-up Tree Transducers.
Int. J. Found. Comput. Sci., 2011

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Side-Effect Analysis of Assembly Code.
Proceedings of the Static Analysis - 18th International Symposium, 2011

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

2010
Praktische Programmverifikation durch statische Analyse.
Informatik Spektrum, 2010

Shape Analysis of Low-Level C with Overlapping Structures.
Proceedings of the Verification, 2010

Normalization of Linear Horn Clauses.
Proceedings of the Formal Methods: Foundations and Applications, 2010

Verifying a Local Generic Solver in Coq.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Bottom-Up Tree Automata with Term Constraints.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

What Is a Pure Functional?
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Minimization of Deterministic Bottom-Up Tree Transducers.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Abstract Interpretation over Zones without Widening.
Proceedings of the Second International Workshop on Invariant Generation, 2010

Interprocedural Control Flow Reconstruction.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

Compiler Design - Virtual Machines.
Springer, ISBN: 978-3-642-14908-5, 2010

2009
Deciding equivalence of top-down XML transformations in polynomial time.
J. Comput. Syst. Sci., 2009

Program Analysis through Finite Tree Automata.
Proceedings of the Implementation and Application of Automata, 2009

Region Analysis for Race Detection.
Proceedings of the Static Analysis, 16th International Symposium, 2009

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.
Proceedings of the FM 2009: Formal Methods, 2009

Games through Nested Fixpoints.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Polynomial Precise Interval Analysis Revisited.
Proceedings of the Efficient Algorithms, 2009

2008
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.
ACM Trans. Comput. Log., 2008

Analysing All Polynomial Equations in .
Proceedings of the Static Analysis, 15th International Symposium, 2008

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Lightweight Verification 2008.
Proceedings of the INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 2, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8., 2008

Precise Interval Analysis vs. Parity Games.
Proceedings of the FM 2008: Formal Methods, 2008

Upper Adjoints for Fast Inter-procedural Variable Equalities.
Proceedings of the Programming Languages and Systems, 2008

Counting in trees.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Analysis of modular arithmetic.
ACM Trans. Program. Lang. Syst., 2007

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.
Proceedings of the PLAN-X 2007, 2007

Exact XML Type Checking in Polynomial Time.
Proceedings of the Database Theory, 2007

Interprocedurally Analysing Linear Inequality Relations.
Proceedings of the Programming Languages and Systems, 2007

Precise Fixpoint Computation Through Strategy Iteration.
Proceedings of the Programming Languages and Systems, 2007

Precise Relational Invariants Through Strategy Iteration.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Computing Game Values for Crash Games.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
Exact XML Type Checking in Polynomial Time.
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2006

Infinite-state high-level MSCs: Model-checking and realizability.
J. Comput. Syst. Sci., 2006

Interprocedurally Analyzing Polynomial Identities.
Proceedings of the STACS 2006, 2006

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.
Proceedings of the Program Analysis and Compilation, 2006

2005
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
CoRR, 2005

Checking Herbrand Equalities and Beyond.
Proceedings of the Verification, 2005

A Generic Framework for Interprocedural Analysis of Numerical Properties.
Proceedings of the Static Analysis, 12th International Symposium, 2005

XML type checking with macro tree transducers.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Interprocedural Herbrand Equalities.
Proceedings of the Programming Languages and Systems, 2005

Analysis of Modular Arithmetic.
Proceedings of the Programming Languages and Systems, 2005

On the Complexity of Equational Horn Clauses.
Proceedings of the Automated Deduction, 2005

2004
Binary Queries for Document Trees.
Nord. J. Comput., 2004

Macro forest transducers.
Inf. Process. Lett., 2004

Computing polynomial program invariants.
Inf. Process. Lett., 2004

The Succinct Solver Suite.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Precise interprocedural analysis through linear algebra.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
Proceedings of the Logic for Programming, 2004

A Generic Framework for Interprocedural Analyses of Numerical Properties.
Proceedings of the Logic for Programming, 2004

Counting in Trees for Free.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

A Note on Karr's Algorithm.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Annotiertes Lecture Recording.
Proceedings of the DeLFI 2004: Die e-Learning Fachtagung Informatik, 2004

2003
(Linear) Algebra for Program Analysis Dynamische Programmanalyse.
Softwaretechnik-Trends, 2003

Numerical document queries.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

2002
On the Expressiveness of Tree Set Operators
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

Interprocedural Invariants
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

Polynomial Constants are Decidable
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

A Succinct Solver for ALFP.
Nord. J. Comput., 2002

Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.
Proceedings of the Static Analysis, 9th International Symposium, 2002

Polynomial Constants Are Decidable.
Proceedings of the Static Analysis, 9th International Symposium, 2002

Infinite-State High-Level MSCs: Model-Checking and Realizability.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

A Type-safe Macro System for XML.
Proceedings of the Extreme Markup Languages® 2002 Conference, 2002

Binary Queries.
Proceedings of the Extreme Markup Languages® 2002 Conference, 2002

Automatic Complexity Analysis.
Proceedings of the Programming Languages and Systems, 2002

Transparent teleteaching.
Proceedings of the Winds of Changing in the Sea of Learning, 2002

2001
Succinct Solvers
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2001

Cryptographic Analysis in Cubic Time.
Electr. Notes Theor. Comput. Sci., 2001

On optimal slicing of parallel programs.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Weakly Regular Relations and Applications.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Synchronized Tree Languages Revisited and New Applications.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Control-Flow Analysis in Cubic Time.
Proceedings of the Programming Languages and Systems, 2001

2000
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Nord. J. Comput., 2000

Interprocedural Analyses: A Comparison.
J. Log. Program., 2000

Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Proceedings of the Programming Languages and Systems, 2000

1999
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

A Faster Solver for General Systems of Equations.
Sci. Comput. Program., 1999

On distributive fixed-point expressions.
ITA, 1999

ForkLight: A Control-Synchronous Parallel Programming Language.
Proceedings of the High-Performance Computing and Networking, 7th International Conference, 1999

On Guarding Nested Fixpoints.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
ForkLight: A Control-Synchronous Parallel Programming Language
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Locating Matches of Tree Patterns in Forests
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Constraints to Stop Deforestation.
Sci. Comput. Program., 1998

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Nord. J. Comput., 1998

Locating Matches of Tree Patterns in Forests.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Proceedings of the Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28, 1998

1997
Model-Checking for L2
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Interprocedural Analysis Based on PDAs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

The Fork95 parallel programming language: Design, implementation, application.
International Journal of Parallel Programming, 1997

Disjuntive Completion Is Not "Optimal".
Proceedings of the Logic Programming, 1997

Constraints to Stop Higher-Order Deforestation.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

Language Support for Synchronous Parallel Critical Sections.
Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997

1996
An Even Faster Solver for General Systems of Equations
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Fast and Simple Nested Fixpoints
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Least and Greatest Solutions of Equations over N.
Nord. J. Comput., 1996

Fast and Simple Nested Fixpoints.
Inf. Process. Lett., 1996

An Even Faster Solver for General Systems of Equations.
Proceedings of the Static Analysis, Third International Symposium, 1996

A Modal Mu-Calculus for Durational Transition Systems.
Proceedings of the Proceedings, 1996

Integer Constraints to Stop Deforestation.
Proceedings of the Programming Languages and Systems, 1996

1995
Language Support for Synchronous Parallel Critical Sections
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

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

Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

1994
Finite Tree Automata with Cost Functions.
Theor. Comput. Sci., 1994

Equivalence of Finite-Valued Tree Transducers Is Decidable.
Mathematical Systems Theory, 1994

Haskell Overloading is DEXPTIME-Complete.
Inf. Process. Lett., 1994

Tree Automata for Code Selection.
Acta Inf., 1994

Least Solutions of Equations over N.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
When Is a Functional Tree Transduction Deterministic?
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

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

FORK: A high-level language for PRAMs.
Future Generation Comp. Syst., 1992

Finite Tree Automata with Cost Functions.
Proceedings of the CAAP '92, 1992

Ambiguity and valuedness.
Tree Automata and Languages, 1992

1991
On the Degree of Ambiguity of Finite Automata.
Theor. Comput. Sci., 1991

On finitely generated monoids of matrices with entries in N.
ITA, 1991

FORK: A High-Level Language for PRAMs.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Tree Automata for Code Selection.
Code Generation, 1991

1990
Deciding Equivalence of Finite Tree Automata.
SIAM J. Comput., 1990

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.
Proceedings of the CAAP '90, 1990

1989
On the Finite Degree of Ambiguity of Finite Tree Automata.
Acta Inf., 1989

Deciding Equivalence of Finite Tree Automata.
Proceedings of the STACS 89, 1989

On the Finite Degree of Ambiguity of Finite Tree Automata.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Parameter-Reduction of Higher Level Grammars (Extended Abstract).
Proceedings of the CAAP '88, 1988

1987
Parameter Reduction of Higher Level Grammars.
Theor. Comput. Sci., 1987

1986
On the Degree of Ambiguity of Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
A quadratic regularity test for non-deleting macro S grammars.
Proceedings of the Fundamentals of Computation Theory, 1985


  Loading...