Michael Luttenberger

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Runtime Monitoring DNN-Based Perception.

[BibT_eX]

[DOI]

Chih-Hong Cheng

Rongjie Yan

CoRR, 2023

Runtime Monitoring DNN-Based Perception - (via the Lens of Formal Methods).

[BibT_eX]

[DOI]

Chih-Hong Cheng

Rongjie Yan

Proceedings of the Runtime Verification - 23rd International Conference, 2023

2021

On the Balancedness of Tree-to-Word Transducers.

[BibT_eX]

[DOI]

Raphaela Löbel

Helmut Seidl

Int. J. Found. Comput. Sci., 2021

2020

Practical synthesis of reactive systems from LTL specifications via parity games.

[BibT_eX]

[DOI]

Philipp J. Meyer

Salomon Sickert

Acta Informatica, 2020

Equivalence of Linear Tree Transducers with Output in the Free Group.

[BibT_eX]

[DOI]

Raphaela Löbel

Helmut Seidl

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.

[BibT_eX]

[DOI]

Raphaela Palenta

Helmut Seidl

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Strix: Explicit Reactive Synthesis Strikes Back!

[BibT_eX]

[DOI]

Philipp J. Meyer

Salomon Sickert

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

Quantitative Implementation Strategies for Safety Controllers.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Convergence of Newton's Method over Commutative Semirings.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Solving Mean-Payoff Games on the GPU.

[BibT_eX]

[DOI]

Philipp J. Meyer

Proceedings of the Automated Technology for Verification and Analysis, 2016

2015

FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity.

[BibT_eX]

[DOI]

Georg Bachmeier

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Regular Expressions for Provenance.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on the Theory and Practice of Provenance, 2014

A Brief History of Strahler Numbers.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

Fast and Accurate Unlexicalized Parsing via Structural Annotations.

[BibT_eX]

[DOI]

Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

2013

Putting Newton into Practice: A Solver for Polynomial Equations over Semirings.

[BibT_eX]

[DOI]

Michal Terepeta

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Solving Parity Games on the GPU.

[BibT_eX]

[DOI]

Philipp Hoffmann

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

Space-efficient scheduling of stochastically generated tasks.

[BibT_eX]

[DOI]

Inf. Comput., 2012

2011

Derivation tree analysis for accelerated fixed-point computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Parikhʼs theorem: A simple and direct automaton construction.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

An Extension of Parikh's Theorem beyond Idempotence

[BibT_eX]

[DOI]

CoRR, 2011

GAVS+: An Open Platform for the Research of Algorithmic Game Solving.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Solving Fixed-Point Equations by Derivation Tree Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010

Newtonian Program Analysis - An Introduction.

[BibT_eX]

[DOI]

Proceedings of the Logics and Languages for Reliability and Security, 2010

Solving Polynomial Systems on Semirings (Lösen polynomieller Systeme über Semiringen)

[BibT_eX]

[DOI]

PhD thesis, 2010

Computing the Least Fixed Point of Positive Polynomial Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Newtonian program analysis.

[BibT_eX]

[DOI]

J. ACM, 2010

Parikh's Theorem: A simple and direct construction

[BibT_eX]

[DOI]

CoRR, 2010

Lösen polynomieller Gleichungssysteme über Semiringen.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2010, 2010

GAVS: Game Arena Visualization and Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2010

2009

Solving Fixed-Point Equations on omega-Continuous Semirings.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

2008

Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games

[BibT_eX]

[DOI]

CoRR, 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Solving Monotone Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Newton's Method for omega-Continuous Semirings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

On the convergence of Newton's method for monotone systems of polynomial equations.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On Fixed Point Equations over Commutative Semirings.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

An Extension of Newton's Method to <i>omega</i> -Continuous Semirings.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Reachability Analysis of Procedural Programs with Affine Integer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2006

2004

Hierarchical Splatting of Scattered 4D Data.

[BibT_eX]

[DOI]

Matthias Hopf