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

Paul Hunterمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Formal Verification
• Graph Theory
• +۳ مورد دیگر

Dr. Paul Hunter is an Associate Professor in the School of Computer Science and Engineering at the University of New South Wales (UNSW), Faculty of Engineering. He completed his BSc in mathematics at the University of Tasmania, followed by a PhD in Theoretical Computer Science at the University of Cambridge. His academic journey included an EPSRC Postdoctoral Fellowship at the University of Oxford (2008-2013), a postdoctoral position at the Université Libre de Bruxelles (2013-2016), and his return to Australia in 2016 to join UNSW. Dr. Hunter's research spans theoretical computer science with particular expertise in formal verification, graph theory, algorithms, and game theory. His work focuses on quantitative games, reactive synthesis, and automata theory, with significant contributions to areas such as mean-payoff games with partial observation, regret minimization, and real-time logic. His research has important applications in formal verification, controller synthesis, and decision-making under uncertainty. His publication record shows consistent scholarly output since 2004, with particular concentration in the period 2014-2022. His work demonstrates strong theoretical foundations while addressing practical problems in computer science. The research trends indicate increasing focus on reactive synthesis without regret, quantitative games with incomplete information, and the application of game theory to formal verification problems. Among his notable achievements is the EPSRC Postdoctoral Fellowship, which supported his research at Oxford for five years. His research has been published in top theoretical computer science venues and has influenced the field of formal methods and game theory. Dr. Hunter maintains an active research program with recent publications in 2022, indicating ongoing scholarly productivity. His work bridges theoretical computer science with practical applications in verification and synthesis. He is part of UNSW's strong research ecosystem in technology and computer science, contributing to Australia's research capacity in theoretical foundations of computing.

Igor Walukiewiczمشاهده پروفایل

پژوهشگر

• Concurrency Theory
• Model Checking
• Timed Automata
• +۷ مورد دیگر

Igor Walukiewicz is a Researcher at the Laboratoire Bordelais de Recherche en Informatique (LaBRI) , affiliated with Université de Bordeaux , France. His work focuses on Concurrency Theory , Model Checking , Timed Automata , Higher-Order Model Checking , and Automata Theory . His recent research explores parametric systems , timed automata , and higher-order concurrency . Articles highlight advancements in verification techniques , synthesis of distributed algorithms , and partial-order reduction methods . Key subfields include deadlock avoidance , active learning , and logical frameworks for timed systems . He has secured significant ANR grants such as FREDDA (FoRmal Methods for Distributed Algorithms) and Ticktac (Verification of Real-Time Systems). He contributes to tools like TChecker , a model-checking tool for real-timed systems developed at LaBRI. Walukiewicz participates in editorial and organizational roles, including the Fundamenta Informaticae editorial board and HIGHLIGHTS conference steering committee. He has presented at major venues like LICS , CONCUR , and ICALP .

Marco Ragniمشاهده پروفایل

استاد مدعو

• Cognitive Modeling
• Human Reasoning
• Neurocognitive Processes
• +۵ مورد دیگر

Marco Ragni is an Adjunct Professor at the Department of Psychology, Albert-Ludwigs-University Freiburg, and reachable at TU Chemnitz. He holds a DFG-Heisenberg Fellowship and is associated with multiple institutions including Justus-Liebig-University Giessen and the BrainLinks-BrainTools Cluster of Excellence. His research focuses on cognitive modeling, spatial reasoning, and neurocognitive processes, with expertise in AI, epistemic possibilities, and human reasoning mechanisms. Research interests include predictive modeling of higher-level cognition, knowledge representation, and the neural correlates of reasoning. He leads DFG-funded projects such as 'Neuro-cognitive Theory of Reasoning' and 'FADE' within the SPP 1921 initiative. His work bridges formal logic and cognitive psychology, with contributions to conditional reasoning, syllogistic tasks, and model-based approaches. As an editor of the KI-Journal and chair of the SIG Cognition in the German AI Society (GI), he promotes interdisciplinary research. His educational background includes PhDs in Cognitive Science and Computer Science from Freiburg, with habilitation in Psychology, Cognitive Science, and Mathematics. Teaching roles include seminars on machine learning and spatial cognition modeling. Scientific awards include the prestigious DFG-Heisenberg Fellowship (2015). Ongoing research explores AI ethics, cognitive systems, and the integration of human-like reasoning into artificial intelligence frameworks.

Aiswarya Cyriacمشاهده پروفایل

دانشیار

• Automata Theory
• Formal Verification
• Concurrency Theory
• +۴ مورد دیگر

Aiswarya Cyriac is an Associate Professor in the Theoretical Computer Science Group at Chennai Mathematical Institute (CMI), India, with active roles including program committee co-chair for FSTTCS 2025 and ICLA 2025. She is a member of ReLaX, an international research lab established by CNRS (France), fostering cross-border collaboration in foundational computer science. Her office is located at CMI's H1, SIPCOT IT Park campus in Siruseri, Chennai. Educational Background: Ph.D. from École normale supérieure de Cachan, France (2014) Her research specializes in automata theory and its applications to the verification of infinite state systems, concurrent models, and distributed algorithms. She develops formal mathematical frameworks for string constraints with subword ordering, finite state transducers, and treewidth-based verification techniques, addressing decidability and complexity challenges in system analysis. Current projects focus on verification of communicating Datalog programs and string constraint satisfiability. Publication trends (2020-2024) reveal a concentrated effort on verification methodologies for communicating systems, string constraint analysis, and transducer theory. These works consistently appear in premier venues like STACS, ICALP, LICS, and PODS, demonstrating her leadership in automata-theoretic approaches to system verification and formal language applications. Educational Leadership: Ph.D. advising: Soumodev Mal (ongoing, co-advised with Prakash Saivasan), Sahil Mhaskar (ongoing, co-advised with M. Praveen) Master's supervision: Kushal Prakash ("Unbounded Distributed Graph Automata", 2018), Adwitee Roy ("Graph Automata and Tree-Width", 2017) Short internships: Anupa Sunny (NFA learning, 2017), Rao Shrisha Shripathy (weighted automata learning, 2017), Nisarg Patel (finite state models, 2016) She maintains strong institutional ties through the Theoretical Computer Science Group at CMI and ReLaX (CNRS), driving collaborative research on formal verification and automata theory. Her work bridges theoretical foundations with practical applications in database-driven systems and distributed algorithms, supported by consistent conference participation and editorial service.

• Control Engineering
• Nonlinear dynamical systems
• Control of Unmanned vehicles
• +۳ مورد دیگر

Soumya Ranjan Sahoo is an Associate Professor in the Department of Electrical Engineering at the Indian Institute of Technology Kanpur. His academic career at IIT Kanpur began with a contract position as Assistant Professor in 2014, progressing to Assistant Professor in 2016, and currently holding the position of Associate Professor since December 2020. Prior to joining IIT Kanpur, he worked as a Scientist Fellow at the National Aerospace Laboratories in Bangalore. PhD in Systems and Control Engineering from IIT Bombay (2013) Thesis Title: Coordination problems with minimal sensing and coarse actuation Thesis Supervisors: Prof. Ravi N. Banavar and Dr. Arpita Sinha B.Tech in Electrical Engineering from University College of Engineering, Burla, Odisha (2008) Dr. Sahoo's research spans the complex intersection of control theory and practical engineering applications. His work primarily focuses on nonlinear dynamical systems, with significant contributions to the control of unmanned vehicles and coordinated control systems. His research has evolved to address modern power system challenges, particularly in the domain of AC and DC microgrids, where he has developed innovative control strategies for improved performance. His work on discontinuous systems demonstrates his ability to tackle mathematically challenging control problems with practical implications. Analysis of Dr. Sahoo's publication record reveals a clear evolution from fundamental control theory to applied research with significant practical impact. His early work focused on theoretical aspects of multi-agent systems and network control, which has progressively shifted toward power systems applications, particularly microgrids. The consistent theme across his publications is the development of robust control strategies that work effectively under realistic constraints such as communication delays, incomplete information, and system heterogeneity. His research bridges theoretical control concepts with practical engineering implementations, particularly in the domains of autonomous systems and modern power grids. Dr. Sahoo teaches several key courses in the Electrical Engineering curriculum including Introduction to Electrical Engineering, Control Systems Analysis, Basics of Modern Control Systems, Nonlinear Systems, Adaptive Control Theory, and advanced topics in Nonlinear Systems. His teaching portfolio reflects his deep expertise in control theory and its applications. His laboratory work, particularly through the DiSCo Lab (as referenced in his homepage), focuses on practical implementations of control algorithms for various applications including unmanned vehicle coordination and microgrid management. This laboratory work bridges the gap between theoretical control design and real-world implementation challenges.

Lei Buمشاهده پروفایل

استاد

• Software Verification
• Software Testing
• Software Analysis
• +۸ مورد دیگر

Lei Bu is a Professor and Vice Dean of the Software Institute at Nanjing University, China. He has been with Nanjing University since 2010, progressing from Assistant Professor to his current position. His academic career includes a visiting position at Microsoft Research Asia through their StarTrack Program from 2014-2015. Professor Bu received his B.Sc. and Ph.D. degrees in Computer Science from Nanjing University, with additional research experience at Carnegie Mellon University and University of Texas at Dallas during his doctoral studies. His academic journey shows steady progression through the ranks at his alma mater. Lei Bu's research primarily focuses on software verification, testing, and analysis, with particular expertise in model checking, bounded model checking, formal methods, and cyber-physical systems. His work spans theoretical foundations to practical applications in safety-critical systems. Recent publications demonstrate growing interest in integrating machine learning techniques with traditional formal methods, as seen in works like SpecGen that leverage large language models for program specification generation. His research outputs show a consistent focus on verification techniques for complex systems, particularly addressing challenges in hybrid systems, cyber-physical systems, and IoT applications. Professor Bu has developed several verification tools including BACH (Bounded Reachability Checker for Linear Hybrid Automata) and BRICK (Bounded Reachability Checker of Numerically-Intensive C Code), which have been used in international verification competitions. 2023: Zhongchuang Software Talent Award 2022: CCF-IEEE CS Young Computer Scientist Award 2020: The Outstanding Teachers of Computing in Higher Education Award Program 2019: NASAC Young Software Innovation Award 2016: Young Talent Development Program 2014: StarTrack Program Visiting Young Faculty 2007: Full Scholarship under the State Scholarship Fund Professor Bu serves as a Principal Investigator on multiple significant research projects funded by the Natural Science Foundation of China, including a Key Program grant (2023-2027) on dynamic adjustment-control-fault tolerance theory. He has also advised numerous students and taught courses including Formal Languages and Automata, Theoretical Foundation of Software Engineering, and Preliminary Introduction to the Theory of Computation. His laboratory work focuses on developing practical verification tools for industrial applications in cyber-physical and IoT systems.

• Control Theory
• Linear Systems
• Numerical Analysis
• +۳ مورد دیگر

Dr. Jens Jordan is a lecturer at the Institute of Mathematics, Faculty of Mathematics and Computer Science, University of Würzburg. His office is located in Building 40 (Mathematics East), Room 00.007, on the Hubland Nord campus. He teaches courses including "Introduction to Discrete Mathematics" and "Analysis in Several Variables (Foundations of Analysis 2)". Dr. Jordan's academic background includes: Dissertation: "Reachable Sets of Numerical Iteration Schemes: A System Semigroup Approach" (2008), University of Würzburg Diploma Thesis: "Spektralmengen nichtlinearer Operatoren und Lösbarkeit nichtlinearer Operatorengleichungen" (2000) Dr. Jordan's research spans several interconnected areas in mathematics and control theory. His work primarily focuses on the application of control theory to numerical analysis and linear systems. He has made significant contributions to understanding reachability and controllability of linear systems, particularly over finite fields. His research also explores the intersection of numerical methods with control theory, examining how iterative solution methods for linear systems can be optimized using control principles. Additionally, he investigates the application of algebraic geometry concepts, such as Grassmann manifolds, to control problems. Analysis of Dr. Jordan's publication record reveals a consistent focus on the intersection of control theory and numerical analysis. His work demonstrates a progression from theoretical foundations to practical applications, with particular emphasis on linear systems, reachability analysis, and numerical iteration schemes. The recurring themes across his publications include the application of system theory to solve problems in numerical mathematics, the exploration of geometric structures in control problems, and the development of novel approaches to classical numerical methods through the lens of control theory. Dr. Jordan advises students in the Department of Mathematics at the University of Würzburg. His teaching responsibilities include foundational courses in discrete mathematics and multivariable analysis. While specific grant information is not detailed in the available materials, his research collaborations with prominent scholars like Uwe Helmke, Gunther Dirr, and Julia Lieb suggest involvement in research projects that likely received institutional or external funding. Dr. Jordan is part of the research team at the Institute of Mathematics at the University of Würzburg, where he collaborates with colleagues on projects related to control theory, numerical analysis, and system theory. His work contributes to the institute's broader research efforts in applied mathematics and mathematical systems theory.

• Political Science
• Religious Regulation
• Political Theory
• +۳ مورد دیگر

Dr. Elina Sannehag is a Lecturer in the Governance Major at University College Freiburg, part of the University of Freiburg. She is currently on parental leave. Her academic background includes a PhD in Political Sciences from Heidelberg University (2007-2012) and a Master's from Uppsala University (2002-2007). She previously worked at the Department of Political Science at the University of Freiburg before joining UCF in 2015. Her research focuses on cross-country differences in religious regulation, particularly in authoritarian regimes, and previously explored family policy, fertility, and women's preferences in welfare states. She has over 1,000 hours of teaching experience, covering comparative politics, religion-politics relationships, demography, EU regions, and political theory. Her teaching emphasizes hands-on research and problem-based learning (PBL). Her publications span journals like Journal of Church and State and European Societies , addressing topics such as religious minority discrimination, work-life preferences, and policy determinants. She has no listed awards but maintains active research and teaching roles within the governance field. Elina’s professional activities include advising on governance curriculum design and contributing to interdisciplinary projects at UCF. She is reachable via email at elina.sannehag@ucf.uni-freiburg.de, with office hours requiring prior appointment.

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

Slawek Lasota is a Professor in the Automata Theory group at the Faculty of Mathematics, Informatics and Mechanics, University of Warsaw. His research focuses on automata theory, concurrency theory, and formal verification, with contributions to Petri nets, vector addition systems, and algorithmic verification. He teaches courses such as Languages, Automata and Computation, and Infinite Automata. Research Interests: Automata Theory, Concurrency Theory, Formal Verification, Algorithmic Verification, Petri Nets, Vector Addition Systems. Awards: LICS Distinguished Paper Award (2023), FOSSACS Best Paper Award (2021), STOC Best Paper Award (2019). Current Projects: Formal verification in data-enriched models, ERC project INFSYS participant. Community Roles: Member of LIPIcs Editorial Board, Jury of Ackermann Award, EATCS Council member. Lasota has advised numerous PhD students and contributed to over 150 publications. His work bridges theoretical foundations with practical verification challenges in concurrent systems.

James Worrellمشاهده پروفایل

استاد

• Logic in Computer Science
• Linear Dynamical Systems
• Automated Verification
• +۳ مورد دیگر

James Worrell is a Professor of Computer Science at the University of Oxford, affiliated with Green Templeton College. He holds a prestigious UKRI Fellowship (equivalent to an ERC Advanced Grant) and an EPSRC Established-Career Fellowship. His research focuses on logic in computer science, linear dynamical systems, and automated verification, with applications to formal methods and decision procedures. He has held leadership roles on program committees for major conferences including POPL, CONCUR, FoSSaCS, and ICALP. Notable invited talks include the CRM Workshop on Fluid Dynamics and the MOD23 Summer School in Formal Verification. He currently advises PhD students like Julian D’Costa and collaborates with postdocs Bertrand Teguia and Jakub Konieczny. His research investigates decidability questions in linear systems, recurrence sequences, and matrix semigroups. He has pioneered techniques combining o-minimal geometry, automata theory, and model checking to analyze dynamical systems. Recent work addresses transcendence properties of numerical sequences and robustness in machine learning models. Awards include ERC and UKRI funding recognitions. He teaches advanced courses on logic and proof, automata theory, and computational learning theory at Oxford, with lecture materials available online. His work bridges theoretical computer science with applications in safety-critical systems and formal verification.

Amrita Sureshمشاهده پروفایل

عضو هیئت علمی

• Formal Verification
• Automata Theory
• Temporal Logics
• +۴ مورد دیگر

Amrita Suresh is a Research Associate in the Department of Computer Science at the University of Oxford, working under Professor Nobuko Yoshida. She specializes in formal verification, focusing on communicating automata and session types. Previously, she completed her PhD at ENS Paris-Saclay under advisors Alain Finkel and Benedikt Bollig, with research on subclasses of communicating automata and decidability in verification. PhD in Computer Science (ENS Paris-Saclay) MSc in Computer Science (ENS Paris-Saclay) BE in Computer Science (BITS Pilani) Her research interests span formal verification, automata theory, temporal logics, and distributed systems. She has contributed to foundational work on input-bounded FIFO systems, synchronizability via Message Sequence Charts, and extensions of Well-Structured Transition Systems. Her publications highlight advancements in decidability of reachability problems and frameworks for synchronizability. Awards include the Best Teaser Talk Award at CONCUR’21 and Best Paper Award at CONCUR’20. Amrita has taught courses in Systems and Architecture, Programming I (undergraduate), and Tree Automata and Their Applications. She actively participates in academic events, including serving on program committees for conferences like ICE’22 and as Technical Chair for QONFEST’21. She is affiliated with Nobuko Yoshida’s research group and collaborates on theoretical computer science challenges, particularly in formal methods for distributed systems.

Oren Weimannمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Data Structures
• +۹ مورد دیگر

Oren Weimann is a Professor in the Department of Computer Science at the University of Haifa, Faculty of Natural Sciences. His research lies at the intersection of theoretical computer science, algorithm design, and data structures, with a strong focus on planar graphs, combinatorial pattern matching, and fine-grained complexity. He has published extensively in top-tier venues such as STOC, SODA, ICALP, PODC, and ESA. Education: Ph.D., Massachusetts Institute of Technology (MIT), 2005–2009. Advisor: Erik Demaine. Dissertation: "Accelerating Dynamic Programming" Postdoc, Weizmann Institute of Science, 2009–2011. Host: David Peleg M.Sc., University of Haifa, 2004–2005. Advisor: Gad Landau. Dissertation: "Using PQ trees for Comparative Genomics" B.A., Technion – Israel Institute of Technology, 1999–2002 Oren Weimann's research centers on the design and analysis of efficient algorithms, particularly for planar and structured graphs. His work explores fundamental problems such as shortest paths, distance oracles, fault tolerance, edit distance, and pattern matching. He investigates both upper and lower bounds, often pushing the limits of what is computationally feasible under fine-grained complexity assumptions. His contributions include optimal labeling schemes, compressed data structures, and breakthroughs in dynamic and distributed graph algorithms. His recent publications reveal a consistent trend in developing highly efficient algorithms for planar graphs, with a focus on distance computation, fault tolerance, and compression. Keywords across these works include planar graphs, dynamic programming, string matching, and conditional lower bounds, reflecting a deep integration of algorithmic techniques and complexity theory. He frequently collaborates with leading researchers such as Shay Mozes, Paweł Gawrychowski, and Philip Bille. Scientific Awards: Best Paper Award, CPM 2007 Best Paper Award, ICALP 2020 (mentioned in context of work) Oren Weimann has advised numerous PhD and Master’s students, including Yaseen Abd-Elhaleem, Nathan Wallheimer, Aviv Bar-natan, and Shon Feller, whose dissertations have led to publications in major conferences. He has also mentored several postdoctoral researchers such as Shay Golan, Itai Boneh, and Panagiotis Charalampopoulos. His work has been supported by competitive research grants, though specific grant titles are not listed in the text. He has served on the program committees of key conferences including SODA, ICALP, CPM, ESA, and SPIRE, demonstrating active leadership in the theoretical computer science community. He is associated with a vibrant research group focused on algorithms and data structures, likely involving collaboration with students and postdocs on projects related to graph algorithms, string processing, and complexity. While no formal lab name is mentioned, his collaborative output suggests a strong, productive research team at the University of Haifa.

• Formal Methods
• Concurrency Theory
• Coalgebra
• +۱۰ مورد دیگر

Ana Sokolova is a Full Professor in the Department of Computer Science at the University of Salzburg. Her research focuses on formal methods, concurrency theory, and coalgebra, with significant contributions to probabilistic systems and concurrent data structures. Department: Computational Systems Group, University of Salzburg Key Research Areas: Formal Methods, Concurrency Theory, Coalgebra, Probabilistic Systems Her work bridges theoretical and applied computer science, including memory management, real-time systems, and security. She has been actively involved in organizing international conferences and workshops, such as Dagstuhl Seminar 22492 , and served on program committees for venues like FoSSaCS, CAV, and CONCUR. Recent publications explore coalgebraic trace semantics, probabilistic anonymity, and concurrent data structures. She has supervised numerous PhD students, including Sebastian Arming and Clemens Brunner, and is recognized for her Elise Richter Fellowship.

Carlos Esteve Yagüeمشاهده پروفایل

پژوهشگر

• Nonlinear Parabolic PDEs
• Optimal Control Theory
• Hamilton-Jacobi Equations
• +۳ مورد دیگر

Carlos Esteve Yagüe is an Associated Researcher at the ERC Advanced Grant project DyCon under the Deusto Chair of Computational Mathematics, supervised by Prof. Enrique Zuazua. His research focuses on nonlinear parabolic PDEs, optimal control theory, Hamilton-Jacobi equations, and differential games applied to degenerate elliptic equations. Education: PhD in Applied Mathematics (2015-2019), Université Paris 13, France MSc in Fundamental Mathematics (2014-2015), Université Paris 13, France BSc in Mathematics (2010-2014), Universidad de Alicante, Spain Research Interests: Carlos investigates singularity formation in nonlinear parabolic equations, optimal control strategies for complex systems, and applications of Hamilton-Jacobi equations to degenerate elliptic problems. His work bridges theoretical analysis with numerical methods and practical control applications. Key Contributions: His publications explore reachable sets for Hamilton-Jacobi equations, multilevel harmonic modulation via optimal control, and the turnpike phenomenon in nonlinear systems. Recent work includes studies on differentiability properties of PDE solutions and inverse problems in Hamilton-Jacobi frameworks. Awards & Grants: Funded by the ERC Advanced Grant DyCon, his research is supported through collaborative projects with institutions like FAU and Universidad Autónoma de Madrid. Presentations: Carlos has presented on topics such as reversibility properties of Hamilton-Jacobi equations and touchdown localization in MEMS problems at conferences and universities including the University of Alicante and Universidad de Buenos Aires.

• Stochastic Optimal Control
• Hamilton-Jacobi-Bellman Equations
• Numerical Methods for Partial Differential Equations
• +۴ مورد دیگر

Athena Picarelli is a Full Professor at the Department of Economics at the University of Verona. She holds a PhD in Applied Mathematics from ENSTA ParisTech (2018) and completed postdoctoral fellowships at the University of Oxford (Nomura Fellowship) and Imperial College London (CFM Fellowship). Her research focuses on stochastic optimal control, Hamilton-Jacobi-Bellman equations, numerical methods for PDEs, and computational finance. She teaches courses on quantitative methods for business and economics at the undergraduate and graduate levels, as well as specialized modules on stochastic optimization and control in PhD programs. She serves on multiple institutional committees, including the PhD School Board and the QA Board of the PhD in Economics and Finance. Her academic leadership roles include coordinating the Collegio didattico for Economics and Finance programs. She is affiliated with research centers like CRIEP and CIDE, and her work includes contributions to the Verona Experimental Lab in Economics (VELE). Her research interests span control theory, numerical analysis, and financial applications of stochastic control, with a focus on robust optimization and computational methods. Her teaching responsibilities include modules such as 'Mathematics' for the Bachelor's in Economics and Business and 'Quantitative Methods for Business and Economics' for Master’s programs. She has been actively involved in academic governance, including membership in the Economics Department Council and the Research Advisory Board (RAB). Her institutional duties emphasize quality assurance and academic program development.