Program verification Professors and Supervisors in Greece | ApplySharif

فیلترهای فعال:

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

استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشی‌تان را پیدا کنید و با او ارتباط بگیرید.

نمایش ۱۵۱-۱۶۵ از ۱۶۹ استاد راهنما

اطلاعات این پروفایل‌ها از صفحات عمومی دانشگاه‌ها جمع‌آوری شده و ممکن است به‌روز نباشد.

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

استادیار

National and Kapodistrian University of AthensGreece

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.

پروفایل رسمی دانشگاه

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

استاد

National and Kapodistrian University of AthensGreece

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مشاهده پروفایل

دانشیار

National and Kapodistrian University of AthensGreece

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مشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

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.

پروفایل رسمی دانشگاه

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

استادیار

National and Kapodistrian University of AthensGreece

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مشاهده پروفایل

مدرس

National and Kapodistrian University of AthensGreece

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مشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

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.

پروفایل رسمی دانشگاه

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

استادیار

National and Kapodistrian University of AthensGreece

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مشاهده پروفایل

استادیار

National and Kapodistrian University of AthensGreece

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.

پروفایل رسمی دانشگاه

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

استاد

National and Kapodistrian University of AthensGreece

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مشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

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.

پروفایل رسمی دانشگاه

Ondřej Pavelaمشاهده پروفایل

پژوهشگر

National and Kapodistrian University of AthensGreece

Ondřej Pavela is a researcher at the Faculty of Information Technology, Brno University of Technology, specializing in programming language tools and software verification. His work bridges theoretical computer science with practical static analysis applications. His research focuses on concurrency analysis and static program verification , with core expertise in: Deadlock and atomicity violation detection Performance analysis of concurrent systems Static analyzer plugin development Bug detection in multi-threaded programs At PLDI 2020, he presented novel plugins for the Infer static analyzer framework, demonstrating significant contributions to automated software verification. His work addresses critical challenges in concurrent program reliability through innovative tooling approaches. He actively participates in the programming languages research community through conference contributions like PLDI, focusing on practical implementations that enhance static analysis capabilities for real-world software systems.

پروفایل رسمی دانشگاه

Clément Pit-Claudelمشاهده پروفایل

استادیار

National and Kapodistrian University of AthensGreece

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.

پروفایل رسمی دانشگاه

Nadia Polikarpovaمشاهده پروفایل

دانشیار

National and Kapodistrian University of AthensGreece

Nadia Polikarpova is an Associate Professor in the Computer Science and Engineering Department at the University of California, San Diego. She leads the Programming Systems group and serves as a member of IFIP Working Group 2.8 on Functional Programming since 2022. Her academic journey includes a PhD from ETH Zurich (Switzerland) under Bertrand Meyer's supervision in 2014, followed by postdoctoral work at MIT CSAIL with Armando Solar-Lezama. Her research interests center around program synthesis, program verification, and type systems, with a focus on building practical tools that enhance software security and reliability. Polikarpova's work bridges theoretical foundations with real-world applications, particularly in the emerging area of AI-assisted programming. Her recent publications demonstrate a strong trajectory in program synthesis techniques, with increasing integration of machine learning approaches. The research spans from foundational type-driven synthesis methods to practical applications for validating AI-generated code and synthesizing heap-manipulating programs. Her work frequently appears in top-tier programming languages venues including PLDI, POPL, ICFP, and OOPSLA. 2020 Sloan Fellow 2020 Intel Rising Stars Award 2020 NSF CAREER Award Distinguished paper awards at PLDI'21, ICFP'20, and POPL'19 Best paper award at FM'15 Polikarpova actively mentors PhD students and has advised numerous graduates who now work at Microsoft Research, University of Michigan, and various tech companies. She teaches core programming languages courses including CSE 130 and specialized graduate courses on program synthesis (CSE 291). Her service to the community includes program committee roles for major conferences and co-chairing the Haskell conference in 2022.

پروفایل رسمی دانشگاه

Marc Pouzetمشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

Marc Pouzet is a Professor at École Normale Supérieure (ENS) in the Department of Computer Science (DIENS), where he serves as Director of CS studies. He leads the INRIA project-team PARKAS and was a Junior Member of the Institut Universitaire de France (2007–2012). His research centers on synchronous programming languages for safety-critical embedded systems, with contributions to real-time software verification, hybrid systems modeling, and probabilistic reactive programming. Research Focus Pouzet's work bridges theory and practice in: Synchronous Languages : Design/extensions of Lustre, Lucid Synchrone, and Zelus for embedded control Formal Methods : Mechanized semantics (Coq) and verified compilers (Vélus) for correctness guarantees Hybrid Systems : Integrating ODEs with discrete logic (ProbZelus for probabilistic inference) Real-time Systems : Scheduling, latency constraints, and memory-safe compilation Awards & Leadership Inria–Académie des sciences Innovation Award (2016) Program committees: EMSOFT, PLDI, POPL, ECRTS Associate Editor: EURASIP Journal on Embedded Systems Advising & Projects Supervised 19+ PhD students on topics spanning compiler verification (Bourke, Pesin), probabilistic languages (Baudart), and hybrid systems (Pauget). Leads development of open-source tools: Zelus (synchronous language with ODEs) Vélus (verified Lustre compiler) ReactiveML (reactive extension of OCaml)

پروفایل رسمی دانشگاه