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

Jeremy Gibbonsمشاهده پروفایل

استاد

• Programming languages
• Functional programming
• Software engineering
• +۷ مورد دیگر

Jeremy Gibbons is Professor of Computer Science at the University of Oxford, where he leads the Algebra of Programming research group and serves as Director of the Software Engineering Programme offering part-time professional Masters' degrees. He is a Governing Body Fellow at Kellogg College and has held significant leadership roles including Deputy Head of Department and Chair of the Faculty of Computer Science (2012-2016). His research focuses on programming methodology, particularly functional languages and object-oriented languages, with emphasis on expressing and reasoning about recurring patterns in software structure. He has made substantial contributions to functional programming, program construction, and the mathematics of program design, often drawing connections between category theory and practical programming techniques. His recent publications demonstrate continued innovation in functional programming techniques, memory technologies, and algorithm design, showing consistent focus on mathematical foundations of programming. The work spans theoretical explorations and practical applications of programming language concepts. CEng (Chartered Engineer) MBCS (Member of the British Computer Society) CITP (Chartered IT Professional) FIAP (Fellow of the International Association for Pattern Recognition) Gibbons has supervised numerous doctoral students and actively mentors both current and past students including Juuso Haavisto, Johannes Hartmann, and Jack Liell-Cock. His leadership extends to major conference committees and editorial boards, having served as Editor-in-Chief of the Journal of Functional Programming and current Editor-in-Chief of The Programming Journal. He leads the Algebra of Programming research group at Oxford, which explores the mathematical foundations of programming and develops techniques for program construction based on algebraic principles. The group maintains strong connections with international research communities through IFIP Working Groups 2.1 and 2.11.

Sankha Narayan Guriaمشاهده پروفایل

استاد

• Programming Languages
• Type Systems
• Program Synthesis
• +۲ مورد دیگر

Dr. Sankha Narayan Guria is a Professor at the University of Kansas specializing in programming languages research. He completed his PhD at the University of Maryland, College Park and has industry experience at Meta (Facebook), BrowserStack, and Firefox. His primary research focuses on programming language theory, type systems, and automated program synthesis techniques. His research explores cutting-edge techniques in program verification and synthesis, including abstract interpretation-guided synthesis, refinement types for security applications, and effect-guided program synthesis. His work consistently appears at top-tier conferences including PLDI, ECOOP, and SPLASH. Dr. Guria actively contributes to the programming languages community through committee service, including roles as Artifact Evaluation Co-Chair for SPLASH/OOPSLA (2023-2025) and committee member for PLDI Research Artifacts (2020-2026). He maintains an active research profile with publications spanning programming language design, type systems, and formal methods.

Ranjit Jhalaمشاهده پروفایل

استاد

• Programming Languages
• Formal Verification
• Software Engineering
• +۳ مورد دیگر

Ranjit Jhala is a Professor of Computer Science Engineering in the Jacobs School of Engineering at the University of California, San Diego. His research focuses on building reliable computer systems through programming languages and software engineering techniques. His primary research interests include Programming Languages, Formal Verification, and Software Engineering. He draws from and contributes to areas such as Type Systems, Model Checking, Program Analysis, and Automated Deduction, bridging theoretical foundations with practical implementations for real-world software development. Prof. Jhala's publication record shows a consistent trajectory in refinement type systems, evolving from Liquid Haskell to Flux for Rust, while also exploring neurosymbolic approaches to error repair and type error diagnosis. His work demonstrates a commitment to making formal verification techniques accessible to practitioners. He leads the Programming Systems Group at UCSD, mentoring graduate students and collaborating with researchers across the programming languages community. His service includes General Chair roles for POPL 2018 and PLDI 2022, reflecting his leadership position in the field. Prof. Jhala is also known for his mentoring activities, including talks on academic presentation skills and participation in ICFP's mentoring programs for students and early-career researchers.

Konstantinos Kallasمشاهده پروفایل

استادیار

• Computer Systems
• Compilers
• Programming Languages
• +۱ مورد دیگر

Konstantinos Kallas serves as Assistant Professor of Computer Science at the University of California, Los Angeles (UCLA), commencing his appointment in January 2025. Previously affiliated with the University of Pennsylvania as evidenced by his 2020 PLDI contribution, his research bridges theoretical formal methods with practical systems engineering across multiple high-impact conferences including PLDI, POPL, and SPLASH. His research program centers on enhancing computational efficiency and correctness in systems software, with three flagship projects defining his trajectory: PaSh for automatic shell script parallelization, Durable Functions for stateful serverless computing semantics, and DiffStream for differential testing of stream processing. These efforts consistently target the intersection of programming language theory and real-world systems constraints, particularly in parallelism, concurrency, and cloud-native environments where correctness guarantees are challenging to implement. Analysis of his publication history since 2020 reveals a methodological pattern: developing formal semantic models to enable practical optimizations in distributed systems. His work increasingly focuses on serverless architectures and data-intensive pipelines, with recent contributions emphasizing automated verification techniques. The evolution from shell script optimization (2020-2021) to serverless state management (2021-2022) demonstrates strategic expansion into cloud computing's hardest problems. Dr. Kallas actively contributes to the academic community through program committee service for PLDI (2022, 2025), POPL (2021, 2022, 2023), and SPLASH (2020-2023), including leadership roles as Publicity Co-Chair for PLDI 2025 and 2026. His June 2024 announcement confirms recruitment for Fall 2025 students at UCLA, targeting researchers interested in systems, compilers, and programming languages who can advance his work on correctness-preserving parallelization and serverless computing.

Fredrik Kjolstadمشاهده پروفایل

استادیار

• Compilers
• Programming Models
• Performance Engineering
• +۳ مورد دیگر

Fredrik Kjolstad is an Assistant Professor in the Department of Computer Science at Stanford University, specializing in compilers and programming models for sparse computing and performance engineering. His research focuses on separating algorithms from data representations to enable portable applications across diverse hardware platforms. His research interests span compilers, programming models, performance engineering, and computer architecture, with particular emphasis on sparse tensor algebra, compiler design for heterogeneous systems, and high-performance computing. He has pioneered frameworks like TACO, Simit, and Distal that enable efficient sparse computations across CPUs, GPUs, and specialized accelerators. Dr. Kjolstad's publications demonstrate expertise in compiler optimization techniques for sparse data structures, tensor algebra, and distributed systems. His work consistently addresses the challenge of bridging high-level programming abstractions with efficient hardware execution across diverse architectures. MIT EECS First Place George M. Sprowls PhD Thesis Award NSF CAREER Award Rosing Award Adobe Fellowship Google Research Scholarship Best Paper Awards at EuroMPI 2013, OOPSLA 2017, and OOPSLA 2021 ISCA Distinguished Artifact Award PLDI and OOPSLA Distinguished Paper Awards He advises multiple PhD students including James Dong, Olivia Hsu, and Rohan Yadav, while leading research on compiler technologies that have received significant grant support. His group develops practical tools like the TACO compiler and Legate Sparse that are used in both academic and industrial settings. Current projects focus on programmable accelerators for sparse tensor algebra, distributed sparse computing, and compiler support for emerging hardware architectures.

Ori Lahavمشاهده پروفایل

استاد

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

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. He holds a PhD from Tel Aviv University (supervised by Arnon Avron), completed postdoctoral research at Tel Aviv University (hosted by Mooly Sagiv) and MPI-SWS in Germany (hosted by Viktor Vafeiadis and Derek Dreyer). His research is supported by an ERC Starting Grant and ISF Grant. His research focuses on programming languages, verification, concurrency, and relaxed memory models, with additional interests in proof theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in compiler design, hardware verification, and distributed systems. Lahav's publications consistently explore concurrency paradigms, weak memory models, and verification techniques. Recent works emphasize formal methods for RDMA, persistent memory, compositional semantics, and automated tooling for memory consistency. Awards: Best Paper & Best Student Paper Awards (DISC 2024) Distinguished Paper Award (OOPSLA 2021) Best Paper Award (TABLEAUX 2017) Distinguished Paper Award (PLDI 2017) Best Paper Award (ECOOP 2017) Kleene Award for Best Student Paper (LICS 2013) He advises PhD and MSc students including Yoav Ben Shimon, Yotam Dvir, and Roy Margalit. His group investigates shared-memory concurrency, denotational semantics, and verification tools. Lahav co-organizes conferences (VMCAI 2024) and Dagstuhl seminars (2023, 2026). He teaches courses on Programming Language Foundations, Discrete Mathematics, and Weak Memory Concurrency.

Sam Lindleyمشاهده پروفایل

دانشیار

• Programming Languages
• Type Systems
• Effect Handlers
• +۵ مورد دیگر

Sam Lindley is a Reader in Programming Language Design and Implementation at the Laboratory for Foundations of Computer Science within the School of Informatics at The University of Edinburgh. He holds a prestigious UKRI Future Leaders Fellowship focused on Effect Handler Oriented Programming. His academic career spans multiple institutions including Heriot-Watt University and Imperial College London. His research interests center on programming language theory and implementation, with specific expertise in type systems, effect handlers, session types, and functional programming. Lindley's work bridges theoretical foundations with practical implementation, particularly in compiler design and language semantics. His research has significant implications for language safety, efficiency, and expressiveness. Lindley's publication record demonstrates consistent contributions to top programming languages venues including PLDI, POPL, ICFP, and OOPSLA. His recent work explores modal effect types, scoped effects, and the application of effect handlers to systems programming and WebAssembly. The trend shows increasing focus on practical applications of theoretical concepts in real-world language implementations. Major Awards: UKRI Future Leaders Fellowship in Effect Handler Oriented Programming Lindley has served in significant leadership roles including ICFP 2023 Program Chair and PLDI 2025 Area Chair. He actively participates in the programming languages community through numerous program committees and workshop organization. His research is conducted within the Laboratory for Foundations of Computer Science, a leading center for theoretical computer science research at Edinburgh.

Anil Madhavapeddyمشاهده پروفایل

استاد

• Planetary Computing
• Computer Systems
• Programming Languages
• +۷ مورد دیگر

Anil Madhavapeddy is the Professor of Planetary Computing at the University of Cambridge Computer Laboratory, where he co-leads the Energy & Environment Group and is a member of the Systems Research Group. He is also a Fellow at Pembroke College where he serves as Director of Studies in Computer Science. Madhavapeddy completed his PhD from the University of Cambridge in 2003 and his BEng in Information Systems Engineering from Imperial College in 1999. He holds a JM Keynes Fellowship since 2022 for his work combining computer science with economics, and serves on the management committee of the Cambridge Conservation Initiative where he co-directs 4C (Cambridge Centre for Carbon Credits) and the Centre for Earth Observation. His research spans computer systems and programming languages with a strong focus on applying these technologies to global conservation, biodiversity, and climate change challenges. He leads the OCaml Labs group and has made significant contributions to open-source projects including OCaml, Docker, Xen, and OpenBSD. His work often bridges computer science with environmental science, developing computational approaches to address planetary-scale challenges. Madhavapeddy's recent publications demonstrate a clear trajectory toward integrating programming language research with environmental monitoring and conservation. His work spans from foundational programming language techniques to applied geospatial computing systems, with increasing emphasis on biodiversity measurement, carbon credit systems, and planetary-scale environmental monitoring. JM Keynes Fellowship (2022-present) As an educator, Madhavapeddy teaches undergraduate courses including Foundations of Computer Science, Software & Security Engineering, and Cloud Computing. He mentors MPhil and PhD students and co-founded the award-winning book 'Real World OCaml' (2nd Edition, 2022). He has co-founded several companies including Unikernel Systems, High Energy Magic, Segfault, and Tarides to translate research into real-world impact. Madhavapeddy leads the OCaml Labs group at Cambridge and works closely with the Energy & Environment Group, collaborating with colleagues from Plant Sciences, Zoology, Economics, and NGOs including UNEP-WCMC and the IUCN. His current efforts are primarily focused on conservation technology through partnerships with organizations like Canopy PACT.

Stefano Markidisمشاهده پروفایل

استاد

• High-Performance Computing
• Heterogeneous Systems
• Quantum Computing
• +۳ مورد دیگر

Stefano Markidis is a Professor of Computer Science specializing in high-performance computing systems at KTH Royal Institute of Technology in Sweden. He works in the Division of Computational Science and Technology, focusing on supercomputers, quantum computers, and computational methods for scientific simulations. His research spans multiple domains including plasma physics, computational fluid dynamics, and quantum computing. Markidis holds an MS degree from Politecnico di Torino and a PhD in Nuclear Engineering from the University of Illinois at Urbana-Champaign. Prior to joining KTH, he was a graduate research assistant at Los Alamos National Laboratory and Lawrence Berkeley National Laboratory, followed by a postdoc at KU Leuven. His academic journey reflects a strong foundation in both engineering and computational science. His primary research interests include High-Performance Computing , Heterogeneous Systems , and Quantum Computing . Markidis develops computational methods for plasma physics, particle-in-cell simulations, and fluid dynamics. His work bridges theoretical physics and practical computing, with applications in space physics, fusion energy, and materials science. He is particularly known for contributions to parallel computing, GPU acceleration, and the development of scalable simulation frameworks like Neko for computational fluid dynamics. His research increasingly integrates machine learning techniques with traditional numerical methods. Analysis of Markidis' recent publications reveals a strong focus on quantum-classical hybrid computing, advanced particle-in-cell methods, and high-fidelity computational fluid dynamics. His work demonstrates expertise in programming models for heterogeneous architectures including GPUs and quantum processors, with growing emphasis on AI-enhanced scientific computing. R&D100 award (2005) for the CartaBlanca project R&D100 award (2017) for the SHIELDS project Markidis teaches multiple courses at KTH including Applied GPU Programming, Quantum Computing for Computer Scientists, and High-performance Computing for Computational Scientists. He has supervised numerous degree projects across various specializations in computer science and electrical engineering. His research has been supported by various grants related to high-performance computing and quantum technologies, with applications spanning from space physics to medical treatments. Markidis leads research in computational science with a focus on developing frameworks like Neko for extreme-scale computational fluid dynamics. His team works on integrating traditional HPC methods with emerging technologies including quantum computing and AI, contributing to advancements in scientific simulation across multiple disciplines.

Umang Mathurمشاهده پروفایل

استادیار

• Formal Methods
• Logic
• Programming Languages
• +۷ مورد دیگر

Umang Mathur is a Presidential Young Professor (Assistant Professor) in the School of Computing at the National University of Singapore (NUS), where he leads the FOCS Lab and is affiliated with PLSE@NUS (Programming Languages and Software Engineering group). He has established himself as a leading researcher in Formal Methods, with significant contributions to concurrency analysis and program verification. Dr. Mathur received his PhD from the University of Illinois at Urbana-Champaign under Prof. Mahesh Viswanathan. Prior to joining NUS, he worked as a Research Scientist at Facebook Inc. and as a Research Fellow at the Simons Institute for the Theory of Computing. His doctoral work was supported by a Google PhD Fellowship. PhD: University of Illinois at Urbana-Champaign Current Position: Presidential Young Professor at NUS School of Computing Previous Positions: Research Scientist at Facebook, Research Fellow at Simons Institute His research spans Formal Methods and Logic with applications to Programming Languages, Software Engineering, and Cyber-Physical Systems. Dr. Mathur specializes in developing algorithmic techniques for analysis of concurrent software and understanding decidability boundaries in verification and synthesis. His work bridges theoretical foundations with practical implementations, making verification techniques more efficient for real-world systems. Analysis of his recent publications reveals a strong focus on practical concurrency analysis, with many papers addressing race detection, deadlock prediction, and memory model verification. His research consistently demonstrates how theoretical computer science can solve practical software engineering challenges, particularly in making verification techniques scalable and efficient for industrial applications. Google PhD Fellowship ESEC/FSE 2018 Distinguished Paper Award ASPLOS 2022 Best Paper Award POPL 2023 ACM SIGPLAN Distinguished Paper Award CPP 2024 Distinguished Paper Award Dr. Mathur actively mentors numerous PhD students, Master's students, and undergraduates through the FOCS Lab. His research group has received support from Google Research grants and other funding sources. He serves on program committees for major conferences including PLDI, POPL, and ASPLOS, and has organized events like PLMW@PLDI. His teaching includes courses on Data Structures and Algorithms, Foundations of Logic in Computer Science, and advanced topics in Programming Languages. As director of the FOCS Lab, Dr. Mathur oversees a vibrant research group focused on foundational aspects of computer science with direct applications to programming languages and software engineering. The lab maintains strong international collaborations and regularly publishes in top-tier venues, reflecting its significant contributions to the field of formal methods and programming languages.

Sidi Mohamed Beillahiمشاهده پروفایل

مدرس

• Formal Verification
• Programming Languages
• Smart Contracts
• +۴ مورد دیگر

Sidi Mohamed Beillahi is a Lecturer in the Department of Computer Science at the University of Toronto's Faculty of Arts and Science. He teaches courses including Principles of Programming Languages (CSC324H1S) and Algorithms and Data Structures (ECE345H1F). Previously, he served as a Teaching Assistant at both University of Paris and Concordia University for courses ranging from Automata Theory to Hardware Functional Verification. Dr. Beillahi's research focuses on developing formal verification and programming languages techniques to ensure the correctness of software systems, particularly distributed systems, concurrent programs, blockchain, and smart contracts. His work bridges theoretical computer science with practical security applications in decentralized finance. His publication record shows a clear progression from quantum circuit verification during his Master's to blockchain and smart contract security in his doctoral and postdoctoral work. Recent publications demonstrate expertise in authenticated data structures for blockchain storage, flash loan attack analysis, and formal verification of decentralized applications. Scientific Awards: ACM SIGSOFT Distinguished Paper Award (ICSE '24) ICBC Distinguished Paper Award (ICBC '22) Dr. Beillahi has advised multiple research projects in blockchain security and verification, often collaborating with Professor Fan Long and Professor Andreas Veneris at the University of Toronto. His research has been supported by prestigious fellowships including an NSERC Postdoctoral Fellowship and a Mitacs Accelerate Fellowship.

Magnus O. Myreenمشاهده پروفایل

استاد

• Formal verification
• interactive theorem provers
• compilers
• +۶ مورد دیگر

Magnus O. Myreen is a Professor in the Department of Computer Science and Engineering at Chalmers University of Technology, Sweden. He has been with Chalmers since 2014, becoming a tenured Associate Professor in 2015 and being promoted to full Professor in June 2023. Myreen has an extensive record of service to the programming languages and formal methods communities, including serving on program committees for major conferences like PLDI, POPL, ICFP, and CPP, and chairing the steering committee for the ITP conference series since November 2023. Myreen received his academic training at prestigious institutions: B.A. in Computer Science at the University of Oxford, tutored by Dr. Jeff Sanders Ph.D. on program verification in 2009 at the University of Cambridge, supervised by Prof. Mike Gordon Myreen's research focuses on program verification, interactive theorem proving, and compiler verification. He is best known for his work on the CakeML project, which is an ML-style language with a formal semantics and a growing ecosystem of proofs and tools that support construction of verified applications. As he states on his website, "My most recent work has focused on CakeML, which is an ML-style language with a formal semantics and a growing ecosystem of proofs and tools that support construction of verified applications. As far as I know, the CakeML compiler is the first verified compiler to have been bootstrapped." His research spans several key areas: Decompilation into logic — verification of machine code Proof-producing synthesis from logic Verified Lisp and ML runtimes Connecting things up: verified stacks Myreen's publication record shows a strong focus on verified compilation and theorem proving, particularly through the CakeML ecosystem. His work consistently bridges the gap between theoretical foundations and practical implementation, with numerous papers on verified compilers, program verification, and theorem proving. A significant trend in his recent work (2021-2024) has been extending CakeML's capabilities to handle more complex language features, improve performance, and verify increasingly sophisticated compilation techniques including bootstrapping and dynamic computation. Myreen has received several prestigious awards and recognitions: Winner of the BCS Distinguished Dissertation Competition 2010 for his PhD work Royal Society Research Fellow (UK) since 2012 ACM SIGPLAN Most Influential POPL Paper Award for the 2014 CakeML paper Amazon Research Award for his proposal "Compiling Dafny to CakeML" Myreen has advised several PhD students to completion, including Alejandro Gomez (Sep 2017 – Jun 2023), Oskar Abrahamsson (Aug 2017 – Dec 2022), and Andreas Loow (Sept 2016 – Sep 2021). He also collaborated with postdocs including Hira Syeda, Thomas Sewell, and Johannes Aman Pohjola. His research has been supported by various funding sources, though specific grants aren't detailed in the provided text. Notably, he received an Amazon Research Award for his work on compiling Dafny to CakeML, and his CakeML project has clearly attracted significant attention in the programming languages and formal methods communities. Myreen leads research on the CakeML project, which has grown into a substantial ecosystem for verified compilation. The project involves a team of researchers working on various aspects including compiler verification, program synthesis, and theorem proving. Myreen also collaborates with researchers at other institutions, as evidenced by his visits to EPFL (meeting Viktor Kuncak, Martin Odersky, and James Larus) and NUS (visiting Ilya Sergey's group). In October 2023, he began a ten-month sabbatical at Cambridge UK, where he worked part-time for Arm Ltd., indicating ongoing industrial collaboration.

Mayur Naikمشاهده پروفایل

استاد

• Programming Languages
• Artificial Intelligence
• Neurosymbolic Programming
• +۵ مورد دیگر

Mayur Naik is the Misra Family Professor in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He holds office in Room 642B, Amy Gutmann Hall and maintains an active research program focused on the intersection of programming languages and artificial intelligence. Before joining UPenn, he was faculty at Georgia Institute of Technology and a researcher at Intel Labs, Berkeley. Naik received his PhD in Computer Science from Stanford University in 2008 under Alex Aiken, a Masters from Purdue University in 2003 under Jens Palsberg, and a Bachelors from BITS Pilani in 1999. He grew up in Goa, India. His primary research interests center around neurosymbolic programming, which combines symbolic reasoning with machine learning to create more accurate, interpretable, and domain-aware AI systems. His group develops language design, learning algorithms, and compiler optimizations in this space, with their most mature effort being the Scallop neurosymbolic programming language and compiler toolchain. He also conducts research in trustworthy AI for healthcare applications and AI-enabled programming tools that improve programmer productivity. Analysis of his recent publications shows a strong trend toward neurosymbolic programming frameworks (Scallop, TorchQL), LLM-assisted program analysis (IRIS), and applications of these techniques to security, healthcare, and computer vision. His work consistently bridges theoretical foundations with practical implementations, often releasing open-source systems. Misra Family Professor (endowed chair, effective July 2024) Multiple distinguished paper awards (PLDI 2019, FSE 2015, PLDI 2014) Test-of-Time Paper Awards (FSE 2013, FSE 2012, EuroSys 2011) His student Elizabeth Dinella won the 2025 ACM SIGSOFT Outstanding Dissertation award Naik has advised numerous PhD students who have gone on to faculty positions at top institutions including Peking University, University of Toronto, Ashoka University, Bryn Mawr College, and Johns Hopkins University. His research is supported by grants from NSF, Google, Amazon, and other industry partners. His lab maintains active collaborations with clinicians and bioinformatics researchers to apply neurosymbolic programming to healthcare problems. His research group, which includes current PhD students and postdocs, develops practical open-source systems and applies them to diverse domains including computer vision, cybersecurity, medicine, and bioinformatics. The group maintains strong industry connections with Google, Microsoft, Amazon, and other tech companies.

Chandrakana Nandiمشاهده پروفایل

استادیار

• Programming Languages
• Compilers
• Equality Saturation
• +۵ مورد دیگر

Chandrakana Nandi is the Director of US R&D at Certora and an affiliate assistant professor in the Department of Computer Science & Engineering at the University of Washington's College of Engineering. She completed her PhD at the University of Washington working with Zachary Tatlock and Dan Grossman in the PLSE research group. Her research focuses on building tools for scaling automated formal verification to real-world programs, particularly for DeFi applications. She works extensively with equality saturation techniques (egg project) and has made significant contributions to computational fabrication through projects like Carpentry Compiler, Szalinski, and LambdaCAD. Her work bridges programming languages, compilers, and digital fabrication, creating novel tools that transform how we design and manufacture physical objects. Nandi's publication record shows a strong trajectory in programming language techniques applied to verification and fabrication. Her work on equality saturation has become foundational in the field, with the egg library enabling state-of-the-art results in compiler optimization and program synthesis. Recent work has expanded into formal verification of smart contracts, demonstrating the versatility of her research approach across different domains. Distinguished Paper Award at OOPSLA 2021 Sigplan Research Highlight for POPL 2021 As Director of US R&D at Certora, she leads research efforts on verification tools for languages like WASM and techniques to help users write formal specifications more easily using mutation testing. She has served in numerous organizational roles for major programming languages conferences including as Workshops Co-Chair for ICFP 2025 and Committee Member for PLDI Review Committee. Nandi has established herself as a leader in the intersection of programming languages and computational fabrication, with her work on equality saturation becoming particularly influential across multiple subfields of programming languages research.

Rachit Nigamمشاهده پروفایل

استادیار

• Programming Languages
• Computer Architecture
• Hardware Acceleration
• +۳ مورد دیگر

Rachit Nigam serves as an Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at the Massachusetts Institute of Technology's School of Engineering. He leads the FLAME Lab, focusing on the intersection of programming languages and computer architecture. His research profile demonstrates significant involvement in major programming languages conferences including PLDI, SPLASH, and ICFP, where he has served in various committee roles from Artifact Evaluation to Student Research Competition Chair. Dr. Nigam's research centers on programming languages and hardware systems, with particular emphasis on creating compilers that transform programs into architectures. His work bridges theoretical type systems with practical hardware implementation, developing tools like Calyx (an intermediate language for hardware accelerator generators) and Dahlia (implementing time-sensitive affine types). His approach combines formal methods with practical compiler design to address challenges in predictable accelerator generation and hardware compilation. His publication record reveals a consistent trajectory in hardware-aware programming language design, with recent work focusing on unifying static and dynamic intermediate languages for accelerator generators. The publications demonstrate expertise across multiple subfields including type systems for hardware timing constraints, modular hardware design methodologies, and synthesis-aided compiler techniques for specialized architectures like DSPs. As an active member of the programming languages community, Nigam has served on numerous conference committees including PLDI, OOPSLA, and LCTES. He has chaired sessions, organized tutorials (including 'DSL-based Hardware Generation'), and contributed to community initiatives like PL Tea. His GitHub presence shows active development in projects related to hardware compilation with significant contributions to repositories like Calyx, Filament, and Dahlia. Dr. Nigam leads the FLAME Lab at MIT, which focuses on creating programming models and compiler infrastructure for hardware acceleration. His work with the Calyx compiler ecosystem represents a significant contribution to the field of hardware accelerator generation, providing tools that enable more predictable and efficient hardware compilation processes. His research has practical implications for domain-specific hardware accelerators and the broader challenge of making hardware design more accessible through programming language techniques.