Joerg Endrullis

Joerg Endrullis
Name	Joerg Endrullis
Nationality	German
Fields	Computer science, Theoretical computer science, Automata theory, Term rewriting
Workplaces	Radboud University Nijmegen, University of Stuttgart
Alma mater	University of Stuttgart
Doctoral advisor	Hans Zantema

Joerg Endrullis is a German computer scientist known for contributions to automata theory, term rewriting, and the analysis of infinite words and stream processing. He has held academic positions at institutions including Radboud University Nijmegen and the University of Stuttgart, and he has collaborated with researchers across Europe and North America. His work bridges theoretical foundations and practical analysis techniques used in formal verification, programming language semantics, and symbolic computation.

Early life and education

Endrullis grew up in Germany and pursued studies in computer science at the University of Stuttgart, where he completed his doctoral work under the supervision of Hans Zantema. His doctoral research situated him within communities focused on term rewriting systems, automata theory, and the semantics of infinite data structures. During this period he engaged with seminars and research groups connected to institutions such as the Max Planck Institute for Informatics, the Technical University of Munich, and the University of Cambridge.

Academic career

Endrullis has held research and teaching posts at the University of Stuttgart and later at Radboud University Nijmegen, contributing to collaborative projects with teams from Eindhoven University of Technology, CNRS, and MPI-SWS. He has been an active participant and organizer in international conferences including ICFP, LICS, RTA, CADE, and FSCD, and has served on program committees for venues such as ICALP and CAV. His academic service includes editorial roles for journals associated with Springer, Elsevier, and the ACM, and he has been involved with EU-funded initiatives and bilateral research programs with groups at University of Oxford, École Polytechnique, and KTH Royal Institute of Technology.

Research contributions

Endrullis's research spans the theory of infinite words, productivity of stream specifications, and termination analysis for rewriting systems. He has developed techniques linking automata theory with term rewriting to analyze regular languages, context-free grammars, and properties of omega-regular languages arising in model checking and formal verification. His work on productivity connects to the study of coinduction and corecursion used in specifications in languages like Haskell and systems such as Coq and Agda. He has contributed decidability and complexity results for problems related to size-change termination, matrix interpretations, and automated proofs of termination for term rewrite systems relevant to tools such as AProVE and TCT.

Endrullis introduced and refined methods for analyzing the behavior of infinite reductions by combining ideas from Büchi automaton theory, Muller automaton constructions, and algebraic characterizations stemming from semigroup theory and linear algebra. He has produced results demonstrating connections between automatic sequences studied by Allouche and Shallit and rewriting approaches linked to researchers at RWTH Aachen and TU Darmstadt. Collaborative papers with scholars from Utrecht University, University of Leeds, and University of Bonn explored algorithmic aspects of productivity, showing decidability in specific syntactic classes and complexity bounds that influenced subsequent tool development.

Teaching and mentorship

As a lecturer and supervisor, Endrullis has taught courses related to formal languages, semantics of programming languages, and automata theory at both undergraduate and graduate levels. His doctoral students and postdoctoral mentees have gone on to positions at institutions such as Radboud University Nijmegen, Eindhoven University of Technology, University of Cambridge, and NTNU. He has supervised theses addressing topics like stream productivity, termination provers, and the implementation of proof certificates compatible with Isabelle/HOL and Coq. He regularly offers tutorials and summer school lectures in collaboration with organizers from ETAPS, CaSToRC, and the Dagstuhl Seminars network.

Awards and honors

Endrullis's contributions have been recognized through invitations to speak at major events including ICFP, LICS, and Dagstuhl perspectives meetings. He has received research grants from national agencies and participated in consortium awards funded by European Research Council-associated programs and national science foundations with partners at CNRS and NWO. His papers have been shortlisted for best paper recognitions at conferences such as RTA and FSCD.

Selected publications

- Papers on productivity of stream specifications and decidability results published in proceedings of LICS and RTA with coauthors from Radboud University Nijmegen and University of Stuttgart. - Works connecting automata-theoretic techniques to term rewriting tools appearing in proceedings of ICFP and CAV with collaborators from RWTH Aachen and Eindhoven University of Technology. - Articles on termination analysis and matrix interpretations in journals and conferences associated with CADE, TACAS, and JAR coauthored with researchers from University of Bonn and TU Darmstadt. - Collaborative studies on automatic sequences and infinite words in venues such as STACS and MFCS with partners from University of Cambridge, University of Leeds, and Utrecht University.

Category:German computer scientists Category:Theoretical computer scientists Category:University of Stuttgart alumni