Model Checking Professors and Supervisors in Greece

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.

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

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.

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

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)

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