Yizhou Zhang is an Assistant Professor in the Department of Computer Science at the University of Waterloo. He holds a PhD and MS from Cornell University (2019 and 2016) and a BS from Shanghai Jiao Tong University (2012). His research focuses on programming languages, including design, implementation, and theory, with emphasis on formal methods, compiler optimization, and probabilistic programming. Education: PhD, Cornell University, 2019 MS, Cornell University, 2016 BS, Shanghai Jiao Tong University, 2012 Research interests span programming language theory, compiler construction, and formal verification. His work explores topics like certified compilers, effect handlers, and probabilistic program analysis. Recent publications emphasize formal models for memoization, nested family polymorphism, and bidirectional control flow. His publications reflect contributions to probabilistic programming semantics, compiler optimization techniques, and type systems. No scientific awards are explicitly listed. Advising and grant details are not provided in the text. Zhang’s research often intersects with formal methods and practical compiler implementation challenges.
Joanna C. S. Santos is an Assistant Professor at the University of Notre Dame's Department of Computer Science and Engineering. She leads the Security and Software Engineering research lab (S²E) and focuses on Software Engineering, Security, and Program Analysis. Her work bridges empirical studies with practical tool development. PhD in Computing and Information Sciences (Rochester Institute of Technology) M.Sc. in Software Engineering (Rochester Institute of Technology) B.Sc. in Computer Engineering (Federal University of Sergipe) Her research spans Software Security (vulnerability detection, ReDoS), Code Generation (LLM evaluation, benchmarking), and Program Analysis (taint tracking, call graphs). Recent articles show a strong focus on LLM-generated code quality and quantum computing applications. Scientific Awards : 2023 - Distinguished Reviewer (ESEC/FSE) 2020 - Research Pitch Winner (JOBS @MICRO) 2017 - Best Paper (ICSA) 2014 - CAPES Scholarship 2013 - ERBASE 3rd Place She actively contributes to conference committees (OOPSLA, ICSE, SCAM) and collaborates across institutions. Her lab S²E drives research in secure software development and empirical cybersecurity validation.
John Regehr is a Professor at the School of Computing, University of Utah, specializing in compilers, software testing, and formal verification. His research develops tools to improve software correctness and efficiency, including Csmith (random C program generator) and C-Reduce (test-case reducer). His group focuses on compiler validation, fuzzing techniques, and superoptimization, primarily targeting the LLVM infrastructure. Research interests span compilers, testing methodologies, formal verification, embedded systems, and program analysis. Recent work emphasizes practical tools backed by formal methods to detect and prevent software errors. Publications demonstrate strong trends in compiler verification and testing, with consistent focus on LLVM optimization correctness, translation validation, and automated bug detection through fuzzing and synthesis techniques. Scientific awards include: PLDI 2015 Distinguished Paper Award ICST 2014 Best Paper Award ACM SIGSOFT Distinguished Paper Award Leads a research group developing tools like Souper (superoptimizer) and Alive2 (translation validator). Maintains active academic service through program committees (PLDI, CGO, OOPSLA) and contributes to open-source compiler infrastructure.
Heather Miller is a tenure-track Assistant Professor in the Software and Societal Systems Department within Carnegie Mellon University's School of Computer Science. Her academic journey includes prior roles as an Assistant Clinical Professor at Northeastern University's College of Computer and Information Science and as Executive Director of the Scala Center at EPFL. Miller's research centers on distributed and concurrent computation through the lens of programming languages, with particular emphasis on data-centric systems, big data processing, and edge computing. A defining theme throughout her work is composability - enabling construction of complex distributed systems through composition of components that are correct by construction. Her projects span distributable closures, flexible serialization techniques, futures and promises for asynchronous programming, and deterministic concurrent dataflow models. Her recent publications demonstrate strong trends in applying programming language theory to practical distributed systems challenges, with increasing focus on WebAssembly instrumentation, microservice resilience, and language model pipelines. This evolution reflects her commitment to bridging theoretical foundations with real-world system requirements. Dahl-Nygaard Junior Prize (2023) Mentorship forms a significant component of Miller's academic work. She actively supervises multiple PhD, MS, and undergraduate researchers at CMU, including Christopher Meiklejohn, Matthew Weidner, Huairui Qui, Ria Pradeep, and Luke Dramko. Her service contributions span numerous top-tier conferences including PLDI, SPLASH, ECOOP, and ICSE where she has served as committee member, chair, and keynote speaker. Miller co-founded the Curry On conference to foster industry-academia dialogue, hosting successful editions in Prague, Rome, Barcelona, Amsterdam, and London. She leads research groups focused on distributed programming models and maintains strong industry connections through Two Sigma, where she holds an affiliation. Her work consistently emphasizes practical open-source implementations, primarily within the Scala ecosystem where she's been a core contributor since 2011.
Professor Massimiliano Gubinelli is the Wallis Professor of Mathematics at the University of Oxford and a Professorial Fellow at St. Anne's College. He leads the Stochastic Analysis Group within the Mathematical Institute, where his research focuses on stochastic analysis, constructive quantum field theory, and the intersection of probability theory with partial differential equations (PDEs) and renormalization group methods. His work spans statistical mechanics of multiscale systems, analysis of PDEs with random terms, homogenisation theory, mathematical quantum mechanics, path-integral formalisms, and non-commutative probability/geometry. He has pioneered paracontrolled distribution techniques to study singular stochastic PDEs and explored rough paths in ramification and transport equations. Recent publications highlight advancements in the sine-Gordon model via stochastic quantization, nonlinear PDEs with modulated dispersion, and ρ-irregularity in stochastic systems. His research bridges stochastic analysis, quantum field theory, and PDEs, emphasizing pathwise behavior and renormalization. Scientific Awards Junior member of the Institut Universitaire de France (2013–2018) Invited session speaker at the 2018 International Congress of Mathematicians (ICM) in Rio He contributes to scientific software development as a lead developer of TeXmacs , an open-source platform for technical documents, and teaches courses such as C8.1 Stochastic Differential Equations (MT22). No formal student advisement or grant details are provided.
L. Thomas van Binsbergen is a Professor in the Department of Computer Science & Computer Engineering at the University of Wisconsin-La Crosse, affiliated with the College of Science & Health. His work focuses on language design, formal methods, and policy-based systems. His research explores Executable formal specifications of programming languages Modular meta-language frameworks (e.g., iCoLa+, eFLINT) Data-dependent grammars for network protocols Purpose-based access control derived from GDPR Functional parsing algorithms (GLL, Happy-GLL) Policy enforcement in distributed systems Recent publications (2020-2025) demonstrate trends in language parametric design, security policy formalization, and exploratory programming environments. Notable collaborations include Damian Frölich, Tim Müller, and Tom M. van Engers. Van Binsbergen earned his PhD from Royal Holloway, University of London (2019) and contributes to conferences like GPCE, SLE, and workshops on programming language theory and data security.
Ondřej Bojar is an Associate Professor at the Institute of Formal and Applied Linguistics (UFAL), part of the Faculty of Mathematics and Physics at Charles University in Prague . He actively engages in research and teaching, with a focus on machine translation and computational linguistics. His work spans both theoretical and applied domains, involving collaborations with industry and academia.
Ramavarapu S Sreenivas is a Professor in the Industrial and Enterprise Systems Engineering department at the University of Illinois at Urbana-Champaign , with research appointments at the Coordinated Science Laboratory (CSL) and the Information Trust Institute (ITI ). He holds a joint affiliation with the Electrical and Computer Engineering department and serves as the Arthur Davis Faculty Scholar since 2016. Ph.D. , Electrical and Computer Engineering, Carnegie Mellon University (1990) M.S.E.E. , Carnegie Mellon University (1987) B.Tech , Electrical Engineering, Indian Institute of Technology Madras (1985) His research focuses on Discrete-Event/Discrete-State (DEDS) systems , applying Coding Theory, Machine Learning, and Information Theory to develop near-optimal supervisory policies for applications in wireless networks, automated manufacturing, and healthcare systems . He leads the Center for Autonomous Construction and Manufacturing at Scale (CACMS) , established in 2023. Recent publications highlight advancements in liveness enforcement in Petri nets , fault-tolerant control , and IoT-based load scheduling . His work bridges theoretical rigor with practical implementations in Distributed Control, Network Coding , and Reinforcement Learning . UIUC Campus Award for Excellence in Graduate and Professional Teaching (2023) Arthur Davis Faculty Scholar (2016) Senior Member, IEEE (2002) James Franklin Sharp Outstanding Teaching Award in Industrial Engineering (2017, 2012) Sreenivas has taught graduate and undergraduate courses in Control Systems, Integer Programming, and Financial Computing since 1992. He co-instructed courses in Health Technology and contributed to the Master of Science in Financial Engineering (MSFE) program, which ranks 4th nationally.
Professor Sophia Drossopoulou is a Professor of Programming Languages in the Department of Computing at Imperial College London, part of the Faculty of Engineering. Her affiliations include the Centre for Cryptocurrency Research and Engineering and the Sound Programming Languages research group. She holds a visiting researcher position at Microsoft Research (UK) from May 2019 to May 2020. Her research focuses on foundational programming language design and formal methods, emphasizing concurrency, type systems, and program verification. Key areas include concurrent program reasoning (e.g., TaDA framework), memory management (reference capabilities, garbage collection), and secure systems (smart contracts, cyber-physical systems). She explores practical language extensions for performance optimization (e.g., cache locality) while maintaining safety guarantees through formal verification techniques. Her work spans theoretical contributions (formal semantics, logical frameworks) and applied systems (compilers, runtime verification tools like Zeno). Recent trends show strong engagement with actor-based models (Pony language), digital twins, and cybersecurity challenges in modern software systems. Awards and recognitions are not explicitly listed in the provided text, but her extensive publication record in top venues (ECOOP, POPL, TOPLAS) indicates academic impact. Her advising focuses on graduate students in systems programming and formal methods, though specific student names are not mentioned here. Labs and collaborations involve the Sound Programming Languages group at Imperial College, emphasizing interdisciplinary work between formal methods and practical language implementation. Current projects include improving concurrency semantics and verifying complex systems through compositional reasoning techniques.
Professor Anne Remke leads the safety-critical systems group at the Faculty of Mathematics and Computer Science at Westfälische Wilhelms-Universität Münster since October 2014. She is also affiliated with the Design and Analysis of Communication Systems group at the University of Twente, where she served as assistant professor from June 2010 and became associate professor in March 2016. Her research focuses on dependability and security in critical infrastructures, particularly electrical power systems and telecommunication networks. Her educational background includes a PhD (2008) and MSc (2004) in Computer Science from the University of Twente and RWTH Aachen respectively. Her doctoral research focused on 'Model Checking Structured Infinite Markov Chains,' for which she publicly defended her thesis in June 2008. Professor Remke's research interests center on cyber-physical systems, with particular focus on evaluation of charging strategies for local energy storage in smart homes and security of control networks (SCADA) in smart grids. Her work bridges theoretical model checking techniques with practical applications in critical infrastructure protection. She has made significant contributions to the analysis of hybrid Petri nets, stochastic models, and the development of tools for dependability evaluation. Her recent publications demonstrate a strong trend toward integrating machine learning with formal verification methods for cyber-physical systems. The research spans stochastic hybrid systems, reachability analysis, and security evaluation of smart grid infrastructures, showing consistent growth in both theoretical foundations and practical applications of dependability analysis. Veni award from Dutch Science foundation (NWO) for 'Counting on a reliable water supply' GI/ITG MMB prize for best diploma thesis in computer and communication systems Best Paper Award at Valuetools 2023 conference Best Repeatability and Artifact Evaluation Award at QEST21 Teaching award from Fachschaft FB10 (2019) Professor Remke has successfully secured multiple research grants including the DFG project 'RealyST: Reachability Analysis for Stochastic Hybrid Systems' in collaboration with RWTH Aachen. She has supervised numerous students including Katharina Sichma, Pauline Blohm, Joanna Delicaris, Verena Menzel, Mathis Niehage, Jonas Stübbe, and Lisa Willemsen. Her research group actively participates in international collaborations and standardization efforts in critical infrastructure security. The safety-critical systems group maintains several research tools including HYPEG (for simulation and analysis of hybrid Petri nets), TimeNET (a GUI for modeling hybrid Petri nets), and a Smart Neighbourhood Simulation Tool for community energy storage and trading. These tools support their research in modeling and evaluating complex critical infrastructures through both analytical methods and simulation techniques.
Joanna Cecilia da Silva Santos is an Assistant Professor in the Department of Computer Science and Engineering at the University of Notre Dame , where she leads the Security and Software Engineering research lab (S 2 E) . She earned her Ph.D. and M.Sc. in Computing and Information Sciences from Rochester Institute of Technology (RIT) and a B.Sc. in Computer Engineering from Federal University of Sergipe (UFS) . Research Interests: Her work focuses on the intersection of Software Engineering and Software Security , with specific emphasis on Code Generation , Program Analysis , Software Architecture , and Quantum Software Engineering . Recent projects include evaluating large language models for code generation, detecting regular expression denial-of-service vulnerabilities, and creating taint-based analysis tools for Java security. 2025: Code generation benchmarks, LLM performance in programming assignments 2024: Frameworks for secure code generation, ReDoS analysis, static analysis of deserialization 2023: GitHub Copilot complexity prediction, vulnerability characterization 2022: Transformer-based code smell detection, security evaluation datasets Scientific Awards: 2017 Best Paper Award at ICSA 2020 JOBS Workshop Research Pitch Competition Winner 2023 Distinguished Reviewer at ESEC/FSE 2014 CAPES Scholarship for Masters at RIT 2013 3rd Place Paper at XIII ERBASE Her research group engages in empirical studies of code vulnerabilities, automated security tools, and educational applications of language models, with funding reflected in multiple peer-reviewed publications.
Karl Palmskog is a Lecturer at KTH Royal Institute of Technology in the Division of Theoretical Computer Science and the STEP research group. His work focuses on program verification and proof engineering, with particular emphasis on developing techniques and tools based on proof assistants for constructing functionally correct and secure software systems. Palmskog received his Ph.D. in Computer Science in 2014 from KTH, advised by Mads Dam, and his M.Sc. in Computer Science and Engineering from KTH in 2007. Prior to his current position, he was a postdoc at The University of Texas at Austin and University of Illinois at Urbana-Champaign. His research interests span programming languages, software engineering, and formal verification, with a particular focus on developing techniques and tools based on proof assistants. He is an avid user of the Coq proof assistant for both proving and programming, often complemented by OCaml, and also utilizes HOL4 and other ML family dialects. His work bridges theoretical foundations with practical applications, particularly in the domains of blockchain systems, distributed systems, and automotive software verification. Analysis of his recent publications reveals a strong focus on Coq-based verification, with significant contributions to proof engineering tools and methodologies. His work includes developing tools for regression proving, change impact analysis, mutation testing for Coq projects, and lemma name suggestion using deep learning. There's also a growing trend toward applying formal methods to real-world systems like blockchain protocols and automotive software. Palmskog has been involved in several research projects, including Coq-community Proof Engineering and Distributed Components. His past projects include Trustfull (SSF), Model-based Event Driven Scalable Programming for the Mobile Cloud (NSF), Highly Adaptable and Trustworthy Software (EU FP7), and 4WARD Future Internet (EU FP7). As an educator, Palmskog has served as examiner, course responsible, teacher, and assistant for various courses including Algorithms, Data Structures and Complexity; Degree Projects; Game Theory; Parallel and Distributed Computing; and Programming Paradigms. His work on Chip, a Coq formalization of change impact analysis, demonstrates his commitment to creating practical, certified tools that bridge formal methods with software engineering practice.
Rui Zhang is an Assistant Professor in Computer Science and Engineering , with research expertise spanning Natural Language Processing , Large Language Models , and Semantic Parsing . His recent work focuses on enhancing multimodal consistency , fairness in summarization , and mathematical reasoning capabilities of LLMs. Key Research Themes: Text-to-SQL and cross-domain semantic parsing Multimodal learning (vision-language models) Fairness and bias mitigation in NLP tasks Efficient model training and prompt optimization Scientific Awards: National Science Foundation CAREER Award (2024) Grants & Projects: CAREER: Trustworthy Human-Centered Summarization (NSF, 2024-2029) addressing LLM trustworthiness through user-centric summarization frameworks. Article Trends: Recent publications emphasize LLM collaboration , compressed reasoning models , and cross-domain knowledge alignment . He explores multi-agent systems , mathematical reasoning , and vision-language limitations , particularly in geometric perception. Applications span bioinformatics (Alzheimer's biomarker discovery) and democratic AI frameworks.
Gérard Berry (born December 25, 1948) is a distinguished French computer scientist currently serving as Professor at the Collège de France, holding the permanent chair Algorithmes, machines et langages (Algorithms, Machines, and Languages) since 2012. He previously held the Informatique et sciences numériques chair (2009-2010) and the Technological Innovation Liliane Bettencourt chair (2007-2008) at the same institution. Before joining Collège de France full-time, he served as Director of Research at INRIA Sophia Antipolis (2009-2012) and at École des Mines de Paris (1977-2001). His research spans over 30 years in three main fields: lambda calculus and functional programming, parallel and real-time programming languages, and design automation for synchronous digital circuits. He is particularly renowned for developing the Esterel programming language. His work bridges theoretical computer science with practical industrial applications. Berry's research has evolved to include current work in Hop and HipHop for Web programming, formal verification of compilers, and languages for computer music. His publications demonstrate consistent contributions to programming language theory, formal methods, and their applications in hardware and software systems. Gold Medal of CNRS (2014) Chevalier de l'Ordre de la Légion d'Honneur (2012) Member of French Academy of Sciences (2002) Member of Academia Europaea (1993) Monpetit Prize of Académie des sciences (1990) Berry has advised 17 PhD students and reviewed numerous theses. His industrial experience includes serving as Chief Scientist Officer of Esterel Technologies (2000-2009), where he directed the implementation of the Esterel v7 compiler. He has also held significant leadership roles including President of the Scientific Council of IRCAM and membership on the Scientific Council of the National Education. His teaching at Collège de France has covered topics ranging from the foundations of computation to the societal impact of digital technology, with courses including The Informatics of Time and Events and Proving Programs: Why? When? How? His laboratory work has focused on developing practical applications of theoretical computer science concepts.
Alvin Cheung is an Associate Professor in the Computer Science Division at UC Berkeley's EECS department. He is affiliated with the Data Systems and Foundations group, Programming Systems group, Sky Lab, and SLICE Lab, and serves as a faculty affiliate at the Berkeley Institute for Data Science. He advises the Data Science Discovery Program and provides technical guidance to industry partners. His research spans data management, programming languages, and scalable software systems, with emphasis on helping users process large datasets efficiently. Key innovations include verified lifting (applying formal methods and ML to infer program properties) and systems for optimizing database-backed applications and geospatial analytics. Recent work explores LLM-driven code optimization and transpilation techniques. His publications (2023-2025) show strong trends in ML-enhanced systems, verified compilation, and data management tools. Articles frequently integrate formal methods, program synthesis, and hardware-aware optimizations across domains like databases, distributed computing, and HCI. Scientific Awards: ACSIC Rock Star Award (2025) Dahl-Nygaard Junior Prize (2024) VLDB Early Career Research Contribution Award (2023) IEEE TCDE Rising Star Award (2020) Sloan Fellowship (2019) NSF CAREER Award (2017) 20+ additional honors Advising & Grants: He mentors PhD/MS students (e.g., Lily Liu at OpenAI, Chenglong Wang at Microsoft Research). Research is funded by: NSF DOE ONR ARO Intel Notable grants include ONR Young Investigator Award and ARO Early Career Program Award. Labs & Teams: Leads projects in Berkeley's Data Systems/Programming Systems groups and collaborates with Sky Lab/SLICE Lab. Manages labs focused on verified compilation (e.g., Tenspiler) and data infrastructure (e.g., Spatialyze).
