24 citations · 25 across the 4 of their papers we have counts for
10 papers
Improving Thread-Modular Abstract Interpretation
Michael Schwarz, Simmo Saan, Helmut Seidl +3
We give thread-modular non-relational value analyses as abstractions of a local trace semantics. The semantics as well as the analyses are formulated by means of global invariants…
Definability Results for Top-Down Tree Transducers
Sebastian Maneth, Helmut Seidl, Martin Vu
We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or…
Equivalence of Linear Tree Transducers with Output in the Free Group
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
We show that equivalence of deterministic linear tree transducers can be decided in polynomial time when their outputs are interpreted over the free group. Due to the cancellation…
On the Balancedness of Tree-to-word Transducers
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
A language over an alphabet of opening () and closing () brackets, is balanced if it is a subset of the Dyck language over , and…
How to Win First-Order Safety Games
Helmut Seidl, Christian Müller, Bernd Finkbeiner
First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent…
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time
Helmut Seidl, Raphaela Palenta, Sebastian Maneth
In 1982, Courcelle and Franchi-Zannettacci showed that the equivalence problem of separated non-nested attribute systems can be reduced to the equivalence problem of total determin…