جست‌وجوی استاد و پژوهشگر

Michele Chiariمشاهده پروفایل

پژوهشگر

• Formal Methods
• Approximate Computing
• Temporal Logic
• +۵ مورد دیگر

Michele Chiari is a researcher at TU Wien's TrustCPS group, with former affiliations at Politecnico di Milano's DEIB department. His work focuses on formal methods, temporal logic, and verification of safety-critical systems. Current affiliation: TU Wien, TrustCPS group Former affiliation: Politecnico di Milano, DEIB His research bridges temporal logic and probabilistic model checking , with innovations like Pushdown Operator Precedence Temporal Logic (POTL) for recursive program verification. Current projects include probabilistic pushdown automata verification under the MSCA PF CORPORA initiative. Articles in recent years explore signal temporal logic tableau methods , probabilistic hyperproperties for decentralized planning , and parallel parsing with operator precedence grammars . These align with his expertise in formal verification and approximate computing. Scientific awards: Best Student Paper Award at AAMAS 2025 He actively contributes to open-source tools like TAFFO for floating-point precision tuning and OPPAS for recursive probabilistic program verification. Collaborations span academic conferences (ECOOP, CAV) and H2020 projects like PIACERE.

József Kovácsمشاهده پروفایل

پژوهشگر

• Hybrid Systems
• Computer Science
• Control Systems
• +۳ مورد دیگر

József Kovács is a researcher affiliated with the Department of Computer Science at RWTH Aachen University. He joined the THS research group in September 2022 under the supervision of Prof. Dr. Erika Ábrahám and Prof. Dr. Anne Remke. His research focuses on hybrid Petri nets and hybrid systems, with contributions to formal methods and reachability analysis. Teaching responsibilities include leading seminars on Satisfiability Checking and Formal Methods (WS22/23, SS23, WS23/24) and lecturing on Modeling and Analysis of Hybrid Systems (SS24). He has supervised multiple theses, including projects on e-learning web apps, sparse polynomial zonotopes implementation, and label synchronization in reachability analysis. He is reachable at kovacs@cs.rwth-aachen.de , located in Room 4227, Ahornstraße 55, Aachen.

Patrick Totzkeمشاهده پروفایل

پژوهشگر

• Theoretical Computer Science
• Formal Verification
• Automata Theory
• +۵ مورد دیگر

Patrick Totzke is a theoretical computer scientist at the University of Liverpool's Department of Computer Science. His research focuses on mathematical models of computation, formal verification, and the complexity of strategies in stochastic and temporal games. University of Liverpool (2018–present) Postdoctoral positions: LFCS Edinburgh (2016–2018), University of Warwick (2015), LaBRI Bordeaux (2014) Research Interests include automata theory, game theory, computational logic, and computer-aided verification. Recent work emphasizes history-deterministic systems, timed automata, and decision problems in infinite-state games. Key Publications (2024–2025) explore temporal graph explorability (PSPACE-complete), stochastic nondeterminism resolution (undecidability in NFAs), and bounded-memory strategies in partial-information games. Earlier works address energy-parity objectives (NP∩coNP) and the reachability problem in 2D vector addition systems (NL-complete). Awards Shortlisted for Teacher of the Year (2021) PI on EPSRC-funded project (2021) Co-PI on Royal Society grant (2021) Collaborations include Richard Mayr, Stefan Kiefer, Mahsa Shirmohammadi, and Sougata Bose (postdoc, 2021). He co-chaired Reachability Problems (RP'21) and contributes to open-source tools like alot and LaTeX beamer themes.

• Formal Methods
• Hybrid Systems
• Probabilistic Systems
• +۱۰ مورد دیگر

Erika Ábrahám is a University Professor in the Department of Computer Science at RWTH Aachen University, Germany, where she leads the research group on the Theory of Hybrid Systems. Her work is centered on formal methods for cyber-physical systems, with a strong focus on hybrid and probabilistic systems, SMT solving, and symbolic computation. Her research interests include Formal Methods, Hybrid Systems, Probabilistic Systems, Satisfiability Modulo Theories (SMT), Symbolic Computation, Cyber-Physical Systems, Model Checking, Reachability Analysis, Automated Reasoning, Verification of Safety-Critical Systems, Robotics, Energy Optimization, and Artificial Intelligence . She develops theoretical foundations and practical tools for the analysis and verification of complex systems, especially in safety-critical domains like automotive and robotics. Her recent publications demonstrate a consistent focus on advancing SMT solving techniques, particularly in real algebra and cylindrical algebraic decomposition, and on analyzing probabilistic hybrid systems, including reachability and hyperproperties. She frequently contributes to and organizes major conferences and workshops in her field. Scientific Awards: No specific awards were mentioned in the provided text. Erika Ábrahám actively supervises students and researchers, with advisees including Jasper Kurt Ferdinand Nalbach, Valentin Maxim Promies, Stefan Schupp, and others. She has been involved in projects related to railway timetables, energy load control, and AI-based robotics. She also contributes to academic service through editing conference proceedings and promoting gender equality in software engineering. She is a key contributor to the HyPro library for hybrid systems reachability analysis and continues to publish in top venues such as LNCS, Springer, and Elsevier journals. Her recent work spans from core theoretical advances in SMT to applied research in sonar object detection and robotics.

Deepak D'Souzaمشاهده پروفایل

استاد

• Program verification
• Static analysis
• Model-checking
• +۴ مورد دیگر

Deepak D'Souza is a Professor in the Department of Computer Science and Automation at the Indian Institute of Science (IISc) Bangalore. He has been actively involved in research and teaching in theoretical computer science, particularly focusing on program verification, static analysis, and formal methods. His work bridges theoretical foundations with practical applications in software engineering and verification. His research interests span program verification, static analysis, model-checking, and models and logics for real-time systems. D'Souza has made significant contributions to automata theory, particularly in its applications to verification problems. He co-edited the book 'Modern Applications of Automata Theory' published by World Scientific, which focuses on verification and model checking technologies. His recent work shows a strong emphasis on logical LTL games, controller synthesis, and verification of embedded systems. Analysis of his publications reveals a consistent focus on verification techniques across different domains - from theoretical foundations in automata theory to practical applications in embedded systems like FreeRTOS. His work demonstrates a progression from foundational theoretical work to increasingly applied verification problems, while maintaining strong theoretical rigor. Recent publications show growing interest in synthesis techniques and applications of formal methods to real-world systems. D'Souza has mentored numerous PhD, MS, and ME students, with a current focus on verification problems. His research has been supported by significant grants from Siemens, DRDO, Robert Bosch Center for CPS, UKIERI, and Infosys, demonstrating both academic and industrial relevance of his work. He is actively engaged in the academic community, serving as General Chair for ATVA 2025, Program Committee member for numerous conferences, and previously as President of the Indian Association for Research in Computing (IARCS) from 2018-2023. He also chairs the Steering Committee for FSTTCS (2025-2027). D'Souza teaches advanced courses including Automata Theory and Computability, Formal Methods in Software Engineering, and Program Synthesis meets Machine Learning, demonstrating his commitment to educating the next generation of researchers in formal methods and verification.

Manuel Bodirskyمشاهده پروفایل

استاد

• Constraint Satisfaction Problems (CSP)
• Algebraic Methods in Computer Science
• Computational Logic
• +۵ مورد دیگر

Prof. Manuel Bodirsky is a Professor of Algebra and Discrete Structures at Technische Universität Dresden since August 2014. He leads the Algebra and Discrete Structures group within the Faculty of Computer Science and is affiliated with the International Center for Computational Logic (ICCL). His research focuses on constraint satisfaction problems (CSP), algebraic methods in computer science, computational logic, Ramsey theory, model theory, and discrete mathematics. Notable projects include exploring the algebraic tractability of CSPs and applying universal algebra to classify computational complexity. His work frequently intersects with combinatorics, graph theory, and theoretical computer science. Recent publications address advanced topics like temporal CSPs, spectrahedral shadows, and resilience problems using valued CSP frameworks. He maintains active collaborations in computational algebra and logic, contributing to both theoretical foundations and algorithmic applications. Education: Not explicitly listed in provided texts but inferred to include advanced studies in mathematics and computer science. Research interests span foundational areas such as: Constraint satisfaction problem complexity classification Applications of universal algebra to computational problems Model theory and finite structures Combinatorial properties of graphs and tournaments Algorithmic approaches to algebraic and logical systems His recent articles emphasize methodological innovations, including reductions to semidefinite programming, Ramsey-theoretic techniques, and gadget-based transformations. Despite no listed academic awards in the provided data, his prolific publication record reflects significant contributions to theoretical computer science and discrete mathematics. No student advisees or grant details were explicitly mentioned, though his group likely engages in funded research projects given the institutional context.

• Theoretical Computer Science
• Formal Verification
• Software Systems Verification
• +۵ مورد دیگر

Georg Zetzsche is a tenure-track faculty member at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany, where he heads the Models of Computation group. He joined MPI-SWS in November 2018 after postdoctoral positions at IRIF, Université Paris-Diderot (2017-2018) and LSV Cachan (2015-2017). He received his PhD in Computer Science from Universität Kaiserslautern under the supervision of Prof. Dr. Roland Meyer in 2015, with a dissertation in the Concurrency Theory Group. His research focuses on theoretical foundations of verification and synthesis of software systems, with particular emphasis on decidability and complexity issues of infinite-state systems. His work explores synthesis of finite-state abstractions of infinite-state systems (including separability problems, downward closures, and Parikh images), as well as decision problems for infinite groups where he applies methods from verification to gain insights on how to devise infinite-state models with pleasant analysis properties. Zetzsche's research output demonstrates expertise across formal verification, theoretical computer science, and programming language theory. His publications reveal a consistent focus on vector addition systems, reachability analysis, language theory, and decidability questions. His work often bridges theoretical foundations with practical verification problems, particularly in the context of infinite-state systems where traditional verification techniques face significant challenges. 2025 Salomaa Prize ERC Starting Grant for project FINABIS EATCS Best Paper Award at ETAPS 2023 EAPLS Best Paper Award at ETAPS 2021 Distinguished Paper Award at POPL 2021 EATCS Distinguished Dissertation Award He actively serves on program committees for major conferences including LICS 2026, MFCS 2025, DLT 2024, ICALP 2024, POPL 2024, LICS 2023, and many others. He has organized events such as Theorietag 2023 on automata and formal languages. His current group at MPI-SWS includes PhD students Pascal Baumann, Pascal Bergsträßer, Irmak Sağlam, Lia Schütze, and Yousef Shakiba, along with postdocs Moses Ganardi and Chris Köcher.

Ole Lübkeمشاهده پروفایل

پژوهشگر

• Real-Time Systems
• Formal Methods
• Maximum Satisfiability

Ole Lübke is a Researcher at the Institute for Software Systems at Technische Universität Hamburg. He holds a Master's degree in Computer Science and Engineering from TUHH, where he specialized in safety-critical real-time systems and formal methods. His research focuses on Real-Time Systems, Formal Methods including Runtime Verification and Online Model Checking, and Maximum Satisfiability problems. He contributes to developing incremental MaxSAT solvers and applies formal methods in healthcare technology, such as optimizing robotic radiation therapy systems. Education: Bachelor's degree in Computer Science and Engineering (2017), TUHH, via a dual study program in medical/safety technology. Master of Science (2020), TUHH, thesis on quantitative runtime verification for medical devices. His work includes advancing MaxSAT solver technology, as seen in publications like IGMaxHS and the noSAT-MaxSAT series. He also explores educational tools for functional programming exams, leveraging automated grading systems. His research bridges formal methods with practical applications in real-time and embedded systems. Teaching includes Functional Programming and Compiler Construction courses.

Ondřej Lengálمشاهده پروفایل

دانشیار

• Formal Verification
• Automata Theory
• Logic
• +۳ مورد دیگر

Ondřej Lengál is an Associate Professor at the Faculty of Information Technology, Brno University of Technology, Czech Republic. He earned his Ph.D. from the same institution in 2015 and was promoted to Associate Professor in 2025. His academic career centers on theoretical computer science with applications in formal verification and quantum computing. Education: Ph.D. in Computer Science, Brno University of Technology, 2015 Research Focus: Lengál's work bridges Formal Verification , Automata Theory , and Quantum Computing . He develops automata-based frameworks for string constraint solving and quantum circuit verification, with significant contributions to counting automata determinisation and regex matching algorithms. His research integrates logic and formal methods to address challenges in program analysis and quantum software correctness. Publication Trends: Analysis of his 12 publications (2017-2025) reveals a strategic evolution from classical automata theory (2017-2020) toward quantum verification (2023-2025). String constraint solving remains a consistent thread, while recent work demonstrates pioneering integration of tree automata in quantum circuit analysis. His research shows increasing interdisciplinary collaboration, particularly in quantum computing applications. Professional Engagement: Lengál actively contributes to the programming languages community as a PLDI Review Committee member (2026), VMCAI 2026 co-chair, and program committee member for APLAS (2022). He has served as session chair for TACAS 2019 and artifact evaluation co-chair, demonstrating leadership in conference organization and research validation.

David Monniauxمشاهده پروفایل

پژوهشگر

• program verification
• abstract interpretation
• static analysis
• +۸ مورد دیگر

David Monniaux is a senior researcher (directeur de recherche) at CNRS and an adjunct professor at École polytechnique. He works at VERIMAG, a computer science laboratory jointly operated by CNRS and the University of Grenoble. Dr. Monniaux obtained his PhD in 2001 from Université Paris Dauphine under Professor Patrick Cousot, with a dissertation on the static analysis of probabilistic programs by abstract interpretation. He later earned his habilitation in computer science in 2009 from Université Joseph Fourier, Grenoble, and also holds an agrégation in mathematics. Monniaux's research focuses on program verification, with particular emphasis on proving software correctness. His work spans theoretical foundations in computability theory and practical applications in safety-critical systems. He has made significant contributions to abstract interpretation, static analysis, and the verification of numerical properties in programs. His research bridges computer science theory with practical engineering challenges, particularly in the context of critical embedded systems where software failures can have severe consequences. His work connects to diverse fields including game theory, algebra, and convex optimization. His recent publications demonstrate a strong focus on improving the precision and efficiency of static analysis techniques. Key themes include polyhedral approximation, program analysis with local policy iteration, abstraction of arrays and maps, synthesis of ranking functions, and computing worst-case execution times. These works collectively advance the field of program verification by addressing challenges in handling nonlinear constraints, branching, and complex data structures while maintaining computational feasibility. Monniaux has supervised several students including Julien Henry, Alexis Fouilhé, George (Egor) Karpenkov, and Alexandre Maréchal (now at LIP6), with current students Hang Yu and Valentin Touzeau. He has led significant research projects including VERASCO (2012-2015), which aimed at integrating a static analyzer into the CompCert certified compiler, and STATOR (2012-2017), an ERC starting investigator grant exploring advanced techniques for automatic inference of program invariants. At VERIMAG, Monniaux is part of a vibrant research community focused on critical systems. His work connects with broader efforts in formal methods, with applications in aviation, automotive systems, and other safety-critical domains where software reliability is paramount.

Erika Ábrahámمشاهده پروفایل

استاد

• Computer Science
• Satisfiability Checking
• SMT Solving
• +۷ مورد دیگر

Erika Ábrahám is a Full Professor at RWTH Aachen University , Germany, leading the Theory of Hybrid Systems research group. Her academic journey includes positions as a Junior Professor (2008-2013) and postdoctoral researcher at institutions like Jülich Research Centre and Albert-Ludwigs-University Freiburg. Her research interests span formal methods, SMT solving, hybrid systems verification, and probabilistic systems. She has contributed to symbolic computation, railway timetables, and probabilistic hyperproperties, with recent work focusing on cylindrical algebraic decomposition, conflict-driven search algorithms, and stochastic modeling. Scientific contributions include 15+ articles (2021-2025) on topics like probabilistic hyperproperties , hybrid automata , and symbolic arithmetic , often published in LNCS, Springer, and Elsevier venues. She has collaborated on tools like HyPro and SMT-RAT, and edited proceedings for conferences including NASA Formal Methods and QEST.

• Computational Logic
• Automata Theory
• Description Logic
• +۳ مورد دیگر

Dr. Oliver Fernández Gil serves as a Research Associate in the Automata Theory group at Dresden University of Technology's Faculty of Computer Science, affiliated with the International Center for Computational Logic (ICCL). His academic work is centered in theoretical computer science with emphasis on formal methods and computational logic. His research interests span Computational Logic , Automata Theory , and Description Logic , with specific focus on temporal logics, unification problems, and knowledge representation systems. His work bridges theoretical foundations with practical applications in formal verification and semantic technologies. Analysis of his publication record from 2013-2014 reveals a strong concentration in temporal logic systems (MTL and TPTL) and description logic unification, particularly within the EL framework. His research demonstrates expertise in computational complexity analysis, formal language theory, and logical reasoning systems, with applications spanning model checking, ontology reasoning, and knowledge integration. Dr. Fernández Gil has maintained active collaborations with prominent researchers in the field including Franz Baader, Karin Quaas, and Barbara Morawska, indicating integration within significant theoretical computer science research networks. His laboratory affiliation is with the International Center for Computational Logic within TU Dresden's Faculty of Computer Science, where he contributes to the Automata Theory research group's work on formal methods and computational logic systems.

• Formal Methods
• Neural Network Verification
• AI in Robotics
• +۳ مورد دیگر

László Antal is a Researcher at RWTH Aachen University's Department of Computer Science, affiliated with the Theory of Hybrid Systems (THS) group. He is pursuing a PhD under Prof. Erika Ábrahám, with additional supervision from Prof. Ana Maria Madureira and industrial advisor Luís Madureira. His research focuses on formal methods for AI-controlled systems and neural network verification, particularly in the context of marine robotics through the REMARO project. Education: B.Sc. and M.Sc. in Computer Science/Data Analysis from Babeș-Bolyai University (Cluj-Napoca, Romania), followed by PhD studies at RWTH Aachen since 2021. Research interests emphasize hybrid systems verification, neural network safety, and autonomous systems applications. His work bridges formal methods with practical robotics challenges, such as underwater vehicle navigation and pipeline inspection. Teaching contributions include leading seminars on formal methods and satisfiability checking from 2021–2024. He has advised four students on theses involving neural network verification, reachability analysis, and dimensionality reduction techniques. László collaborates on the EU-funded REMARO project, developing reliable AI for marine robotics. His work integrates interdisciplinary approaches, combining formal verification with robotics engineering and data science.

Johanna Nellenمشاهده پروفایل

پژوهشگر

• Hybrid Systems
• Control Engineering
• Automotive Systems
• +۳ مورد دیگر

Johanna Nellen is a Researcher at the Research Group Theory of Hybrid Systems under Prof. Dr. Erika Ábrahám at RWTH Aachen University. Her work focuses on hybrid systems synthesis, verification, and their applications in control engineering and automotive systems. She holds a PhD supported by the DFG research training group AlgoSyn, where she explored hybrid system analysis in plant control and hybrid electric vehicle strategies. Since 2016, she has contributed to the Ford–RWTH Aachen Alliance project on Simulink model verification. Her research also includes optimal control algorithms for hybrid propulsion systems, as evidenced by her DFG-funded OASys project collaboration. Teaching and supervision: She has guided students in seminars on hybrid systems verification, satisfiability checking, and real-time systems. Her practical labs include control strategies for hybrid vehicles and robotics with Lego Mindstorms. Supervised theses address neural networks in vehicle control, grid-based strategies, and HSFC verification techniques. Activities: Member of AlgoSyn Steering Committee (2011–2013), co-organized Promotions-CAFÉ (2012–2016), and mentored in TANDEM (2011–2012). Active in outreach via Schüleruniversität and Aachener Informatiktage (2011–2015).

Khushraj Madnaniمشاهده پروفایل

پژوهشگر

• Formal Logics and Models of Computation
• Specification and Verification of Timed Systems
• Scheduler Synthesis for Networked Control Cyber-Physical Systems
• +۳ مورد دیگر

Khushraj Madnani is a postdoctoral researcher at the Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany, under Prof. Rupak Majumdar and Prof. Georg Zetzsche. His research focuses on formal logics, infinite-state models, and their applications in formal methods and verification. Previously, he was a postdoctoral researcher at Delft University of Technology (2020–2021) and a visiting fellow at the Tata Institute of Fundamental Research (2019–2020). He holds a PhD in Computer Science from the Indian Institute of Technology Bombay (2013–2019). Research Interests : Specification and Verification of Timed Systems Scheduler Synthesis for Networked Control Cyber-Physical Systems Formal Logics and Models of Computation Recent Contributions : His work spans decidability of timed logics, formal verification of real-time systems, and control theory. Key themes include metric temporal logic extensions, decidability boundaries, and applications in cyber-physical systems. Recent articles explore quantifier elimination in Presburger arithmetic and decidability of timed temporal logics with advanced quantifiers. Professional Roles : He collaborates with leading research institutes and has contributed to international conferences such as CONCUR, MFCS, and CDC. His work bridges theoretical foundations with practical verification challenges in real-time systems and networked control.