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

Tushar Krishna is an Associate Professor in the School of Electrical and Computer Engineering at Georgia Institute of Technology, with a courtesy appointment in the School of Computer Science. He earned his PhD in Electrical Engineering and Computer Science from MIT in 2014, an MSE in Electrical Engineering from Princeton University in 2009, and a B.Tech in Electrical Engineering from IIT Delhi in 2007. His research spans computer architecture, interconnection networks, networks-on-chip (NoC), and AI/ML accelerator systems, with a focus on optimizing data movement in modern computing platforms. His work is funded by NSF, DARPA, IARPA, SRC, Department of Energy, Intel, Google, Meta, Qualcomm, and TSMC. His papers have been cited over 17,000 times, with three receiving IEEE Micro's Top Picks recognition, one earning an honorable mention, and four winning best paper awards. Dr. Krishna leads the Synergy Lab at Georgia Tech and has developed several influential tools including ASTRA-sim for distributed AI/ML training, MAESTRO and SCALE-sim for accelerator design space exploration, and Garnet2.0 for NoC simulation. His recent work focuses on large language model acceleration, distributed training systems, and neuro-symbolic AI architectures. He has received numerous teaching and research awards including induction into the HPCA Hall of Fame (2022), the Class of 1940 Teaching Effectiveness Award (2018), and the Roger P. Webb Outstanding Mid-career Faculty Award (2024). HPCA Hall of Fame Inductee (2022) Roger P. Webb Outstanding Mid-career Faculty Award (2024) Richard M. Bass/Eta Kappa Nu Outstanding Junior Teacher Award (2023) Roger P. Webb Outstanding Junior Faculty Award (2021) Class of 1940 Course Survey Teaching Effectiveness Award (2018) Dr. Krishna currently serves as Associate Director for the Center for Research into Novel Computing Hierarchies (CRNCH) and co-chair of the Chakra Execution Traces and Benchmarks Working Group. He has held the ON Semiconductor (Endowed) Junior Professorship at Georgia Tech (2019-2021) and has been a visiting professor at MIT EECS, Harvard University CS, and a researcher at Intel's VSSAD group.

• Computer Architecture
• Interconnection Networks
• Networks-on-Chip
• +۴ مورد دیگر

Kaki Ryan is a Teaching Assistant Professor at the Department of Computer Science, University of North Carolina at Chapel Hill. She holds a Ph.D. (2025), M.S. (2021), and B.S. (2020) from UNC, with a minor in AAAD. Her research focuses on hardware security, symbolic execution, and computer science education. Education Ph.D., 2025, UNC-Chapel Hill M.S., 2021, UNC-Chapel Hill B.S., 2020, UNC-Chapel Hill (Computer Science and Mathematics) Ryan's research centers on hardware security, particularly using symbolic execution to identify bugs and vulnerabilities in hardware designs. She also emphasizes broadening participation in computing and improving pedagogical strategies in computer science education. Her recent publications (2023-2025) explore symbolic execution techniques for hardware security verification, including query caching, information flow analysis, and path explosion mitigation. These works span conferences like ASPLOS, VTS, FMCAD, and workshops such as HASP. Scientific Awards John M. Glotzer Graduate Teaching Assistant Award (2020-2021) Tanner Award for Excellence in Undergraduate Teaching (2022) As an educator, Ryan has served as Instructor of Record for COMP 435 (Computer Security Concepts) and COMP 311 (Computer Organization) in Fall 2025. She has extensive teaching experience as a Graduate Teaching Assistant, Head Teaching Assistant, and Undergraduate Teaching Assistant for courses like COMP 210, COMP 110, and COMP 435, with a focus on data structures, security concepts, and programming fundamentals.

• Hardware Security
• Symbolic Execution
• Computer Science Education
• +۳ مورد دیگر

Jenna Wise DiVincenzo is an Assistant Professor at the Elmore Family School of Electrical and Computer Engineering at Purdue University. She specializes in research areas such as software verification, formal methods, and programming languages, with a focus on gradual verification techniques that combine static and dynamic analysis. Her work emphasizes usability and scalability in verification tools, and she has contributed to projects like Gradual C0 and gradual null-pointer analysis. Dr. DiVincenzo earned her PhD in Software Engineering from Carnegie Mellon University (2023) and a BS in Mathematics and Computer Science from Youngstown State University (2017). She has interned at IBM Research, MIT Lincoln Laboratory, and the Software Engineering Research and Empirical Studies Lab at YSU. Her awards include the Google PhD Fellowship, NSF GRFP Fellowship, and 2022 Rising Star in EECS. Her research projects span theoretical advancements in gradual verification, empirical studies on usability, and practical tool development. She advises PhD students (e.g., Craig Liu, Conrad Zimmerman) and collaborates on initiatives like gradual verification for Rust and educational tools to teach verification concepts. Her work also explores leveraging large language models for specification generation and enhancing verification tool soundness through formal proofs.

• Software Verification
• Formal Methods
• Programming Languages
• +۵ مورد دیگر

Xiangyu Zhang is the Samuel D. Conte Professor of Computer Science at Purdue University. He specializes in AI security, software analysis, and cyber forensics, with a focus on detecting vulnerabilities in traditional software and AI systems. His research includes dynamic slicing, program profiling, and securing AI models against backdoors. He has led projects funded by DARPA, IARPA, NSF, and industry, securing over $13 million in grants. He has mentored 30+ PhD students and postdocs, many of whom hold academic positions or industry roles. His work has been recognized with awards like the ACM SIGPLAN Distinguished Dissertation Award and NSF Career Award. Education: PhD, Computer Science, University of Arizona (2006) MS & BS, Computer Science, University of Science and Technology of China (2000 & 1998) Research Interests: AI Security: backdoor detection, adversarial attacks, model integrity Program Analysis: dynamic slicing, static/dynamic debugging Cyber Forensics: log analysis, attack investigation Software Reliability: fault localization, vulnerability detection Key Projects: DARPA V-SPELLS: domain-specific program analysis IARPA TrojAI: AI backdoor detection competitions NSF-funded research on model debugging and co-reasoning of software/NL artifacts Awards & Recognition: Top performer in IARPA TrojAI competitions (13/18 rounds) ACM SIGPLAN Distinguished Dissertation Award (2006) NSF Career Award (2009) Ranked 8th globally in systems research productivity (2024) Career Contributions: Secured over $13M in research funding Guided 25 PhDs and 8 postdocs Published 89+ top-tier papers (2014–2024)

• AI Security
• Software Engineering
• Programming Languages and Compilers
• +۵ مورد دیگر

Deian Stefan is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD). His research focuses on building secure systems through interdisciplinary approaches spanning security , programming languages , and systems . Key areas include WebAssembly security , JavaScript JITs , constant-time programming , memory safety , information flow control , and program analysis tools. He co-founded Intrinsic , a web-security startup later acquired by VMWare, and contributed to standards like W3C WebAppSec and Node.js Security Working Groups. Education: PhD in Computer Science from Stanford University (2015), advised by David Mazières, John C. Mitchell, and Alejandro Russo BE and ME in Electrical Engineering from Cooper Union (2011) Research Trends: His work targets secure systems (Web frameworks, sandboxing, runtime systems), language-based security (constant-time programming, memory safety), and verification for security . Recent publications focus on mitigating speculative execution attacks, hardware-assisted sandboxing, and WebAssembly security. Awards & Recognition: Distinguished Paper Award at POPL 2021 and IEEE MICRO Top Picks 2024 Best Paper Award at CollaborateCom 2010 2010.01 Prize by Daniel J. Bernstein (DJB) Most Influential Paper Award at ICFP 2022 Teaching: He has taught graduate and undergraduate courses including Graduate Computer Security (CSE 227) , Building Secure Systems with Rust , and Programming Languages: Principles and Paradigms at UCSD since 2018. Prior teaching experience includes Stanford and Cooper Union.

• Security
• Programming Languages
• Systems
• +۶ مورد دیگر

Blair Hoxby is Professor of English at Stanford University's School of Humanities and Sciences, where he has taught since 2007. Previously, he served as Associate Professor of History and Literature at Harvard University (2005-2007) and Associate Professor of English at Yale University (2003-2005), where he began as Assistant Professor in 1998. His academic journey includes a Ph.D. in English from Yale University (1998), an M.Phil. in English Studies from the University of Oxford (1990), and an A.B. in English and American Literature and Language from Harvard University (1988). Hoxby's research focuses on literature and culture from 1500 to 1800, with particular emphasis on tragedy theory, Milton studies, and the intersection of literature and economics. His notable works include What Was Tragedy? Theory and the Early Modern Canon (2015) and Mammon's Music: Literature and Economics in the Age of Milton (2002). He argues that early modern tragedy differed significantly from contemporary understandings of the genre, with passions rather than deeds or character serving as the keys to early modern tragic performance. Hoxby's recent scholarly output reveals a consistent engagement with early modern theatrical practices, particularly tragedy and opera. His work demonstrates sophisticated interdisciplinary approaches, connecting literary analysis with historical context, economic theory, and performance studies. He has made significant contributions to understanding how commercial culture shaped literary production and how theatrical conventions evolved across national boundaries in Europe. Scientific Awards and Honors Internal Fellow, Stanford Humanities Center (2009-2010) Morse Fellowship, Juilliard School (2001-2002) Samuel and Ronnie Heyman Prize, Yale University (2001) John Addison Porter Prize, Yale University (1999) Rhodes Scholarship, University of Oxford (1988-1990) Hoxby has supervised numerous doctoral students and served in various administrative roles at Stanford, including Director of Undergraduate Studies (2011-2014) and Director of Graduate Admissions (2008-2011). His teaching portfolio includes courses on English poetry from the Renaissance to Romanticism, tragedy and tragic theory from Aristotle to the present, theater history, and performance theory. Currently, he teaches courses such as Court Theater from Shakespeare to Mozart and Introduction to English II: From Milton to the Romantics . Hoxby maintains active scholarly engagement through committee memberships, including the Executive Committee of the Milton Society of America (2009-2013) and service as a referee for major academic presses including Oxford University Press and the University of Pennsylvania Press.

• Early Modern Literature
• Tragedy and Tragic Theory
• Milton Studies
• +۷ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

• Programming Languages
• Networking
• Databases
• +۵ مورد دیگر

Michael O'Boyle is a Professor at the University of Edinburgh's School of Informatics, where he serves as Director of the ARM Research Centre of Excellence and the EPSRC Centre for Doctoral Training in Pervasive Parallelism. Holding an EPSRC Established Career Research Fellowship, he leads pioneering work in compiler technology for heterogeneous architectures, bridging theoretical advances with practical high-performance computing applications. Professor O'Boyle's research spans multiple cutting-edge areas including heterogeneous code discovery and optimization, neural machine translation for program synthesis, deep neural network system stack optimization, software-defined hardware, and compiler/architecture co-design. His approach integrates constraint analysis, program synthesis, and machine learning to address complex challenges in high-performance computing across diverse hardware platforms. His recent publications reveal a strong trend toward integrating machine learning with traditional compiler techniques, particularly in neural program synthesis, tensor optimization, and architecture-aware compilation. This work represents a paradigm shift in compiler design, moving from rule-based systems to learning-based approaches that can automatically adapt to diverse hardware targets. IEEE/ACM CGO 2025 Distinguished Paper Award for 'Tensorize: Fast Synthesis of Tensor Programs from Legacy Code' IEEE/ACM CGO 2024 Test of Time Award ACM GPCE 2023 Best Paper Award for 'C2TACO: Lifting Tensor Code to TACOM' ACM ASPLOS 2021 Distinguished Paper Award IEEE HPCA 2021 Best Paper Award for 'Prodigy: Improving the Memory Latency of Data-Indirect Irregular Workloads' Professor O'Boyle has successfully mentored numerous PhD students who have secured prominent positions in academia (including at Cambridge, Edinburgh, Leeds, and McGill) and industry (including Meta, NVIDIA, Qualcomm, Huawei, and Microsoft). His research is supported by significant funding from EPSRC, ARM, and European projects including Bonseyes and Transmuter, demonstrating strong international recognition and industry impact. He leads the influential Compiler and Architecture Design (CArD) Group at the University of Edinburgh and is a founder of the HiPEAC Network of Excellence, which has grown into a major European initiative connecting researchers and practitioners in high-performance and embedded computing.

• Heterogeneous Code discovery and Optimisation
• Neural Machine Translation and Neural Synthesis
• Deep Neural Network system stack
• +۷ مورد دیگر

Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.

• Machine Learning on Graphs
• Numerical Optimization
• Graph Algorithms
• +۲ مورد دیگر

Nadia Polikarpova is an Associate Professor in the Department of Computer Science and Engineering at the University of California, San Diego . She earned her PhD from ETH Zurich in 2014 under Bertrand Meyer , followed by postdoctoral research at MIT CSAIL with Armando Solar-Lezama . Her academic contributions have been recognized with prestigious awards including the 2020 Sloan Fellowship , 2020 Intel Rising Stars Award , and 2020 NSF CAREER Award . Polikarpova's research focuses on program synthesis , program verification , and type systems . She leads the Programming Systems group at UCSD and contributes to the IFIP Working Group 2.8 on Functional Programming since 2022. Her work spans foundational research and practical tools, including projects like Synquid , SuSLik , and Laurel that combine formal methods with machine learning for code generation. Her recent publications in venues like OOPSLA , NeurIPS , and ICFP reveal trends in AI-assisted programming , live programming environments , and formal verification . She has advised numerous PhD and Master’s students including Shraddha Barke , Zheng Guo , and Tristan Knoth , many of whom have moved to prominent academic and industry positions. Notable artifacts from her lab include tools like ColDeco for spreadsheet inspection and Superfusion for eliminating intermediate data structures. 2020 : Sloan Fellow 2020 : Intel Rising Stars Award 2020 : NSF CAREER Award 2021 : Distinguished Paper at POPL 2023 : Distinguished Artifact at PLDI 2023 : Distinguished Paper at OOPSLA Polikarpova actively contributes to academic service, serving on program committees for PLDI , POPL , and OOPSLA , and co-chairing the OOPSLA Review Committee in 2023. She has delivered keynotes at APLAS'20 and PLDI'24 , emphasizing the integration of large language models with formal methods.

• Program Synthesis
• Program Verification
• Type Systems
• +۵ مورد دیگر

Sishuai Gong is an Assistant Professor in the Department of Computer Science at the University of North Carolina at Chapel Hill, focusing on system reliability and security. His research bridges machine learning, software engineering, and computer architecture to address challenges in large-scale software systems. Education : Ph.D. in Computer Science from Purdue University (2025), B.S. in Computer Science from the University of Science and Technology of China (2019). Research Interests : System reliability and security, kernel concurrency testing, verified security modules, and machine learning for systems. He develops interdisciplinary techniques to identify and mitigate functional interference bugs in OS virtualization and latency-sensitive applications. Scientific Awards : Jay Lepreau Best Paper Award at OSDI (2024) Google Cloud Research Innovator (2024) Bilsland Dissertation Fellowship at Purdue (2024) Teaching : Offering COMP 790: Reliable and Secure Systems (Fall 2025) with a focus on empirical studies, static/dynamic analysis, and machine learning for systems. Course grading includes paper presentations (30%), class participation (30%), and research projects (40%).

• System Reliability
• System Security
• Machine Learning
• +۲ مورد دیگر

Marta Kwiatkowska is a Professor of Computing Systems at the University of Oxford and a Fellow of Trinity College. Her research focuses on probabilistic verification , quantitative model checking , and formal methods for complex systems including autonomous robots, medical devices, and biological systems. She leads the development of the PRISM and PRISM-games probabilistic model checkers. Key research areas: Probabilistic systems, formal verification, autonomous robotics, medical device analysis, systems biology Grants: ERC Advanced Grant VERIWARE, EPSRC Programme Grant Mobile Autonomy Awards: 2024 ETAPS Test-of-Time Tool Award for PRISM Students: Current and former advisees in topics spanning formal methods, robotics, and quantitative verification The PRISM-games extension enables verification of stochastic multi-player games with applications in network protocols, autonomous systems, and game theory. Her work bridges theory, algorithms, and practical implementation, with real-world applications in ubiquitous computing and nanotechnology.

• Probabilistic Verification
• Quantitative Model Checking
• Formal Methods
• +۴ مورد دیگر

Deian Stefan is an Associate Professor at the University of California San Diego (UCSD) in the Department of Computer Science and Engineering . His research spans security , programming languages , and systems , with a focus on building principled and practical secure systems. He has served as a co-founder and Chief Scientist at Intrinsic (acquired by VMWare) and contributed to standards bodies like the W3C WebAppSec and Node.js Security Working Groups . His research interests include: Secure Systems : Web frameworks, browser designs, sandboxing, runtime systems Language-Based Security : Constant-time programming, memory safety, information flow control Verification : Security verification, static/symbolic analysis tools WebAssembly and JavaScript JITs security Deian Stefan has received multiple scientific awards , including several Distinguished Paper Awards at venues like POPL, ICFP, and USENIX Security, as well as the IEEE Cybersecurity Award for Practice (2022) and CSAW 2020 First Place for Applied Research. He has taught courses on Computer Security (CSE 127, CSE 227) and advanced topics in Building Secure Systems (CSE 291) using Rust, WebAssembly, and blockchain security. His work has been supported by collaborations with industry and academia, including projects like RLBox and COWL .

• security
• programming languages
• systems
• +۷ مورد دیگر

Jeff B Murray serves as Professor and Department Chair in the Department of Marketing at the Sam M. Walton College of Business, University of Arkansas, teaching in the full-time MBA, Executive MBA, and Marketing Doctoral programs. His leadership extends to international doctoral seminars across Europe and Australia, reflecting his scholarly influence. His academic foundation includes a Ph.D. from Virginia Tech. His research program examines critical marketing, interpretive consumer research, and philosophy of science through frameworks like Consumer Culture Theory and Transformative Consumer Research. Murray's scholarly contributions reveal a trajectory from foundational critical theory toward contemporary applications in arts markets, sustainable fashion, and digital consumption. His work consistently bridges philosophical inquiry with empirical consumer phenomena, emphasizing emancipatory interests and societal transformation. Recent publications demonstrate growing interdisciplinary engagement with sociology, anthropology, and sustainability studies. Outstanding All-Around Professor Award (2002) Charles and Nadine Baum Faculty Teaching Award (2002) Editorial board service for leading journals including Journal of Consumer Research He mentors doctoral students now holding faculty positions globally, with recent workshops in Germany, France, and Scandinavia highlighting his international impact. His professional engagements span the American Marketing Association, Association for Consumer Research, and American Sociological Association, where he contributes to critical theory development through initiatives like Consumer Culture Theory. Murray maintains active scholarly networks through Transformative Consumer Research and regularly presents at international conferences, advancing critical perspectives on marketing's societal role.

• Critical Marketing
• Interpretive Consumer Research
• Philosophy of Science
• +۳ مورد دیگر

Peter Pietzuch is a Professor in the Department of Computing at Imperial College London, where he leads the Large-Scale Data & Systems (LSDS) group. He also serves as the Director of Research and is a Visiting Researcher at Microsoft Research Cambridge. Pietzuch holds a Ph.D. from the University of Cambridge and a B.A. from Girton College. His research spans distributed systems, cloud computing, big data processing, and systems security. Key interests include: Scalable architectures for cloud-native applications Efficient stream processing and machine learning systems Trusted execution environments and secure cloud infrastructure Optimization of serverless computing and distributed databases His recent publications focus on adaptive machine learning frameworks, secure cloud resource management, and high-performance stream processing systems. Trends show strong emphasis on hardware-software co-design, confidential computing, and fault-tolerant architectures. Awards include: Best Paper Award at Middleware'03 He actively advises PhD students and secures grants for projects like Faasm (serverless computing) and Teechain (blockchain security). His LSDS group collaborates with industry partners including Microsoft Research. Pietzuch teaches undergraduate and graduate courses including Scalable Systems for the Cloud and Operating Systems . He co-founded the ACM DEBS conference and serves on steering committees for EuroSys and Middleware.

• Distributed Systems
• Cloud Computing
• Big Data Processing
• +۵ مورد دیگر