جستجوی استاد راهنمای دانشگاهی

Saras D. Sarasvathy is the Paul M. Hammaker Professor at the Darden Graduate School of Business, University of Virginia, where she is a member of the Strategy, Entrepreneurship and Ethics area. A leading researcher in entrepreneurship, she advises entrepreneurship programs globally across Europe, Asia, and Africa, while serving on boards of companies including Lending Tree (Nasdaq: TREE) and Upekkha, a SaaS accelerator in Bangalore, India. Her research focuses on the cognitive basis of high-performance entrepreneurship, particularly her groundbreaking work on effectuation theory. Sarasvathy's scholarship examines how expert entrepreneurs think and act under uncertainty, challenging traditional predictive approaches to business strategy. She has developed frameworks showing how entrepreneurs create markets and opportunities through action-oriented, non-predictive methods that leverage available means rather than predetermined goals. Sarasvathy's award-winning research has generated significant scholarly attention and practical applications worldwide. Her work has spawned over a hundred scholars involved in the effectuation research program, with publications available through www.effectuation.org. Her influential book Effectuation: Elements of Entrepreneurial Expertise and co-authored textbook Effectual Entrepreneurship (winner of the 2012 Axiom Business Book Awards Gold Medal) have shaped entrepreneurship education globally. Among her numerous accolades are the 2022 Global Award for Entrepreneurship Research (the highest recognition in the field), the Academy of Management's 2019 Foundational Work Award, and recognition as one of Fortune Small Business Magazine's top 18 entrepreneurship professors. She has received honorary doctorates from multiple universities in Europe and Asia and has been named a Visiting Professor at institutions worldwide. Before academia, Sarasvathy founded and ran five successful businesses across three countries. Her doctoral research at Carnegie Mellon University was supervised by Herbert Simon, the 1978 Nobel Laureate in Economics, with whom she collaborated to discover the essential elements of entrepreneurial know-how. She holds a B.Com. from the University of Bombay, India, and an MSIA and Ph.D. from Carnegie Mellon University.

• Entrepreneurship
• Effectuation
• Cognitive Basis of Entrepreneurship
• +۳ مورد دیگر

Mohsen Lesani is an Associate Professor in the Computer Science and Engineering Department at the University of California, Santa Cruz's Baskin School of Engineering. His research focuses on reliability and security of software systems, particularly concurrent and distributed systems, with recent emphasis on secure replicated systems and distributed machine learning. Dr. Lesani received his PhD from UCLA, MS in artificial intelligence from Sharif University of Technology, and BS in software engineering from University of Tehran. He was previously a postdoc at MIT. His educational background provides a strong foundation for his interdisciplinary research spanning programming languages, distributed systems, and security. His research interests center on creating reliable and secure distributed systems. Current projects include resilient and secure distributed systems, heterogeneous and reconfigurable secure distributed systems, automatic analysis and synthesis of replicated objects, verification of distributed systems, data analytics, secure exchange across blockchains, machine learning for performance models, domain-specific languages and type systems, and automatic fence insertion for concurrent systems. His work bridges theoretical foundations with practical implementations to address real-world challenges in distributed computing. Lesani's research has been recognized with several prestigious awards including the NSF CAREER award in 2020 and DARPA YFA award in 2022. His work has also received the SIGPLAN Research Highlight in 2019, a distinguished paper award at OOPSLA 2018, and a best paper award at ISSRE 2015. These accolades reflect the impact and quality of his contributions to the field. He actively mentors PhD students in the Safe and Secure Software (S3) lab, including Xiao Li, Eric Chan, Javad Saber-Latibari, and Tejas Mane. His research has been supported by multiple NSF grants, demonstrating sustained funding for his innovative work. Lesani serves on program committees for major conferences including POPL, PLDI, OOPSLA, and DISC, contributing to the academic community. Lesani leads the Safe and Secure Software (S3) lab at UC Santa Cruz, where his team works on cutting-edge research in distributed systems, programming languages, and security. The lab fosters a collaborative environment where theoretical insights are translated into practical systems that address real-world challenges in reliability and security of distributed applications.

• Reliability of software systems
• Security of software systems
• Concurrent systems
• +۱۲ مورد دیگر

Pavel Panchekha is an Assistant Professor in the School of Computing at the University of Utah, where he holds the Warnock Chair for Junior Faculty. His research spans programming languages, web browsers, and numerical analysis, with a focus on developing programming language techniques to address challenges across computer science. Dr. Panchekha received his educational training at prestigious institutions: PhD in Computer Science from the Paul G. Allen School for Computer Science and Engineering at the University of Washington, advised by Michael D. Ernst and Zachary Tatlock BS in Mathematics from MIT Panchekha's research program has two major thrusts. First, he works on web browser internals , with projects including fuzzing layout invalidation, multi-tenant garbage collection, and optimizing 2D graphics. He is also authoring a textbook on web browsers that informs much of this research. Second, he focuses on automatic numerical analysis , with projects such as automatic accuracy improvement, synthesis via term rewriting, scalable static accuracy analysis, and math library implementation. He leads the FPBench and Herbie projects, which are major deployments of his research. His scholarly output demonstrates consistent contributions across programming languages, verification, and numerical methods. Recent work shows a growing emphasis on bidirectional typing systems, layout invalidation in browsers, and robust floating-point error analysis. His publications reveal a trajectory from foundational work on floating-point accuracy (notably the Herbie tool that won a Distinguished Paper Award at PLDI 2015) toward more comprehensive systems for program synthesis, verification, and browser optimization. Panchekha has received significant recognition for his research contributions: NSF Fellowship ARCS Foundation Fellowship Adobe Research Fellowship Wissner-Slivka Foundation Fellowship 2015 PLDI Distinguished Paper Award for work on the Herbie numerical analysis and repair tool As an advisor, Panchekha mentors a substantial group of students across multiple levels. He currently advises six students: Marisa Kirisame (PhD), Bhargav Kulkarni (PhD), Yumeng He (PhD), Artem Yadrov (MS), Jesus Ponce (BS), and Jonas Regehr (BS). Previously, he has advised over twenty students including PhD candidates like Ian Briggs and numerous MS and BS students. His advising spans theoretical topics in programming languages and practical applications in web browsers and numerical computing. Panchekha leads research groups focused on programming languages applications to web browsers and numerical analysis. His work on the Herbie tool for floating-point accuracy improvement has become influential in the programming languages community, and his more recent work on browser internals is shaping how researchers understand and optimize modern web rendering engines. He is currently developing a textbook on web browsers that aims to synthesize knowledge about browser architecture and implementation.

• Programming Languages
• Program Synthesis
• Verification
• +۴ مورد دیگر

Aris T. Pagourtzis is a Professor of Computer Science at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA), where he also serves as the Head of the Computer Science Division. He is additionally a Lead Researcher at the Archimedes Research Center, Athena RC. His academic career includes positions at the University of Ioannina, the University of Liverpool, the ETH Zuerich, the University of Athens, and the Athens University of Economics and Business. Education: Diploma in Electrical Engineering (1989) and Ph.D. in Electrical and Computer Engineering (1999), both from the National Technical University of Athens Professor Pagourtzis's research spans multiple areas of theoretical computer science, with particular emphasis on computational complexity, graph algorithms, distributed algorithms, approximation algorithms, network algorithms, cryptography, and counting complexity. His work often bridges theoretical foundations with practical applications in network design, security protocols, and optimization problems. He has developed novel algorithms for problems ranging from community detection in networks to Byzantine fault-tolerant protocols and privacy-preserving voting systems. His recent publications show a continued focus on fundamental algorithmic problems while expanding into newer areas like temporal graph analysis, blockchain applications, and privacy-preserving technologies. There's a clear trend toward addressing real-world challenges through rigorous theoretical frameworks, particularly in distributed systems, secure computation, and optimization under constraints. Professor Pagourtzis has served on program and organizing committees for numerous theoretical computer science and cryptography conferences, co-chairing CIAC 2017 and FCT 2021. His research has received funding from diverse sources including US, UK, French, EU, and Greek national resources. He is actively involved in teaching both undergraduate and graduate courses at NTUA, including Algorithms and Complexity, Foundations of Computer Science, Computational Cryptography, and Network Algorithms and Complexity. He leads the Computation and Reasoning Laboratory (corelab) at NTUA, which focuses on theoretical computer science research.

• Computational Complexity
• Graph Algorithms
• Distributed Algorithms
• +۶ مورد دیگر

Todd Millstein is a Professor in the Computer Science Department at the University of California, Los Angeles (UCLA). He served as the Computer Science Department Chair from 2022-2025 and is also an Amazon Scholar. His research focuses on making software systems more reliable through programming languages techniques, with significant contributions to network verification and probabilistic programming. Millstein received his Ph.D. from the University of Washington Department of Computer Science, where he was a member of the Cecil group led by Craig Chambers. Prior to that, he completed his undergraduate studies at Brown University under the guidance of Paris Kanellakis and Pascal Van Hentenryck. Millstein's research spans several areas of programming languages and systems with a focus on reliability. He has made significant contributions to network verification, developing the Batfish network configuration analyzer which is now managed by Amazon Web Services and forms the basis of Oracle Cloud's Network Path Analyzer. His work has been recognized with the ACM SIGCOMM Networking Systems Award in 2025. He also works on interactive program verification through lemma synthesis and scalable reasoning methods for probabilistic programming languages. His research bridges programming languages theory with practical systems challenges, as highlighted in his SPLASH/OOPSLA 2024 keynote "Everything is a Program (even if it's not)". Millstein's recent publications demonstrate a consistent focus on verification and reliability across multiple domains. His work shows a progression from foundational programming language techniques to practical applications in networking and probabilistic systems. Key themes include data-driven approaches to program analysis, synthesis of verification artifacts, and applying programming languages techniques to non-traditional domains like network configuration. Millstein's scientific achievements have been recognized with numerous prestigious awards including an NSF CAREER Award, an ACM SIGPLAN Most Influential PLDI Paper Award, an ACM SIGCOMM Networking Systems Award, IEEE Micro Top Picks selection, best-paper awards from PLDI, OOPSLA, and SIGCOMM, a Microsoft Research Outstanding Collaborator Award, an Okawa Foundation Research Grant, an IBM Faculty Award, and a Facebook Research Award. He has also received both the Northrop Grumman Excellence in Teaching Award (for junior faculty) and the Eon Instrumentation Inc. Excellence in Teaching Award (for senior faculty) from UCLA Engineering. Millstein advises several Ph.D. students including Ana Brendel, Poorva Garg (co-advised with Guy Van den Broeck), Rajdeep Mondal (co-advised with George Varghese), and Rathin Singha (co-advised with George Varghese). His research has been supported by various grants including an NSF CAREER Award, Okawa Foundation Research Grant, IBM Faculty Award, and Facebook Research Award. He has also been a Co-Founder and Chief Scientist of Intentionet, which was later acquired by Amazon Web Services. Millstein is actively involved in the Batfish project, an open-source network configuration analyzer that has had significant practical impact. Batfish is now managed by AWS, powers Oracle Cloud's Network Path Analyzer, and is used by dozens of companies. His research group continues to work on network reliability, developing techniques for scalable BGP policy verification and behavioral testing of protocol implementations.

• Network Verification
• Programming Languages
• Probabilistic Programming
• +۳ مورد دیگر

Fei He is an Associate Professor at Tsinghua University's School of Software, where he leads the THUFV research lab focused on formal verification and program analysis. His research spans formal methods, automated reasoning, and program verification, with applications in concurrent systems, networking (P4 programs), and probabilistic systems. Education & Employment: PhD from Tsinghua University (2008) Visiting Scholar at Carnegie Mellon University (2010-2011) and Politecnico di Milano (2006-2007) Faculty positions at Tsinghua since 2008 (Assistant Professor 2008-2011, Associate Professor 2011-present) Research: He's developed innovative techniques in SMT solving for concurrency verification, termination analysis, and regression verification. His tools like Deagle have won gold medals at SV-COMP. Current work focuses on probabilistic program verification and network program analysis. Publications: His 80+ publications demonstrate consistent contributions across formal methods (PLDI, OOPSLA, ICSE), networking (NSDI, INFOCOM), and software engineering (TSE, TOSEM), with recent emphasis on data-driven verification and automated invariant inference. Awards: Gold Medals in SV-COMP ConcurrencySafety (2022, 2023, 2025) Best Paper Awards at PPoPP 2022 and SETTA 2022 Advising: Mentors 13 PhD/Master's students in THUFV lab, with graduates joining Huawei, MPI-SP, and research institutions. Secured multiple NSF China grants for trustworthy software research. Service: Associate Editor for Theory of Computing Systems, program committees for PLDI/ICSE/OOPSLA, and former Local Chair for ISSTA 2019.

• formal methods
• program analysis
• automated reasoning
• +۲ مورد دیگر

Brandon Lucia is a Full Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University's College of Engineering. He leads the abstract research group focusing on the intersection of computer architecture, systems, and programming languages. His work bridges theoretical foundations with practical implementations in energy-constrained environments. Lucia's research centers on intermittent computing systems and edge computing in extreme environments. His work on energy-harvesting systems has established fundamental principles for batteryless computing, while his orbital edge computing research pioneers computational intelligence for nanosatellite constellations. These research thrusts address critical challenges in reliability, efficiency, and programmability for systems operating under severe power constraints. His publication record shows a clear evolution from foundational work on intermittent computing models to sophisticated applications in space computing and edge intelligence. Recent publications demonstrate increasing integration of dataflow architectures with energy-harvesting constraints, particularly in satellite constellations where computational resources must be managed across distributed, power-constrained platforms operating in extreme environments. NSF CAREER Award (2017) IEEE TCCA Young Computer Architect Award (2019) Sloan Foundation Fellowship (2021) ASPLOS Best Paper Awards (2018, 2020) OOPSLA Distinguished Paper and Artifact Awards (2015) Lucia actively mentors numerous PhD students including Brad Denby, Zhuo Cheng, and Emily Ruppel, many of whom contribute significantly to his research program. His abstract research group maintains strong industry connections while pursuing fundamental advances in computing systems. The group has developed multiple open-source tools including Legerdemain for program analysis and MultiCacheSim for cache coherence simulation. His laboratory work spans from theoretical foundations of intermittent computing to practical implementations in space systems. Current projects include computational nanosatellite constellations, energy-minimal dataflow architectures, and secure edge computing systems that operate reliably despite frequent power failures.

• Intermittent Computing
• Energy-harvesting Systems
• Concurrency
• +۷ مورد دیگر

Nectarios Koziris is a Professor at the Department of Computer Science , National Technical University of Athens (NTUA) , and former Dean of the School of Electrical and Computer Engineering . His research focuses on Parallel and Distributed Systems , Computer Architecture , and Cloud Computing . Key Research Themes: Compiler-OS-Architecture Interaction, Datacenter Hyperconvergence, Sparse Matrix Optimization, Quantum Computing, FPGA Virtualization Leadership: Founder of ~okeanos (Europe's largest public Cloud IaaS), Co-founder of GFOSS , Member of IEEE Computer Society Greece, Advisor to Arrikto Inc. His work has led to over 180 publications with 5800+ citations (h-index 33) , including two Best Paper Awards (IPDPS 2001, CCGRID 2013) and Intel Recognition (2015). He has supervised 12 PhD students and participated in 15+ EU projects as coordinator or consortium partner. Scientific Leadership: Program Co-Chair for Europar 2012 , Organizer for IPDPS , ICPP , SC conferences, and active member in Cloud Computing Expert Groups for the European Commission.

• Parallel and Distributed Systems
• Computer Architecture
• Systems Software
• +۱۰ مورد دیگر

Nikos Giatrakos is an Assistant Professor at the School of Electronic & Computer Engineering, Technical University of Crete, and a core member of the Software Technology and Network Applications Lab (SoftNet) . His work bridges Big Data systems, IoT, and advanced analytics, with a focus on real-time processing and scalable architectures. Previously, he served as a postdoctoral researcher at the same laboratory. Education PhD in Computer Science, University of Piraeus (2012) Postgraduate Diploma in Information Systems, Athens University of Economics and Business (2008) BSc in Computer Science, University of Piraeus (2006) Research Focus : Nikos specializes in software architectures for Big Data streaming, including Distributed Big Data Processing , Federated Machine Learning , Cloud-to-Edge Data Management , and Approximate Query Processing . His work has also advanced Complex Event Processing and Outlier Detection in decentralized environments. Scientific Contributions : His research has led to the DAG* workflow optimizer for IoT, the SuBiTO framework for real-time neural learning, and the INFORE approach for cross-platform analytics. He received the Best System Demonstration Award at ACM CIKM 2020 for INforE. Academic Leadership : Nikos teaches Object-Oriented Programming, Data Science, and Distributed Systems. He has supervised numerous European and national grants as Principal Investigator and served on program committees for top-tier conferences like SIGMOD, VLDB, and DEBS.

• Big Data Management
• Internet of Things (IoT)
• Distributed Systems
• +۳ مورد دیگر

Emmanouil Zachariadis serves as an Associate Professor at the Department of Management Science and Technology (DMST) within the School of Business at Athens University of Economics and Business (AUEB). He specializes in operational research and computational optimization, focusing on transportation logistics, supply chain systems, and environmental impact minimization. Education : BSc in Chemical Engineering from National Technical University of Athens (NTUA) MSc in Computing Science from Imperial College London PhD in Chemical Engineering from NTUA His research integrates mathematical programming with optimization algorithms for operational challenges in transportation and production systems. He has published 26 articles in top-tier journals, accumulating over 1200 Scopus citations by June 2024. Recent scholarly trends emphasize vehicle routing problems with complex constraints (cross-docking, loading, time windows) and optimization methods for logistics sustainability. His work spans production-routing integration, emergency evacuation planning (EVITA project), and hybrid metaheuristics. Scientific Awards : Teaching excellence award for undergraduate course 'Optimization Methods in Management Science', Dept. of Management Science & Technology AUEB (2021-22) Teaching excellence awards for postgraduate course 'Large Scale Optimization', MSc in Business Analytics AUEB (2020-21, 2021-22, 2022-23) He has participated in European and National research projects, applying his expertise in supply chain optimization and sustainability. His teaching portfolio covers quantitative methods, operational research, and supply chain optimization at both undergraduate and postgraduate levels.

• Operational Research
• Computational Optimization
• Transportation Logistics
• +۳ مورد دیگر

Evaggelia Pitoura is a Professor in the Department of Computer Engineering and Informatics at the University of Ioannina, Greece, and a Lead Researcher at the Archimedes Research Unit, ATHENA Research Center. Her work spans data management, distributed systems, and mobile computing, with a strong focus on database personalization and diversity. Her research interests include data diversity, contextual preferences, XML data management, peer-to-peer systems, and mobile computing . She has pioneered work in result diversification, preference-aware querying, and distributed data indexing, publishing extensively in top venues such as PVLDB, ICDE, SIGMOD, and IEEE TPDS. The recent publications highlight a consistent trend in personalized, context-aware database systems , with emphasis on improving user experience through intelligent query processing, recommendation, and efficient data organization in distributed environments. Best Paper Award, SIGMOD 1999 Best Paper Award, PVLDB 2013 She has advised several PhD students, including Georgia Koloniari, Kostas Stefanidis, Marina Drosou, and Konstantinos Semertzidis, who now hold positions in academia and industry. She teaches courses in Databases and Information Retrieval and actively contributes to the academic community through program committee roles in major conferences like ICDE, VLDB, SIGMOD, and WWW. She leads the Distributed Management of Data Group , fostering innovation in scalable and intelligent data systems.

• Data Management
• Distributed Databases
• Database Systems
• +۷ مورد دیگر

John Paparrizos is an Assistant Professor of Computer Science and Engineering at The Ohio State University's College of Engineering, where he directs The DATUM Lab (Data Analytics, Understanding, Mining, and Management Lab). He maintains an adjunct affiliation with the School of Informatics at Aristotle University of Thessaloniki. His research spans databases, data science, machine learning, and artificial intelligence , with focus areas including: Time-series analysis (clustering, anomaly detection) Scalable data mining for structured/unstructured data Adaptive algorithms for resource-constrained environments Foundational technologies for data-intensive applications His work addresses real-world challenges across relational, time-series, multimedia, text, graph, web, and IoT data domains. Notable recognition includes: 2025 ACM SIGMOD Test-of-Time Award for k-Shape time-series clustering 2023 IEEE TCDE Rising Star Award ACM SIGMOD Research Highlight Award NetApp Faculty Award His research has been featured in New York Times (front page), Washington Post , Forbes , and adopted by Fortune 500 companies (Exelon, Nokia) and the European Space Agency. He actively serves on program committees for premier conferences including ACM SIGMOD, VLDB, IEEE ICDE, ACM SIGKDD, and NeurIPS. His open-source tools have exceeded 100,000 downloads and are integrated into academic curricula at Brown, Columbia, Purdue, and University of Chicago.

• Databases
• Data Science
• Machine Learning
• +۵ مورد دیگر

Ruzica Piskac is a Professor of Computer Science at Yale University, where she leads the Rigorous Software Engineering (ROSE) group. She has made significant contributions to the fields of software verification, security, automated reasoning, and code synthesis, focusing on improving software reliability and trustworthiness through formal techniques. Dr. Piskac received her PhD from the Swiss Federal Institute of Technology (EPFL) in 2011, where her dissertation won the Patrick Denantes Prize. Prior to joining Yale, she led an independent research group at the Max Planck Institute for Software Systems in Germany (2012-2013). Her research spans several key areas: symbolic execution for Haskell (G2), privacy-preserving formal methods (PPFM), functional reactive synthesis, verification of configuration files, and analysis of software updates. Her work consistently bridges theoretical formal methods with practical applications in real-world systems. Dr. Piskac's recent publications demonstrate a strong trend toward applying formal verification techniques to emerging challenges including large language models, quantum computing security, legal accountability of automated systems, and cyber-physical systems. Her research increasingly intersects with AI, cryptography, and legal domains while maintaining strong foundations in formal methods. Her scientific achievements have been recognized with numerous prestigious awards: Multiple Amazon Research Awards Yale University's Ackerman Award for Teaching and Mentoring Facebook Communications and Networking Award Microsoft Research Award for the Software Engineering Innovation Foundation (SEIF) Patrick Denantes Prize for her PhD dissertation Dr. Piskac has graduated five PhD students, four of whom have gone on to become assistant professors of computer science. She has served as Program Chair of the 37th International Conference on Computer Aided Verification and is on the Steering Committee of the Formal Methods in Computer-Aided Design conference. She leads the Rigorous Software Engineering (ROSE) group at Yale, which focuses on several key projects including: Symbolic Execution Engine for Haskell (G2) Privacy Preserving Formal Methods (PPFM) Functional Reactive Synthesis Verifications for Configuration Files Analysis of Software Updates and Configuration Files

• Software Verification
• Security and Applied Cryptography
• Automated Reasoning
• +۴ مورد دیگر

Steve Blackburn is a research scientist at Google DeepMind and professor of computer science at the Australian National University in the College of Engineering and Computer Science. His primary research focus is on programming language implementation, with expertise spanning memory management, virtual machines, and performance analysis. He has served in significant leadership roles including Associate Dean for Diversity and Inclusion (2016-2019) and as Program Chair for PLDI 2015 and General Chair for PLDI 2023. Blackburn's research interests center on making software run faster and more power-efficiently on modern hardware. His primary areas include microarchitectural support for managed languages, fast and efficient garbage collection, and the design and implementation of virtual machines. He maintains a strong interest in sound methodology and infrastructure for successful research innovation. His work bridges theoretical computer science with practical systems implementation, with particular focus on memory management frameworks and performance benchmarking. His publication record reveals a consistent focus on memory management systems, with recent work exploring garbage collection in modern contexts including CRuby, Julia, mobile devices, and memory-disaggregated datacenters. His research shows an evolution from foundational garbage collection algorithms toward practical implementations addressing real-world constraints in contemporary programming languages and hardware platforms. A notable trend is his increasing focus on quantifying and understanding the true costs of garbage collection in production environments. Fellow of the ACM Blackburn has supervised numerous doctoral students including Zhen He, John Zigman, Robin Garner, Ting Cao, and currently advises Wenyu Zhao, Zixian Cai, and others. He has also served on multiple program committees for major conferences including PLDI, ASPLOS, ISMM, and OOPSLA, demonstrating his significant contributions to the programming languages and systems research community. His service includes editorial roles for ACM Transactions on Programming Language Applications and Systems from 2017-2020. He leads two major research infrastructure projects: the MMTk memory management framework and the DaCapo benchmark suite, both of which have become foundational tools for researchers in programming languages and systems. These projects reflect his commitment to shared research infrastructure and reproducible methodology in systems research.

• Memory Management
• Garbage Collection
• Virtual Machine Design and Implementation
• +۷ مورد دیگر

Alastair F. Donaldson is a Professor in the Department of Computing at Imperial College London's Faculty of Engineering, where he leads the Multicore Programming Group. He also works as a Software Engineer at Google in the Android Graphics Team. Previously, he served as Director of GraphicsFuzz, an Imperial College spinout company acquired by Google in 2018. His research spans programming languages, compilers, verification, and testing, with a particular focus on randomized and fuzz testing techniques for compilers and program analyzers. Donaldson has developed several influential testing frameworks including GraphicsFuzz, RustSmith, and GrayC, which have significantly advanced compiler testing methodologies. Analysis of his recent publications reveals a strong trend toward practical applications of compiler testing techniques across diverse domains including GPU programming, verification-aware languages, and memory models. His work increasingly incorporates continuous integration practices and focuses on addressing real-world challenges in compiler development and verification. Donaldson maintains active involvement in the programming languages research community, serving on program committees for major conferences including PLDI, POPL, ASPLOS, and SPLASH. He has contributed significantly to advancing compiler testing methodologies and has mentored numerous researchers through PLMW (Programming Languages Mentoring Workshop). He leads the Multicore Programming Group at Imperial College London, which focuses on challenges in parallel and concurrent programming. His work bridges theoretical computer science with practical software engineering challenges, particularly in the areas of compiler correctness and verification.

• Programming Languages
• Compilers
• Verification
• +۲ مورد دیگر