Find Academic Supervisors

• Robotics
• Photogrammetry
• Simultaneous Localization and Mapping (SLAM)
• +12 more

Cyrill Stachniss is a Full Professor at the University of Bonn , where he heads the Lab for Photogrammetry and Robotics and is affiliated with the Lamarr Institute for Machine Learning and Artificial Intelligence . He was previously a Visiting Professor in Engineering at the University of Oxford until 2025. His academic journey includes positions at the University of Freiburg, University of Zaragoza, and the Swiss Federal Institute of Technology. University: University of Bonn School: Faculty of Engineering Department: Department of Photogrammetry Academic Rank: Professor His research spans robotics, photogrammetry, SLAM, autonomous navigation, perception systems, agricultural robotics, and unmanned aerial vehicles . He emphasizes probabilistic techniques for mobile robots and has made significant contributions to visual and LiDAR-based localization, scene understanding, and 3D reconstruction. The recent publications highlight a strong trend toward neural implicit representations, agricultural phenotyping, radar-based perception, and active learning . His team develops robust systems for real-world deployment in dynamic and unstructured environments, particularly in precision farming and autonomous vehicles. Scientific Awards: IEEE RAS Early Career Award (2013) Microsoft Research Faculty Fellow (2010) 7th EURON Georges Giralt Award (2008) Multiple Best Paper Awards at ICRA, IROS, RSS, and RAL Faculty Teaching Award, University of Freiburg He has advised numerous students and leads the DFG Cluster of Excellence PhenoRob and Research Unit FOR 1505 Mapping on Demand . His lab has co-founded three startups, reflecting strong industry and societal impact. He also runs the educational video series 5 Minutes with Cyrill , explaining key robotics concepts.

• Finite Model Theory
• Graph Structure Theory
• Computational Complexity
• +3 more

Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.

• Process Mining
• Business Process Management
• Stochastic Processes
• +4 more

Dr. Sander Leemans is a Professor at RWTH Aachen University leading the Business Process Management Foundations and Engineering research group. His work focuses on advancing process mining theory and practice with emphasis on stochastic modeling and conformance verification. Leemans' research centers on process mining, business process management, and stochastic process modeling. He investigates conformance checking techniques for probabilistic models, process discovery algorithms, and the integration of exogenous data into process analysis. His work bridges theoretical foundations with practical applications in healthcare, robotic process automation, and inter-organizational systems. Recent publications reveal a concentrated research trajectory in stochastic conformance checking, where Leemans develops methods for matching observed traces to stochastic process models using alignment techniques, entropy metrics, and partial-order reasoning. He also pioneers object-centric process mining frameworks and explores silent transitions in labeled Petri nets, significantly enhancing the precision and applicability of process mining in real-world scenarios. The Business Process Management Foundations and Engineering group under Leemans' leadership drives innovation in process mining through rigorous theoretical development and open-source tooling, maintaining RWTH Aachen's position at the forefront of business process intelligence research.

Lars GrunskeView profile

Professor

• Software Engineering
• Formal Methods
• Model Checking
• +5 more

Lars Grunske is a Professor at the Department of Computer Science, Faculty of Mathematics and Natural Sciences, Humboldt University of Berlin. His research focuses on software and systems engineering, safety-critical systems, and software evolution. Department: Computer Science University: Humboldt University of Berlin Academic Rank: Professor His work spans automated software analysis, probabilistic model checking, and formal methods for complex systems. Key collaborations include researchers from Swinburne University, University of Hull, and University of Queensland. Recent publications address research software engineering, program repair, and explainability in cyberphysical systems. Professional roles include leadership in examination boards and program committees for conferences like ICSE and ASE. Contact info: Email: grunskel@hu-berlin.de Phone: +49 30 2093-41142 Address: Unter den Linden 6, Berlin

• Databases
• Data Management
• Provenance Analysis
• +6 more

Val Tannen is a Professor at the University of Pennsylvania, specializing in database systems, provenance analysis, and programming languages. His research focuses on data management, query languages, and systems like DBSP and ORCHESTRA. Collaborations include work with co-authors such as Zachary Ives, Susan Davidson, and Todd Green. Key research interests include provenance for databases, incremental view maintenance, and data integration. His work bridges theoretical foundations and practical applications in systems like DBSP for stream processing and ORCHESTRA for collaborative data sharing. Publications span provenance frameworks, query optimization, and distributed systems. While no awards are explicitly listed, his contributions to database theory and systems are widely recognized.

Anne RemkeView profile

Professor

• Dependability
• Security
• Critical Infrastructures
• +5 more

Professor Anne Remke leads the safety-critical systems group at the Faculty of Mathematics and Computer Science at Westfälische Wilhelms-Universität Münster since October 2014. She is also affiliated with the Design and Analysis of Communication Systems group at the University of Twente, where she served as assistant professor from June 2010 and became associate professor in March 2016. Her research focuses on dependability and security in critical infrastructures, particularly electrical power systems and telecommunication networks. Her educational background includes a PhD (2008) and MSc (2004) in Computer Science from the University of Twente and RWTH Aachen respectively. Her doctoral research focused on 'Model Checking Structured Infinite Markov Chains,' for which she publicly defended her thesis in June 2008. Professor Remke's research interests center on cyber-physical systems, with particular focus on evaluation of charging strategies for local energy storage in smart homes and security of control networks (SCADA) in smart grids. Her work bridges theoretical model checking techniques with practical applications in critical infrastructure protection. She has made significant contributions to the analysis of hybrid Petri nets, stochastic models, and the development of tools for dependability evaluation. Her recent publications demonstrate a strong trend toward integrating machine learning with formal verification methods for cyber-physical systems. The research spans stochastic hybrid systems, reachability analysis, and security evaluation of smart grid infrastructures, showing consistent growth in both theoretical foundations and practical applications of dependability analysis. Veni award from Dutch Science foundation (NWO) for 'Counting on a reliable water supply' GI/ITG MMB prize for best diploma thesis in computer and communication systems Best Paper Award at Valuetools 2023 conference Best Repeatability and Artifact Evaluation Award at QEST21 Teaching award from Fachschaft FB10 (2019) Professor Remke has successfully secured multiple research grants including the DFG project 'RealyST: Reachability Analysis for Stochastic Hybrid Systems' in collaboration with RWTH Aachen. She has supervised numerous students including Katharina Sichma, Pauline Blohm, Joanna Delicaris, Verena Menzel, Mathis Niehage, Jonas Stübbe, and Lisa Willemsen. Her research group actively participates in international collaborations and standardization efforts in critical infrastructure security. The safety-critical systems group maintains several research tools including HYPEG (for simulation and analysis of hybrid Petri nets), TimeNET (a GUI for modeling hybrid Petri nets), and a Smart Neighbourhood Simulation Tool for community energy storage and trading. These tools support their research in modeling and evaluating complex critical infrastructures through both analytical methods and simulation techniques.

Jürgen GieslView profile

Professor

• Program Verification
• Automated Deduction
• Termination Analysis
• +12 more

Jürgen Giesl is a Professor at the Teaching and Research Area Computer Science 2 within the Department of Computer Science at RWTH Aachen University , Germany. He leads research in programming languages, formal verification, automated deduction, and term rewriting systems. Research Interests: Automated Termination and Complexity Analysis of Programs Dependency Pairs and Term Rewriting Systems Verification of Probabilistic and Integer Programs Static Analysis and Symbolic Execution Model Checking and Constrained Horn Clauses Development of Automated Tools (AProVE, LoAT) His recent research, reflected in the latest publications, focuses on termination and complexity analysis for probabilistic programs, polynomial loops, and integer programs, using advanced techniques such as dependency pairs, loop acceleration, and semiring semantics. He also contributes to SMT solving and transitive relation learning for infinite-state model checking. Scientific Awards: Best Tool Paper Award at iFM 2017 Silver Medal (Second Best Paper) at SEFM '16 Best Paper Honourable Mention at IJCAR 2024 Best Student Paper Honourable Mention at IJCAR 2024 Advising and Grants: Giesl has supervised numerous PhD and Master’s students, including prominent researchers such as Fabian Frohn, Jens Hensel, Nils Lommen, and Marcel Hark. He leads a large research group focused on automated verification and has contributed extensively to international verification competitions. His work is supported by ongoing research grants and collaborations with leading institutions in formal methods. Labs and Teams: He leads the Programming Languages and Verification research group at RWTH Aachen, which develops and maintains the AProVE and LoAT tools. These tools are central to automated termination and complexity analysis and are regularly submitted to international competitions such as TERMCOMP and VBS.

Rayna DimitrovaView profile

Assistant Professor

• Verification
• Reactive Systems Synthesis
• Control and Robotics
• +3 more

Rayna Dimitrova is a Tenure-track faculty member at the CISPA Helmholtz Center for Information Security in Saarbrücken, Germany. Previously, she held positions as Lecturer (Assistant Professor) at the University of Sheffield and University of Leicester, and postdoctoral roles at the University of Texas at Austin and the Max Planck Institute for Software Systems. She earned her PhD from Saarland University. Her research focuses on formal methods, including verification and synthesis of reactive systems, applications to control and robotics, quantitative analysis of probabilistic systems, and information-flow security. Key interests include strategic synthesis under partial observability, probabilistic uncertainty, and continuous dynamics, with applications to autonomous systems. She has served in numerous prestigious roles, including PC co-chair for VMCAI 2024, HYPER 2023, and SMT 2018. Her awards include the RS3 Best Paper Award (VMCAI 2012) and nominations for ETAPS (TACAS 2015) and EMSOFT (2014) Best Paper Awards. Her research group includes PhD students Rafael Dewes, Philippe Heim, and Saleh Soudijani. She has taught courses on reactive synthesis, program analysis, and decision procedures at multiple institutions, including the University of Sheffield and TU Kaiserslautern.

• Natural Language Processing
• Computational Linguistics
• Machine Learning
• +4 more

Dr. Lea Frermann is an active researcher in computational linguistics and natural language processing, with a focus on media framing analysis, fairness in AI, and Bayesian modeling of semantic categories. Her work bridges machine learning with social science applications, particularly in political discourse and climate communication contexts. PhD in Bayesian models of category acquisition (University of Edinburgh, 2017) Key collaborations with University of Melbourne, ACL, EMNLP, and CoNLL communities Research emphasizes: Media framing analysis across cultures Explainable AI for bias detection Bayesian approaches to language understanding Word association modeling for value systems Computational methods for political discourse analysis Applications in mental health support forums Recent publications focus on large language models' limitations in hierarchical reasoning, multimodal categorization, and systematic fairness evaluation frameworks. Collaborations show strong connections with researchers like Timothy Baldwin, Trevor Cohn, and Omri Abend.

• Automata Theory
• Formal Methods
• Tree Automata
• +4 more

Christof Löding is an Adjunct Professor at the Department of Logic and Theory of Discrete Systems (Computer Science 7) at RWTH Aachen University. His research focuses on automata theory, formal verification, and logical foundations of computer science, with significant contributions to Büchi automata, tree automata, and stochastic games. Academic affiliation: RWTH Aachen University, Germany Research areas: Automata theory, Formal methods, Game theory, Logic in computer science Contact: loeding@informatik.rwth-aachen.de His recent work spans deterministic parity automata construction, finite-valued transducers, and algorithmic solutions for infinite games. Publications emphasize theoretical foundations and practical applications in program verification and XML processing. Articles analyze automata learning, uniformization problems, and lookahead degrees in infinite games, showing interconnections between automata theory and formal verification.

• Automata Theory
• Formal Verification
• Logic in Computer Science
• +3 more

Christof Löding , currently an Adjunct Professor at the Lehrstuhl für Logik und Theorie diskreter Systeme (Informatik 7) department of RWTH Aachen University , is a leading researcher in Automata Theory , Formal Verification , and Logic in Computer Science . His work bridges theoretical foundations with practical applications in software verification, automata minimization, and game theory. Research Interests include automata theory, formal verification, logic, tree automata, game theory, and computational models. Publications span topics like Finite-valued Streaming String Transducers , Deterministic Parity Automata , and Stochastic Game Strategies . Collaborations with researchers like Emmanuel Filiot , Sarah Winter , and León Bohn highlight his contributions to automata and verification. Email : loeding@informatik.rwth-aachen.de He has actively published in venues such as ICALP , LICS , and STACS , focusing on deterministic automata, transducers, and logic-based computational systems. His work on Hyperlogic for Strategies in Stochastic Games (2025) and Minimal History-Deterministic Automata (2025) showcases his ongoing influence in formal methods and automata theory.

• Software Engineering
• Model Checking
• System Modeling
• +5 more

Seung Yeob Shin serves as a Research Scientist at the University of Luxembourg's Interdisciplinary Centre for Security, Reliability and Trust (SnT), where he contributes to the Software Verification and Validation (V&V) Lab under Prof. Lionel Briand. His active participation in major software engineering conferences includes serving on ASE 2025's Research Papers Program Committee and authoring multiple journal-first publications presented at premier venues like ICSE and ESEC/FSE. Shin earned his PhD in 2016 from the Laboratory for Advanced Software Engineering Research (LASER) at the University of Massachusetts Amherst's College of Information and Computer Sciences. His research expertise centers on applying formal methods to complex software systems, with particular emphasis on model-based verification techniques. His current research program bridges theoretical modeling and practical system validation across critical domains. Key focus areas include developing simulation frameworks for software-defined networks, creating model-checking approaches for cyber-physical control loops, and establishing probabilistic methods for real-time system verification. This work consistently targets reliability challenges in safety-critical infrastructure through rigorous engineering methodologies. Recent publications demonstrate a cohesive trajectory in applying formal verification to emerging system paradigms. The 2024 journal-first papers reveal increasing sophistication in handling non-deterministic behaviors across networking, embedded systems, and requirements engineering domains, with notable emphasis on failure induction and probabilistic safety guarantees. No scientific awards were documented in the available materials. While conference contributions indicate significant scholarly engagement, no information regarding student advising or research grants appears in the provided documentation. As a core member of the V&V Lab at SnT, Shin contributes to Luxembourg's national cybersecurity research infrastructure. The lab specializes in developing mathematical frameworks for system validation, with current projects addressing verification challenges in autonomous systems, critical infrastructure, and secure communications protocols through model-driven approaches.

Shibashis GuhaView profile

Associate Professor

• Formal Methods
• Logic in Computer Science
• Automata Theory
• +12 more

Shibashis Guha is an Associate Professor (Reader) at the School of Technology and Computer Science, Tata Institute of Fundamental Research (TIFR), where he conducts research and teaches in formal methods, logic, automata theory, and verification. His work focuses on reactive controller synthesis, probabilistic systems, timed automata, and the integration of machine learning with formal verification. Institution: Tata Institute of Fundamental Research School: School of Technology and Computer Science Department: Department of Computer Science Academic Rank: Associate Professor His research interests span formal methods, logic in computer science, automata theory, probabilistic systems, algorithmic game theory, and reinforcement learning. He investigates the synthesis of reactive controllers, behavioral equivalences, and the application of learning in verification. His work often intersects with infinite games and descriptive complexity. The recent publications highlight a strong trend in stochastic games, mean-payoff objectives, window properties, probabilistic model checking, and the synthesis of controllers under logical specifications. There is a clear emphasis on bridging formal methods with learning, especially in continuous-time and probabilistic settings. Scientific Awards: Best paper award at MFCS 2021 Guha advises several students and collaborates widely across institutions. His research is funded by the DST-SERB project on zero-sum and nonzero-sum games for controller synthesis. He has served on program committees for major conferences including CAV, ATVA, CONCUR, LICS, and VMCAI, and has organized workshops such as iVerif. He teaches advanced graduate courses like Automata and Computability, Descriptive Complexity, and Automata, Verification, and Infinite Games. He is actively involved in the research community, delivering invited talks at institutions like IST Austria, ENS Paris-Saclay, and Indian Statistical Institute. He also leads seminar series and participates in panels on AI and verification.

André NiemannView profile

Professor

• Hydraulic Engineering
• Water Management
• Flood Protection
• +6 more

Professor André Niemann at the University of Duisburg-Essen's Institute of Hydraulic Engineering and Water Management is a leading expert in water resources management, focusing on flood protection, dam control systems, and AI-driven hydrological forecasting. His work bridges practical engineering challenges with advanced data science applications. Academic Leadership: Coordinated projects like interSim (interactive simulation for vocational training) and PROWAVE (forecast-based dam control) Research Impact: Pioneered ensemble optimization methods for reservoirs and LSTM models for inflow forecasting Technological Innovation: Developed AI frameworks for sensor data quality control in water management His research addresses critical intersections between hydraulic engineering and climate resilience, with recent projects analyzing flood forecasting systems ( HÜProS ), urban drainage optimization, and sustainable hydropower solutions using legacy mining infrastructure. Collaborations span institutions like Harz Waterworks, Deltares, and international conferences (IAHR, ICOLD, EGU). Publications since 2012 cover topics from underground pumped storage feasibility to real-time control of urban reservoirs, with a growing emphasis on machine learning applications since 2023. He actively engages in fieldwork, including excursions to dams and control centers, and teaches modules ranging from hydromechanics to environmental monitoring.

Benjamin C. PierceView profile

Professor

• Programming Languages
• Type Systems
• Language-based Security
• +5 more

Benjamin C. Pierce is the Henry Salvatori Professor of Computer and Information Science in the School of Engineering and Applied Science at the University of Pennsylvania. As a Fellow of the ACM, he has made significant contributions to programming language theory and formal methods. His academic leadership includes previous editorial roles as co-Editor in Chief of the Journal of Functional Programming and Managing Editor for Logical Methods in Computer Science. His research spans multiple interconnected domains in programming language theory, with particular emphasis on type systems and their applications to security and verification. Pierce's work bridges theoretical foundations with practical implementations, most notably through his development of the Unison file synchronization tool and contributions to the Clowdr virtual conference platform. His research interests form a cohesive trajectory from foundational type theory to applied security and verification techniques. Pierce's scholarly output shows consistent focus on property-based testing, type systems, and formal verification methods. His recent publications demonstrate evolving interests in differential privacy verification, synchronization technologies, and the practical challenges of implementing formal methods in real-world systems. The progression of his work reflects both theoretical depth and practical relevance to software development challenges. Fellow of the ACM Author of influential textbooks Types and Programming Languages and Software Foundations Lead designer of the Unison file synchronizer Co-developer of the Clowdr virtual conference platform Former editorial leadership for multiple prominent programming languages journals As an educator and mentor, Pierce has contributed to the Programming Languages Mentoring Workshop (PLMW) and has served on numerous conference program committees. His academic service extends to SIGPLAN leadership roles including SIGPLAN Vice Chair and Steering Committee membership. His textbook Software Foundations has become a standard resource for teaching formal methods and proof assistants.