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

Lia Schützeمشاهده پروفایل

پژوهشگر

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

Lia Schütze is a Researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany, with an office in Room 612, Building G 26. Her work falls under the institute's research domains including Algorithms, Theory & Logic, Programming Languages & Verification, Cyber-Physical Systems, and Security & Privacy. She maintains an active research profile with publications spanning theoretical foundations to applied verification systems. Her research program centers on formal verification of infinite-state computational models, with dual expertise in theoretical computer science and network performance analysis. Key contributions include: Advancing verification techniques for Vector Addition Systems with States (VASS) and reversal-bounded counter machines Developing novel approaches to unboundedness problems through amalgamation methods Establishing tighter bounds for coverability and reachability in computational models Applying network calculus to verify industrial control systems and stochastic network performance Investigating well-quasi-orderings and monotone descending chains for termination analysis Analysis of her 2017-2025 publications reveals a clear evolution from applied network calculus toward increasingly sophisticated theoretical verification frameworks. Her work consistently bridges abstract mathematical foundations with practical verification challenges, particularly in cyber-physical systems where theoretical guarantees meet real-world performance constraints. The recurring focus on improving computational bounds demonstrates her commitment to making verification techniques practically feasible. No scientific awards or fellowships are documented in the available information about Dr. Schütze's career. While specific doctoral advisees are not mentioned in the provided materials, her active publication record and institutional role at MPI-SWS suggest ongoing mentorship within research teams. Similarly, though no explicit grants are referenced, her sustained research output implies successful funding acquisition for projects in formal methods and verification. As a core researcher at MPI-SWS, Dr. Schütze contributes to one of Europe's premier computer science research environments. Her work intersects with multiple institute focus areas, particularly within the Algorithms and Theory group and Programming Languages and Verification initiatives. The collaborative structure of MPI-SWS enables her theoretical advances to directly impact practical verification tools and methodologies used across the software systems research community.

Tuyen Tranمشاهده پروفایل

استادیار

• Convex optimization
• Variational analysis
• DC programming
• +۳ مورد دیگر

Tuyen Tran is an Assistant Professor in the Department of Mathematics and Statistics at Loyola University Chicago. She holds a B.S. in Mathematics from Ho Chi Minh City University of Education (2014) and a Ph.D. in Mathematical Sciences from Portland State University (2020). Her research focuses on convex optimization, variational analysis, DC programming, hierarchical clustering, mixed integer programming, and multifacility location problems. She joined Loyola University Chicago in 2020. Education: B.S., Mathematics, Ho Chi Minh City University of Education, 2014 Ph.D., Mathematical Sciences, Portland State University, 2020 Dr. Tran's work bridges theoretical mathematics and applied optimization, with a strong emphasis on solving complex structural problems through advanced analytical frameworks. Her interests reflect a commitment to interdisciplinary applications in operations research and computational mathematics. No specific grants, awards, or advised students are listed in the provided profile. She is reachable at ttran18@luc.edu and located in BVM 608.

• Programming Languages
• Software Engineering
• Compiler Optimization
• +۵ مورد دیگر

Qirun Zhang is an Assistant Professor in the School of Computer Science at the Georgia Institute of Technology . He holds the Catherine M. and James E. Allchin Early Career academic title. His research focuses on programming languages , software engineering , and compiler optimization , with an emphasis on program analysis , static analysis , and formal methods . He received his Ph.D. in Computer Science and Engineering from The Chinese University of Hong Kong (2013) and a Bachelor's from Zhejiang University (2009). Research Interests include techniques for improving software reliability/security via program analysis and compiler optimization. His work leverages computational complexity, analytic combinatorics, graph theory, and formal languages. Notable contributions involve debug information validation , context-free language reachability , and compiler testing frameworks like Skeletal Program Enumeration (SPE) . Recent Work spans scalable cryptographic accelerator design, LLVM-based debug validation, and SMT solving optimizations. His papers often address algorithmic improvements for reachability problems and compiler correctness. Awards include the PLDI Distinguished Paper Award (2020) and Facebook Fellowship (2021). He serves on program committees for top venues like POPL, SAS, and PLDI, and chairs artifact evaluation committees (PLDI'25). Teaching includes courses on compilers (CS 4240), software analysis (CS 6340), and advanced program analysis (CS 8803). He mentors a research group with current Ph.D. students and MS/undergraduate researchers. Lab/Team focuses on rigorous compiler validation and program analysis tools. Open positions are available for Fall 2025.

• Theoretical Physics
• Quantum Field Theory
• High-Energy Physics
• +۳ مورد دیگر

Mateo Paulišić is a Researcher at the Faculty of Physics, University of Rijeka. His office is located in Ured O-S11, reachable via internal phone 584 639. His research focuses on theoretical physics, particularly in quantum field theory, higher-spin symmetries, and non-commutative geometry. He has published extensively on topics involving Moyal products, gauge models, and spacetime singularities. Paulišić's work explores advanced mathematical frameworks applied to fundamental physics problems, including particle content analysis in higher-spin theories and non-perturbative approaches to gravitational anomalies. His recent articles highlight innovations in gauging symmetries using non-commutative methods and the interplay between algebraic structures and physical phenomena. While no scientific awards are explicitly listed, his prolific publication record indicates significant contributions to theoretical physics. No advising or grant details are provided in the text. His research group likely engages with cutting-edge topics in mathematical physics, though specific lab affiliations are not mentioned. The full academic trajectory and educational background remain unspecified beyond his postdoctoral role.

Olga Tveretinaمشاهده پروفایل

پژوهشگر

• Hybrid Dynamical Systems
• Automated Theorem Proving
• Constraint Solving
• +۲ مورد دیگر

Dr. Olga Tveretina is a Researcher in the Biocomputation Research Group within the Department of Computer Science at University of Hertfordshire's School of Physics, Engineering & Computer Science. She earned her PhD in Computer Science from Eindhoven University of Technology and MSc in Applied Mathematics from University of Tartu. Postdoctoral research included positions at University College Cork, Radboud University Nijmegen, and Karlsruhe Institute of Technology. Tveretina's research investigates decidability and complexity in hybrid dynamical systems, automated theorem proving, and constraint satisfaction frameworks. Current projects analyze reachability problems in low-dimensional systems and automatic differentiation algorithms. Her teaching covers computational models, algorithms, programming (Python/C++), and mathematical foundations for AI/robotics, emphasizing conceptual rigor and practical implementation.

Pierre Gantyمشاهده پروفایل

استاد پژوهشی

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

Pierre Ganty is an Associate Research Professor at the IMDEA Software Institute , Madrid. He holds a joint PhD in Computer Science from the Université Libre de Bruxelles (Belgium) and the Università di Genova (Italy). His research focuses on algorithmic verification, automata theory, formal languages, and abstract interpretation. Affiliations: IMDEA Software Institute (since 2009) Education: PhD in Computer Science (2007, ULB/Genoa), Postdoc at UCLA (2007–2009) Research Interests: Verification of infinitely-state systems, automata theory, formal methods, abstract interpretation, and Petri nets. He develops tools like ωVPLInc and forklift for formal verification. Recent Work Trends: Focus on automata-based verification techniques, language inclusion problems, and applications in distributed systems. His recent papers address reachable simulations, hyperproperties for population protocols, and timed automata analysis. Awards: Marie Curie COFUND Fellowship (2010–2013), Ramon y Cajal grant (2018–2023) Advising and Grants: Supervised PhD students including Kyveli Doveri and Nicolas Manini. Active in conference organization (e.g., RP 2025 co-chair), and serves on program committees for LICS, CONCUR, and TACAS. Labs/Teams: Leads research on formal methods at IMDEA, collaborating on tools like MIST for counter system analysis.

Richard Mayrمشاهده پروفایل

استاد

• Game Theory
• Formal Verification
• Automata Theory
• +۵ مورد دیگر

Roles and Affiliations Richard Mayr is a Professor (Reader) in Computer Science at the University of Edinburgh, part of the School of Informatics and the Laboratory for Foundations of Computer Science (LFCS) . He has held academic positions in Germany, the US, and Sweden before joining Edinburgh in 2008. His research focuses on theoretical computer science, with a particular emphasis on formal verification, game theory, and automata theory. Education Diploma (Master) in Computer Science and Mathematics, TU Munich, Germany (1994) PhD in Computer Science, TU Munich (1998) Habilitation (Postdoctoral Thesis), University of Freiburg (2002) Research Interests His research spans game theory (e.g., strategy complexity in stochastic games), formal verification (e.g., model checking for infinite-state systems), automata theory , and logic . He explores algorithmic questions in these areas, including decidability, complexity, and practical tool development. Teaching and Advising Mayr teaches courses such as Algorithms and Data Structures and Computer Security . He has advised numerous PhD students, including Mohan Dantam (current) and Eric Munday (2019–2023). His group focuses on advancing theoretical foundations with applications to verification and decision processes. Contributions and Tools He develops tools for solving automata-theoretic problems, such as language inclusion and minimization. His work is published in top venues like ICALP , CONCUR , and LICS , with over 150 cited works. He actively participates in organizing international conferences and workshops.

Antonin Kuceraمشاهده پروفایل

استاد

• Stochastic Processes
• Probabilistic Systems
• Markov Decision Processes
• +۸ مورد دیگر

Antonin Kucera is a Professor at the Faculty of Informatics , Masaryk University, Czech Republic. His work focuses on stochastic processes, probabilistic systems, Markov decision processes, stochastic games, infinite-state systems, and applications of game theory in security and operational research. He has led multiple research projects funded by institutions like the US Army Research Office and the Czech Science Foundation. Research Interests : Stochastic processes, probabilistic verification, infinite-state systems, multi-objective optimization, game theory, and security applications. Projects : Leading studies on adversarial security patrolling, probabilistic systems analysis, and game-theoretic verification. Past projects include European Network for Game Theory (COST) and Institute for Theoretical Computer Science. Advising : Mentored 13 PhD/Master's students, including Tomáš Brázdil, Petr Novotný, and Jan Křetínský. Teaching : Courses on Petri Nets, Semantics of Programming Languages, and Mathematical Logic.

Luca Acetoمشاهده پروفایل

استاد

• Concurrency Theory
• Process Algebra
• Structural Operational Semantics
• +۳ مورد دیگر

Luca Aceto is a Full Professor at Reykjavik University's Department of Computer Science since 2004. He has held leadership roles, including President of the European Association for Theoretical Computer Science (2012–present) and Head of the Department of Computer Science at Reykjavik University (2007). His research focuses on concurrency theory, logic in computer science, and formal verification. Aceto has received notable awards, including the Reykjavik University Research Award (2012) and induction into the Icelandic Academy of Sciences (2012). Research Interests: Concurrency theory, process algebra, structural operational semantics, modal and temporal logics, and computational complexity of verification problems. Awards: Multiple teaching awards at Aalborg University, Distinguished Dissertation Award (1991), and leadership roles in prestigious academic organizations. Professional Activities: Over 60 program committee roles, co-chairing ICALP and CONCUR, and editorial board memberships. Aceto’s work bridges theoretical foundations with practical verification challenges, contributing to formal methods and concurrency theory. His publications span journals, conferences, and textbooks, including a widely adopted textbook on reactive systems.

William Petterssonمشاهده پروفایل

پژوهشگر

• Operations Research
• Integer Programming
• Graph Theory
• +۶ مورد دیگر

Dr. William Pettersson is a Researcher at the School of Computing Science, University of Glasgow, focusing on optimization and algorithmic research. He leads projects like the EPSRC-funded IP-MATCH initiative, addressing resource allocation challenges such as kidney exchange and student-doctor hospital placement systems. His work bridges theoretical contributions (e.g., integer programming, graph decomposition) and practical software development, including the Regina topology tool and kep_solver for kidney exchange analysis. Prior to Glasgow, he specialized in parallel algorithms and combinatorial topology in Australia. Key Projects: IP-MATCH (EPSRC), Regina software, kidney exchange optimization Research Themes: Combinatorial optimization, parameterized complexity, high performance computing Publications span graph theory, operations research, and algorithm design, with notable contributions to kidney exchange program modeling and spatial correlation analysis. Active collaboration with Prof. David Manlove and international teams in healthcare and computational topology.

Francesco Deangelisمشاهده پروفایل

پژوهشگر

• Numerical Analysis
• Partial Differential Equations
• Applied Mathematics
• +۳ مورد دیگر

Dr. Francesco Deangelis is a Researcher affiliated with the Institute for Analysis and Numerical Analysis at the University of Münster. He is part of the Department of Mathematics and Computer Science within the Faculty of Mathematics and Computer Science. His research interests center on numerical analysis, partial differential equations, and applied mathematics, with a focus on computational methods and mathematical modeling. Dr. Deangelis' work contributes to advancing numerical techniques for solving complex mathematical problems arising in science and engineering. He is reachable at his office room 120.009 via phone (+49 251 83-35056) or email. His research aligns with the broader goals of the institute in advancing analysis and numerical methods, though specific grants, awards, or recent publications are not detailed in the provided information.

Stacy Hoehnمشاهده پروفایل

استاد

• Mathematics
• Actuarial Science
• Mathematics Education

Stacy Hoehn, Ph.D., is a Professor of Mathematics at Franklin College. She joined the institution and has been actively involved in teaching and mentoring students in mathematics. Her professional focus emphasizes helping students develop problem-solving skills through rigorous academic engagement. She is reachable at shoehn@FranklinCollege.edu and is located in Old Main. Education: Ph.D. in Mathematics (specific institution/year not listed in text) Dr. Hoehn’s expertise includes preparing students for careers in actuarial science, as indicated by her responsiveness to student inquiries about actuarial pathways. She emphasizes hands-on learning and perseverance in mathematics education. Extracurricular activities for math and computing students are available but not detailed here. No specific scientific awards or grants are mentioned in the provided text. Her research interests and recent publications are not explicitly listed, though her role as a mathematics professor suggests engagement with pedagogical and disciplinary advancements.

• Logic
• Well Quasi Orders
• Verification
• +۶ مورد دیگر

Sylvain Schmitz is a Professor of Computer Science at Université Paris Cité, affiliated with the IRIF institute. He leads the Automata and Applications team and contributes to modeling and verification research. Key Research Areas: Logic, Well Quasi Orders, Program Verification, Formal Languages, Database Theory Grants: ANR BraVAS (2017–2022), ANR PRODAQ (2015–2019), ANR ReacHard (2011–2014), ANR AVeriSS (2007–2009) His work focuses on the algorithmic complexity of well-quasi-orders, with applications to vector addition systems, Petri nets, and complexity hierarchies. He has delivered lectures on Algorithmic Aspects of WQO Theory (MPRI), Model-Checking Finite Structures (LMFI), and logic for the agrégation preparation. Recent publications analyze complexity bounds for vector addition systems and lossy counter machines, often leveraging ideal decompositions of well-quasi-orders. His 2024 ICALP paper with Lia Schütze addresses strongly monotone descending chains over ℕᵈ, while 2024 LICS work with Anand et al. explores unboundedness verification. Scientific Awards: IUF junior fellowship (2018–2023) He supervises PhD students Hector Buffière (2024–present), Aliaume Lopez (2019–2023), Anthony Lick (2016–2019), and Simon Halfon (2015–2018). He has served on steering committees for STACS (co-chair) and GT-Verif, and organized conferences like Highlights 2014.

• Algorithmic Game Theory
• Stochastic Games
• Distributed Systems
• +۴ مورد دیگر

Hugo Gimbert is a CNRS Researcher at LaBRI (Laboratoire Bordelais de Recherche en Informatique), affiliated with the University of Bordeaux, where he serves as a PhD advisor and contributes to the Formal Methods research team. His work bridges theoretical computer science with practical applications in diverse domains. His research spans Algorithmic Game Theory, Stochastic Games, Distributed Systems, and Robotics, with current focus on stochastic games with partial observation, decidability of distributed games, and applications in precision agriculture. He explores intersections with social choice theory, probabilistic logics, and humanoid robot control using Markov Decision Processes. Publications from 2010-2017 reveal consistent contributions to game theory foundations (stochastic/mean-payoff/parity games), automata theory (decidability problems, stabilization monoids), and applied robotics (vineyard trellising systems). His work demonstrates a trajectory from pure theoretical results toward real-world implementations in agriculture and education systems. Gimbert actively mentors PhD candidates including Soumyajit Paul, Simon Mauras, and Edon Kelmendi. He leads critical national projects: serving as Chargé de mission for Parcoursup (France's centralized college admission platform) since 2018, developing its core algorithms with Claire Mathieu to handle quotas, housing constraints, and transparency requirements. He also co-founded the Rhoban System spin-off applying robotic control algorithms to precision agriculture. As a core member of the Rhoban robotics project, he develops real-time image processing systems for robot soccer competitions. His software contributions include Stamina (automata theory toolkit), Marmotte (CNRS committee management system), and BipBip (ROS-based weeding robot for vineyards), demonstrating commitment to translating research into tangible societal impact.

• Automata Theory
• Infinite-State Systems
• Theoretical Computer Science
• +۳ مورد دیگر

Wojciech Czerwiński is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on automata theory and infinite-state systems, particularly addressing reachability problems in Vector Addition Systems (VASS) and related models. ERC Starting Grant Principal Investigator (2021-present) Organizer of Infinite Automata Workshop (2024) Co-organizer of Friday Afternoon Seminar Former editor of Delta popular science magazine (2013-2022) His research has produced significant results in computational complexity for VASS reachability, earning Best Paper Awards at CONCUR 2019 and STACS 2017. Current work explores separability problems, unambiguous systems, and structural properties of infinite-state models through the INFSYS ERC project. Key scientific contributions include determining the Ackermann-completeness of VASS reachability and developing new techniques for universality in unambiguous register automata. He actively participates in community-building efforts through workshops and seminars.