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

José Fragoso Santosمشاهده پروفایل

استادیار

• JavaScript
• Separation Logic
• Symbolic Execution
• +۲ مورد دیگر

José Fragoso Santos is an Assistant Professor in the Department of Computer Science and Engineering at Instituto Superior Técnico, University of Lisbon, and a member of INESC-ID where he conducts research as part of the SAT group. His research focuses on embedding formal methods into software development processes, with particular emphasis on JavaScript program analysis and verification. His educational background includes: PhD in Computer Science from University of Nice Sophia Antipolis (2014) Master's degree in Information Systems and Computer Engineering from Instituto Superior Técnico, Universidade de Lisboa (2008) Dr. Santos' research centers on JavaScript verification, symbolic execution, and secure information flow. He led the development of JaVerT, the first separation-logic-based tool for JavaScript analysis and testing, which has gained significant interest from both industry and academia. His work bridges theoretical formal methods with practical applications, particularly in web security and program analysis. He has made substantial contributions to understanding JavaScript semantics, symbolic execution techniques, and secure information flow in web applications, with publications in premier venues like PLDI, POPL, and ECOOP. His recent publications demonstrate a strong focus on symbolic execution for JavaScript and related languages, with applications in web security and program verification. The research shows progression from foundational work on information flow security to advanced techniques like compositional symbolic execution and multi-language analysis platforms. His work on JaVerT and Gillian has established significant research directions in program analysis for dynamic languages. His notable scientific achievements include: Facebook research award for the JaVerT project Dr. Santos has supervised numerous graduate students on projects related to JavaScript verification, symbolic execution, web security, and formal methods. His research has practical applications, as evidenced by the collaboration with Amazon R&D engineers to verify critical components of the AWS Encryption SDK using JaVerT. He has served on program committees for major conferences including PLDI, OOPSLA, and IJCAI, demonstrating his standing in the programming languages community. As a member of the SAT group at INESC-ID, Dr. Santos collaborates with researchers working on formal methods, program verification, and software security. His current projects include extending JavaScript symbolic execution to Web Workers, developing formal semantics for JavaScript regular expressions, and creating first-order solvers for program analysis. He continues to push the boundaries of what's possible in JavaScript program analysis and verification.

Rajiv Guptaمشاهده پروفایل

استاد

• Parallel Computing
• Compilers
• Computer Architectures
• +۴ مورد دیگر

Rajiv Gupta is a Distinguished Professor and the Amrik Singh Poonian Professor of Computer Science at the University of California, Riverside (UCR), where he serves as Associate Dean for Academic Personnel in the Bourns College of Engineering (BCOE). He is a member of the RIPLE research group and has co-authored 327 papers with an h-index of 69 and over 16,600 citations. His extensive service includes chairing major conferences such as FCRC 2015, PPoPP 2020, ASPLOS 2011, and PLDI 2008. Professor Gupta's research focuses on Programming, Compiler, Runtime & Architectural Support for Parallel & Distributed Heterogeneous Systems and Software Tools for Monitoring and Managing Runtime Behavior . His work spans graph analytics with scalability and performance, understanding and managing the dynamic behavior of parallel programs, software speculation for irregular parallelism, dynamic program analysis for secure and reliable computing, and compiler optimizations with architectural support. His research has significant applications in high-performance computing, GPU programming, and distributed systems. Analysis of his recent publications reveals a strong focus on graph processing systems, with particular emphasis on evolving and streaming graph analytics. His work addresses critical challenges in memory management for large-scale graph processing, hardware acceleration for graph algorithms, and optimization techniques for concurrent and distributed graph computations. The research demonstrates a progression from foundational compiler and architecture work to increasingly sophisticated systems for handling modern data-intensive computing challenges. Fellow of the ACM (2009) Fellow of the IEEE (2008) Fellow of the AAAS (2011) NSF Presidential Young Investigator Award (1991) UCR Doctoral Dissertation Advisor/Mentor Award (2012) Multiple best paper awards across major conferences Two students won ACM SIGPLAN Outstanding Doctoral Dissertation Award Five advisees received NSF CAREER Award Professor Gupta has supervised 42 PhD students to completion and currently advises several doctoral candidates. His advising success is reflected in his students' achievements, including multiple award-winning dissertations and significant career accomplishments in academia and industry. His research has been supported by numerous grants from NSF, DARPA, and industry partners, enabling sustained investigation into parallel computing systems. The RIPLE research group under his leadership has produced influential work that bridges theoretical foundations with practical system implementations. As the leader of the RIPLE research group at UC Riverside, Professor Gupta oversees a vibrant team focused on innovative approaches to parallel and distributed computing. The group maintains strong collaborations with industry partners and other academic institutions, contributing to the development of next-generation computing systems. Current projects include GRASP (Graph Analytics with Scalability & Performance) and research on understanding and managing the dynamic behavior of parallel programs, reflecting the group's continued focus on cutting-edge computing challenges.

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.

Sang-Hoon Kimمشاهده پروفایل

دانشیار

• Operating Systems
• Memory Systems
• Storage Systems
• +۴ مورد دیگر

Sang-Hoon Kim is an Associate Professor in the Department of Software and Computer Engineering and Department of Artificial Intelligence at Ajou University, South Korea. He leads the Systems Software Lab (Paldal Hall 1004-2) and maintains active collaborations with Virginia Tech as a Visiting Scholar since August 2024. His academic journey includes a Ph.D. in Computer Science from KAIST (2016) under advisors Seungryoul Maeng and Jin-Soo Kim, and a B.S. in Computer Science from KAIST (2002). His research spans operating systems, memory management, and storage systems with focus on mobile platforms, heterogeneous architectures, and SSD technologies. Key interests include memory fragmentation control , distributed thread execution , key-value storage optimization , and resource disaggregation . His work bridges theoretical innovation with practical system implementations, particularly for mobile and datacenter environments. Kim's publication portfolio shows consistent output in top-tier venues including USENIX FAST, VLDB, ICDCS, and ASPLOS. His research demonstrates evolution from mobile memory management (2015-2017) toward distributed systems and hardware-aware software (2019-present), with recent emphasis on resource-disaggregated environments and heterogeneous-ISA computing. The 2024 Best Paper Award at USENIX FAST highlights his impact in storage systems research. Best Paper Award at USENIX FAST'24 Multiple patents including US-9588912B2 for memory control He directs significant research projects funded by ETRI, NRF, and US ONR, including current work on memory-centric computing systems (2020-2023) and disaggregated non-volatile memory systems using RDMA (2018-2020). His Systems Software Lab maintains strong industry partnerships with Samsung Electronics and NHN, with prior projects improving Android memory management and developing SSD-based storage systems for large-scale internet services.

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.

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.

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.

Kunle Olukotunمشاهده پروفایل

استاد

• Computer Architecture
• Parallel Programming
• Chip Multiprocessors
• +۴ مورد دیگر

Kunle Olukotun is a Professor of Electrical Engineering and Computer Science at Stanford University's School of Engineering, where he has been faculty since 1991. He directs the Stanford Pervasive Parallelism Lab (PPL) and co-leads the Transactional Coherence and Consistency (TCC) project. His research focuses on computer architecture, parallel programming environments, and scalable parallel systems. Key areas include chip multiprocessors (CMPs), transactional memory systems, domain-specific languages (DSLs) for heterogeneous computing, and hardware-software co-design for machine learning workloads. His work bridges theoretical foundations with practical systems implementation. Notable contributions include the Stanford Hydra research project (one of the first chip multiprocessors with thread-level speculation), founding Afara Websystems (acquired by Sun Microsystems), and developing the Niagara processor architecture. His DSL frameworks like Green-Marl and Spatial enable efficient graph analysis and hardware acceleration. His publications reveal strong trends in parallel systems evolution: from foundational CMP research (2000s) to transactional memory (2004-2010), then DSLs for heterogeneous computing (2010-2015), and currently foundation model systems (2023-2025). Subfield analysis shows consistent focus on hardware-software co-design, sparse computation, and compiler techniques across decades. ACM Fellow (2006) for contributions to multiprocessors on a chip and multi-threaded processor design Best Paper Award at IEEE International Symposium on Workload Characteristics (IISWC '10) for EigenBench Olukotun actively mentors researchers through the Stanford Pervasive Parallelism Lab (PPL), which seeks to proliferate parallelism across application domains. His projects have secured significant industry partnerships, including the acquisition of his startup Afara Websystems by Sun Microsystems. Current research focuses on compiler frameworks for foundation model systems and hardware acceleration for sparse machine learning workloads, supported by collaborations with major tech companies. He leads the Stanford Pervasive Parallelism Lab (PPL), which develops compiler and runtime systems for heterogeneous architectures. The lab's work spans DSLs, hardware acceleration, and parallel programming models, with strong industry ties to companies like NVIDIA and Google. Current initiatives include the Mosaic compiler framework and Stardust architecture for sparse tensor computation.

Bryan Parnoمشاهده پروفایل

استاد

• Secure Systems
• Formal Software Verification
• Applied Cryptography
• +۷ مورد دیگر

Bryan Parno is the Kavčić-Moura Professor of Electrical & Computer Engineering and Computer Science at Carnegie Mellon University, where he leads the Secure Foundations Lab within CyLab, CMU's Security & Privacy Institute. His research combines theory and practice to provide formal, rigorous security guarantees about concrete systems, with emphasis on creating solid foundations for practical solutions. His research spans secure systems , formal software verification , applied cryptography , data privacy , and usable security . Current work focuses on protocols for verifiable computation and zero-knowledge proofs, building practical formally verified secure systems, and developing next-generation application models. His lab maintains a strong commitment to reproducibility, open-sourcing code under permissive licenses, and avoiding patenting results to maximize public benefit. His recent publications demonstrate a clear trend toward practical verification of real-world systems, particularly through the Verus project for verifying Rust code, Everest for building verified HTTPS stacks, and Ironclad for provably secure systems. These works bridge the gap between theoretical security guarantees and practical implementation, with applications ranging from blockchain protocols to verified cryptographic libraries deployed in the Linux kernel. His scientific achievements include multiple Distinguished Paper/Artifact Awards (USENIX Security, SOSP, PLDI), the IEEE Cybersecurity Award for Practice , the Sloan Fellowship , and the ACM Doctoral Dissertation Award . His work on verifiable computation protocols has influenced blockchain systems, while his research on secure code execution environments contributed to Intel's SGX and TDX technologies. As an advisor, Parno has mentored numerous PhD students including Aymeric Fromherz (recipient of the ACM SIGSAC Doctoral Dissertation Award) and Jay Bosamiya. His lab receives funding from diverse sources including NSF, industry partners, and security foundations. Notably, his work has been incorporated into Windows 8+, iOS 13+, and the Linux kernel. He also serves in leadership roles including Chair of IEEE Computer Society's Technical Committee on Security & Privacy. The Secure Foundations Lab maintains strong industry connections, with alumni joining Microsoft Research, Inria, Northeastern University, and other leading institutions. Recent projects like Verus, Everest, and Ironclad represent the lab's commitment to building end-to-end verified systems that provide rigorous security guarantees while maintaining practical performance.

Fernando Magno Quintão Pereiraمشاهده پروفایل

دانشیار

• Compilers
• Code Generation
• Compiler Optimizations
• +۳ مورد دیگر

Fernando Magno Quintão Pereira is an Associate Professor at the Federal University of Minas Gerais (UFMG), Brazil, specializing in compiler design and program analysis. His academic journey began with a Ph.D. from UCLA in 2008 under Jens Palsberg's supervision, establishing his foundation in compiler research. His research focuses on compilers , with core expertise in code generation , compiler optimizations , and static program analyses . Recent work explores quantum compilation, binary analysis, and security-aware compilation techniques. His publications reveal consistent contributions to major conferences including PLDI, CGO, and SPLASH, with emphasis on practical optimization frameworks and theoretical compiler advancements. Analysis of his 15 most recent publications (2020-2026) shows dominant themes in binary optimization (e.g., AnghaBench), security-aware compilation (e.g., Memory-Safe Elimination of Side Channels), and emerging architecture support (e.g., Quantum Computing Compilation). His work bridges theoretical compiler principles with real-world systems challenges. He actively contributes to the academic community through: Program committees for PLDI (2020-2025), CGO (2021-2026), and SPLASH conferences Leadership roles including CGO Finance Chair (2026) and PLDI Diversity & Inclusion Co-Chair (2023-2024) Organizing JENSFEST 2024 and serving on multiple conference steering committees Pereira maintains an active research group evidenced by continuous publication output and conference leadership, with his personal website ( homepages.dcc.ufmg.br/~fernando/ ) serving as a hub for his academic activities.

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

Clément Pit-Claudel is an assistant professor at École Polytechnique Fédérale de Lausanne (EPFL) in the School of Computer and Communication Sciences, Department of Computer Science. He leads the SYSTEMF lab which he founded in January 2023. Prior to joining EPFL, he was a PhD candidate at MIT with Adam Chlipala and subsequently worked as a senior applied scientist at Amazon AWS. His academic journey began at École Polytechnique in France, followed by doctoral studies at MIT. Dr. Pit-Claudel's research focuses on programming languages, compilers, and formal verification, with broader interests spanning systems engineering, hardware design languages, security, performance engineering, databases, and type theory. His work centers around three main axes: extensible compilation (teaching compilers domain-specific optimization tricks), hardware design languages and verification, and tooling for proof assistants. He has developed several influential systems including Elk (a linear-time engine for JavaScript regexes), Warblre (a Coq translation of JS regex specification), Fiat (a library for correct-by-construction refinement), Narcissus (for verified binary encoders/decoders), F2F (a program extraction framework), Rupicola (a compiler-construction toolkit), Kôika (a rule-based hardware design language), Cuttlesim (a fast hardware simulator), and Alectryon (a literate programming system for Coq). His publications span top venues including PLDI, POPL, ICFP, ASPLOS, and SLE, with recent work focusing on verified JavaScript regular expressions, foundational integration verification of cryptographic servers, and relational compilation techniques. His research aims to build small, fast, and completely verified components for critical systems through a combination of machine-checked proofs, hardware-software co-design, low-level compiler engineering, and new tools for interactive theorem proving. His notable awards include the Distinguished Artifact award at SLE 2020 for 'Untangling Mechanized Proofs,' the William A. Martin Memorial Thesis Award from MIT in 2016, and the Frederick C. Hennie III Teaching Award from MIT in 2016. He has served on program committees for numerous conferences including PLDI, POPL, ICFP, and SPLASH, and has organized workshops such as the Coq Workshop and Proof Systems. As an educator, he teaches 'Software Construction' (undergraduate level, ~400 students) and 'Interactive Theorem Proving' (graduate level) at EPFL. His teaching philosophy emphasizes hands-on learning, continuous assessment through oral examinations, and designing assignments that lead students to build concrete artifacts they can be proud of. His approach is informed by hundreds of hours of in-class instruction in Europe and the US, resulting in stellar student reviews and multiple teaching awards.