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

Jérôme Lerouxمشاهده پروفایل

پژوهشگر

• Formal Verification
• Vector Addition Systems
• Petri Nets
• +۷ مورد دیگر

Jérôme Leroux is a Directeur de Recherche (DR CNRS) at the Laboratoire Bordelais de Recherche en Informatique (LaBRI) , affiliated with the University of Bordeaux , France. His research focuses on formal verification of infinite-state systems, vector addition systems, Presburger arithmetic, and acceleration techniques for symbolic computation. Key research themes include: Vector Addition Systems (VASS) and Petri Nets Automata-based representations for Presburger arithmetic Abstract interpretation and CEGAR frameworks Verification of asynchronous distributed systems His recent publications highlight work on acceleration techniques for convex binary relations, serialized digit automata, and regular acceleration methods for number decision diagrams. These contributions are implemented in tools like the Talence Presburger Arithmetic Suite (TAPAS) and the FAST tool for symbolic verification. Scientific awards include a Best Paper Award at TURING'100 . He has advised several Ph.D. students and postdoctoral researchers, including Alexander Heußner and Thibault Hilaire (current Ph.D. candidate). Leroux is actively involved in organizing conferences like MFCS'23 and serving on program committees for venues such as VMCAI'26 .

Matteo Sammartinoمشاهده پروفایل

مدرس ارشد

• Formal Methods
• Concurrency
• Distributed Systems
• +۳ مورد دیگر

Matteo Sammartino is a Senior Lecturer in Computer Science at Royal Holloway University of London, affiliated with the Centre for Programming Languages and Systems. He holds an honorary position at University College London, associated with the Programming Principles, Logic and Verification group. PhD in Computer Science, University of Pisa (2013) Postdoctoral research, Radboud University (2015) His research focuses on formal methods for real-world systems, particularly concurrent/distributed and infinite-state systems. Recently, he has integrated artificial intelligence into automated verification, aiming to solve complex modeling and verification challenges through AI-driven approaches. The paper accepted at CONCUR 2025 exemplifies his work on compositional verification techniques using active learning and alphabet refinement, aligning with his broader interests in formal methods and AI applications.

Piotr Hofmanمشاهده پروفایل

استادیار

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

Piotr Hofman is an Assistant Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics , University of Warsaw. His research focuses on theoretical computer science, particularly automata theory, formal verification, and computational complexity related to systems with infinite alphabets and data constraints. PhD in Computer Science (2014) from the University of Warsaw under Sławomir Lasota. Postdoc (2013-2014) at University of Bayreuth with Wim Martens. Postdoc (2014-2016) at LSV de Cachan with Stefan Göller. His work explores algorithmic problems in automata over infinite alphabets, including one-counter nets, Petri nets with data, and unambiguous vector addition systems (VASS). Key contributions include decidability results for bisimulation and simulation problems, complexity bounds for equivalence checking, and novel techniques for reachability and coverability analysis. Recent publications address orbit-finite linear equations, Parikh's theorem for infinite alphabets, and lower bounds for coverability in pushdown VAS. He has received grants like NCN UMO-2016/21/D/ST6/01368 for algebraic invariants in data nets. He supervises research projects and collaborates with institutions in Poland, France, and India. His teaching includes concurrency theory and software engineering courses.

Riccardo Molleمشاهده پروفایل

استاد

• Nonlinear Partial Differential Equations
• Elliptic Systems
• Mathematical Analysis
• +۲ مورد دیگر

Riccardo Molle is a Professor of Mathematical Analysis at the Department of Mathematics, University of Rome Tor Vergata, where he teaches Analysis 1 for Engineering students and Differential Equations for Mathematics degree students. With an extensive publication record spanning from 2013 to 2025, Professor Molle is an active researcher in the field of nonlinear partial differential equations. Professor Molle's research focuses on nonlinear Partial Differential Equations and systems of elliptic type, employing methods from nonlinear analysis including min-max methods, concentration-compactness, Lusternik-Schnirelmann category, degree theory, barycenter maps, and minimization methods. His specific interests include prescribed mass problems, Schrödinger-Poisson systems, Choquard equations, the Bahri-Lions conjecture, existence of infinitely many solutions for nonlinear Schrödinger equations, analysis of the Fučík spectrum, critical and supercritical nonlinearities in bounded and unbounded domains, and variational inequalities. Professor Molle's recent publications demonstrate a consistent research trajectory in nonlinear PDEs, with particular emphasis on elliptic equations with supercritical growth, normalized solutions for Schrödinger equations, and the existence of multiple solutions for various nonlinear systems. His work frequently appears in high-impact journals including Calculus of Variations and Partial Differential Equations, Journal of Differential Equations, and Proceedings of the Royal Society of Edinburgh. Professor Molle has maintained an active teaching schedule, offering Analysis 1 courses for Engineering students across multiple academic years (2019-2025), as well as specialized courses including Differential Equations for Mathematics students and PhD-level courses on nonlinear analysis and elliptic PDEs. His teaching philosophy emphasizes deep understanding of mathematical concepts rather than mere memorization, as reflected in his course materials which stress comprehension over rote learning.

Armine Gaginyanمشاهده پروفایل

پژوهشگر

• Linguistics
• Syntax
• Morphology
• +۳ مورد دیگر

Armine Gaginyan is a linguist affiliated with Yerevan State University's Department of Linguistics, specializing in grammatical theory and linguistic typology with particular focus on infinitive constructions. Her research contributes to our understanding of how infinitives function across different language systems. Her primary research interests include Linguistics , Syntax , Morphology , Grammar , Language Typology , and Comparative Linguistics . Her work examines the theoretical and functional properties of grammatical categories, with special attention to infinitive forms and their syntactic behavior. Her most significant publication is a 240-page dissertation on infinitive typology that analyzes infinitive constructions across languages, examining their semantic properties, syntactic behavior, and typological classification. This work demonstrates comprehensive research in theoretical linguistics with practical applications for understanding grammatical systems cross-linguistically. Based on her research focus, Dr. Gaginyan's work likely contributes to broader linguistic theory and may inform language teaching methodologies, though specific details about funding, grants, or collaborative projects are not available in the current documentation. Her research environment appears to be centered within the academic linguistics community at Yerevan State University, where she has contributed specialized knowledge on grammatical structures and linguistic typology.

Thomas McHughمشاهده پروفایل

استاد پژوهشی

• Neuroscience
• Memory research
• Hippocampus
• +۵ مورد دیگر

Thomas McHugh is a Team Director at the RIKEN Center for Brain Science in Wako, Japan, where he leads the Laboratory for Circuit and Behavioral Physiology. His research focuses on understanding the neural circuits that encode, consolidate, and recall memories, with particular emphasis on the hippocampus as a model system. Dr. McHugh received his B.A. in Molecular and Cell Biology from UC Berkeley and completed his Ph.D. in Biology at MIT, where he studied under Matt Wilson and Susumu Tonegawa. Dr. McHugh's research employs a multidisciplinary approach combining in vivo hippocampal electrophysiology, cutting-edge conditional genetics, and advanced imaging techniques to study memory circuits with high precision. His laboratory has made significant contributions to understanding the role of specific hippocampal subregions like CA2 in memory processing, demonstrating how these circuits dynamically route spatial information and consolidate memories. The lab's work has revealed how the hippocampal engram maps experience rather than just place, how CA2 plays a critical role in memory consolidation, and how hypothalamic inputs modulate hippocampal novelty processing. Analysis of Dr. McHugh's recent publications (2023-2024) shows continued innovation in neural circuit manipulation, signal processing in noisy brain environments, and the relationship between dentate neurogenesis and cognitive flexibility. His work spans from fundamental memory mechanisms to potential applications for understanding memory disorders. 32nd Kihara Memorial Foundation Academic Award (2024) Minister of Education, Culture, Sports, Science and Technology's Commendation (2025) Nakaakira Tsukahara Memorial Award, Brain Science Foundation (2019) NARSAD Young Investigator Award (2010) MIT School of Science Dean's Educational Advising Award (2005) MIT School of Science Infinite Mile Award (2002) Dr. McHugh advises a substantial research team including multiple PhD candidates, postdoctoral researchers, and technical staff. His laboratory at RIKEN provides training in advanced neuroscience techniques including electrophysiology, optogenetics, and behavioral analysis. The lab maintains active collaborations both within RIKEN and internationally, contributing to a vibrant research environment focused on cutting-edge memory research. The Laboratory for Circuit and Behavioral Physiology operates within RIKEN's Center for Brain Science, utilizing state-of-the-art facilities for in vivo recording, genetic manipulation, and behavioral analysis. The lab's research program bridges molecular, cellular, and systems neuroscience to address fundamental questions about how memories are formed and retrieved in the mammalian brain.

Thomas W. Repsمشاهده پروفایل

استاد

• Program Analysis
• Abstract Interpretation
• Model Checking
• +۴ مورد دیگر

Thomas W. Reps is the J. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus at the University of Wisconsin-Madison , where he has been a faculty member since 1985. He is also President of GrammaTech, Inc., and a co-founder of the company. Education: Ph.D. in Computer Science from Cornell University (1982), winner of the 1983 ACM Doctoral Dissertation Award. Reps’s research spans program analysis , abstract interpretation , model checking , and computer security . His recent work focuses on quantum computing verification , probabilistic program analysis , and symbolic methods for static analysis . His publications (over 225) include foundational contributions to program slicing (1988 paper with Horwitz and Binkley, cited >1,780 times), machine-code analysis (ETAPS Best-Paper Awards in 2004 and 2008), and programming environments (co-author of The Synthesizer Generator ). Key awards include the ACM SIGPLAN Programming Languages Achievement Award (2017) , Guggenheim and Packard Fellowships , and ACM Fellow (2005) . Students: Mentored award-winning graduates like Akash Lal (SIGPLAN Outstanding Dissertation) and Venkatesh Srinivasan (Outstanding Graduate Student Research Award).

Thomas Wiesمشاهده پروفایل

استاد

• Program Analysis
• Verification
• Automated Deduction
• +۴ مورد دیگر

Thomas Wies is a Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University, and Chair of the Computer Science Department. He is a member of the Analysis of Computer Systems Group and has a personal website. Affiliation: New York University Research Focus: Program Analysis, Verification, Automated Deduction, Concurrency Teaching: Principles of Programming Languages (undergraduate), Programming Languages (graduate), Rigorous Software Development Research Interests: His work centers on program analysis, verification of concurrent systems, automated deduction, and applications of separation logic. He develops tools like Raven, GRASShopper, and Sprout for verifying concurrent programs and search structures. Recent Articles (2025-2023): Focus on SMT-based verification, concurrent data structures, temporal safety effects, multiparty protocols, and separation logic extensions. These span conferences like OOPSLA, CAV, IEEE S&P, and TACAS. Scientific Awards: Best Paper at ISSRE 2019 Best Paper at ICFP 2014 Professional Activities: Organizer/Co-organizer of VerifyThis 2025, Program Chair roles in NETYS 2023, VMCAI 2022, and others. Active in PC roles for POPL, PLDI, CAV, and VMCAI. Students & Group: Advises PhD students including Elaine Li, Devora Chait-Roth, and Ekanshdeep Gupta. Group alumni include Kshitij Bansal, Siddharth Krishna, and Wei Wang.

Mohamed Faouzi Atigمشاهده پروفایل

استاد

• Formal Verification
• Concurrency
• Model Checking
• +۴ مورد دیگر

Mohamed Faouzi Atig is a Professor in Computer Systems at Uppsala University's Department of Information Technology since July 2021, following a progression from Assistant Professor (2014-2018) to Associate Professor (2018-2021). His academic career began with a post-doctoral position at Uppsala University (2010-2012) after earning his PhD from University of Paris Diderot-Paris 7 in 2010, followed by a docent degree (habilitation equivalent) from Uppsala University in 2017. His research focuses on formal verification of concurrent and infinite-state systems, with particular expertise in model checking , weak memory models (including x86-TSO, Release-Acquire), and automata theory applied to string constraints. His work bridges theoretical foundations with practical verification techniques for modern hardware and programming language semantics. Analysis of his publication record reveals a sustained focus on verification challenges in concurrent systems, evolving from foundational work on memory models (2015) to sophisticated techniques for string constraints (2017) and persistent memory (2024-2025). His research demonstrates consistent contributions to top venues like PLDI and POPL, with increasing complexity in handling real-world memory models while maintaining theoretical rigor. At Uppsala University, he has served on program committees for major conferences including POPL, VMCAI, and SPLASH, demonstrating active engagement with the programming languages research community.

Nate Fosterمشاهده پروفایل

استاد

• Programming Languages
• Networking
• Software-Defined Networking
• +۵ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University's Bowers Computing and Information Science college. He also serves as a Visiting Professor at EPFL's Data Center Systems Laboratory during the 2023-24 academic year and as a Visiting Researcher at Jane Street. His research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems, with particular emphasis on software-defined networking. Dr. Foster's educational background includes: PhD in Computer Science from the University of Pennsylvania MPhil in History and Philosophy of Science from Cambridge University BA in Computer Science from Williams College Nate Foster's research spans multiple areas within programming languages and systems. His current work focuses on the design and implementation of languages for programming software-defined networks. He has also made significant contributions to bidirectional languages (also known as "lenses"), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His interdisciplinary approach combines theoretical foundations with practical systems building, seeking to bridge the gap between formal methods and real-world network programming. An analysis of Foster's recent publications reveals a strong focus on network programming languages, particularly NetKAT and P4. His work consistently applies formal methods to networking problems, with increasing emphasis on verification, equivalence checking, and symbolic execution techniques. The research trajectory shows progression from foundational language design to practical verification tools, demonstrating how theoretical programming language concepts can solve real-world networking challenges. Dr. Foster has received numerous prestigious awards for his contributions: Sloan Research Fellowship NSF CAREER Award ACM SIGPLAN Robin Milner Young Researcher Award (2023) Most Influential POPL Paper Award Tien '72 Teaching Award Google Research Award Yahoo! Academic Career Enhancement Award Cornell Engineering Research Excellence Award Morris and Dorothy Rubinoff Award ACM SIGCOMM Rising Star Award As an active member of the programming languages community, Foster has advised numerous graduate students and secured significant research funding through his NSF CAREER award and Google Research Award. He has served in leadership roles for major conferences including PLDI, POPL, and ICFP, demonstrating his commitment to mentoring the next generation of researchers through programs like PLMW@PLDI. His collaborative approach is evident in his extensive co-authorship network across academia and industry. Foster leads research in the area of programming languages for networking, with particular focus on the NetKAT framework for network verification. His work bridges the gap between formal methods and practical networking systems, creating tools that have influenced both academic research and industry practice in software-defined networking. His collaborations with institutions like EPFL and industry partners like Jane Street demonstrate the real-world impact of his research agenda.

Denis Kuperbergمشاهده پروفایل

پژوهشگر

• automata theory
• synthesis
• verification
• +۶ مورد دیگر

Denis Kuperberg is a CNRS researcher at LIP (Laboratoire de l'Informatique du Parallélisme), ENS Lyon, where he is part of the Plume research team. His work bridges theoretical computer science with interdisciplinary applications, particularly in systems biology. His primary research interests include automata theory, synthesis, verification, games, logics, decidability procedures, complexity, and proof theory. Kuperberg's work often explores the connections between formal methods and practical applications, as evidenced by his recent interdisciplinary publications on thermodynamic consistency of autocatalytic cycles. His research demonstrates a strong focus on both theoretical foundations and practical implementations, with several software tools developed for research purposes. Kuperberg's publication record shows a clear evolution from purely theoretical work in automata and logic toward more interdisciplinary research. His recent papers (2022-2025) demonstrate increasing engagement with biological applications while maintaining strong theoretical foundations. Key themes across his publications include history-determinism in automata, cyclic proof systems, positive fragments of logic, and applications to verification problems. Best Paper Award at ICALP 2025 (with Thomas Colcombet and Amina Doumane) Kuperberg actively supervises multiple students at various levels, including PhD candidates (Iris Magniez–Papillon, Émile Hazard, Laureline Pinault), postdoctorates (Thomas Kosc, Marc Bagnol), and numerous interns. His teaching portfolio includes advanced courses on Graphs, Machines and Logics at ENS Lyon Master 2 program, Theory of Regular Languages at EPITA Lyon, and specialized topics like Mathematical Aspects of Automata Theory. He leads the development of research software including EmergeNS (for simulating chemical reaction networks and tracking autocatalytic dynamics), Stamina and Acme (for solving decision problems from automata theory), and Electrum (a specification language analyzer). These tools demonstrate his commitment to bridging theoretical computer science with practical implementations.

Andrzej Murawskiمشاهده پروفایل

استاد

• Programming Languages
• Automata Theory
• Software Verification
• +۹ مورد دیگر

Professor Andrzej Murawski is a Tutorial Fellow at Worcester College , affiliated with the University of Oxford Department of Computer Science . His research spans the semantics of programming languages , automata theory , and software verification , integrating game semantics and probabilistic computation for modeling complex systems. Education: D.Phil., University of Oxford (2001) His work addresses higher-order recursion , concurrent programs , and probabilistic verification , including differential privacy and machine learning applications. Recent publications focus on reachability analysis , contextual equivalence , and automata over infinite alphabets . Key activities include organizing SIGLOG (Vice-Chair), editing SIGLOG News , and serving on LICS , POPL , and CONCUR program committees. Awards include the POPL 2025 Distinguished Paper Award . Students : Current advisees include Benedict Bunting and Haoxuan Yin; past students include Fabian Zaiser and David Hopkins.

Lichun Liمشاهده پروفایل

دانشیار

• Game Theory
• Control Theory
• Security of Cyber-Human-Physical systems
• +۵ مورد دیگر

Lichun Li is an Associate Professor at the Department of Industrial & Manufacturing Engineering within the FAMU-FSU College of Engineering . Holding a Ph.D. in Electrical Engineering from the University of Notre Dame (2013), Dr. Li's career includes postdoctoral work at the University of Illinois at Urbana-Champaign (UIUC) and Georgia Institute of Technology under Prof. Langbort and Prof. Shamma, respectively. Research Interests: Game Theory : Focused on asymmetric and stochastic games with applications to security and control systems. Control Theory : Investigates event-triggered systems, Bayesian games, and resilient networked systems. Security of Cyber-Human-Physical Systems : Addresses threats from hackers, natural disasters, and adversarial actors through strategic modeling. Smart Manufacturing : Explores AI-driven robotic collaboration to enhance industrial efficiency. Networked Systems : Studies large-scale systems resilience and coordination mechanisms. Recent Publications highlight applications of game theory to cybersecurity, LTE network defense, and efficient control algorithms. Dr. Li's work bridges theoretical advancements with practical solutions for risk mitigation and system optimization. Contact : lichunli@eng.famu.fsu.edu

Kim Jongeriusمشاهده پروفایل

استاد

• Algebraic Geometry
• Commutative Ring Theory
• Mathematics and Literature
• +۲ مورد دیگر

Dr. Kim Jongerius serves as Professor of Mathematics and Department Chair at Northwestern College in Orange City, Iowa, where she approaches mathematics as both an art and language to foster effective communication. Her interdisciplinary background bridges mathematical rigor with humanities perspectives, earning her the 2005 Northwestern Teaching Excellence Award for creating supportive, laughter-filled classrooms that bring out students' best. Her academic credentials include: Ph.D. in Mathematics from Colorado State University M.S. in Mathematics from Colorado State University B.S. from Northern Arizona University with double majors in Mathematics and English, plus a German minor Research spans algebraic geometry and commutative ring theory, evolving into interdisciplinary explorations of mathematics through literary and theological lenses. She investigates how concepts like infinity and dimension intersect with philosophical frameworks, particularly through Christian perspectives, while maintaining core interests in mathematical communication and pedagogy. Publication trends reveal a trajectory from foundational algebraic geometry research (1990s) toward humanistic mathematics and education-focused scholarship (2020s). Recent works emphasize mathematical minds' development and interdisciplinary connections, while her 2011 book chapters for Mathematics Through the Eyes of Faith demonstrate enduring integration of faith and mathematical concepts. Professional recognition includes: Teaching Excellence Award, Northwestern College (2005) As Associate Editor for the Dolciani Exposition Series in Mathematics since 2000 and former ACMS president (2011-2013), she actively shapes mathematical discourse. Her mentorship extends beyond academics through personal engagement like hosting student dinners, reflecting her commitment to holistic student development within Northwestern's community-oriented environment.

Olivier Serreمشاهده پروفایل

استاد

• theoretical computer science
• automata theory
• formal languages
• +۷ مورد دیگر

Olivier Serre is a CNRS Research Director working at the Institute for Research in Fundamental Computer Science (IRIF), a joint research unit of CNRS and University of Paris. Since September 2021, he serves as Deputy Scientific Director at the Institute for Information Sciences and Technologies (INS2I) at CNRS. His research focuses on theoretical computer science with particular emphasis on automata theory and formal verification frameworks. Dr. Serre completed his education at ENS Cachan (1999-2003) and earned his PhD in Computer Science from Paris-Diderot University (now University of Paris) in 2004. Following a postdoctoral position at RWTH Aachen, he joined LIAFA (now IRIF) as a research fellow in 2005 and became a CNRS Research Director in 2016. His academic journey reflects deep engagement with foundational theoretical problems and their practical verification applications. His research centers on automata theory and formal languages, with particular expertise in games and logic, infinite structures, and verification of higher-order functional programs. Dr. Serre has made significant contributions to collapsible pushdown systems, recursion schemes, and parity games, bridging theoretical foundations with practical applications in program verification. His work demonstrates exceptional depth in developing decision procedures for complex verification problems previously considered intractable. Dr. Serre's extensive publication record in premier theoretical venues shows consistent contribution to advancing the state of the art. His research trajectory reveals a clear evolution from foundational automata theory toward increasingly sophisticated systems involving higher-order computation and imperfect information, with notable breakthroughs in establishing decidability results for complex verification problems.