Constraint Programming Professors and Supervisors in Greece

Byron Cookمشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

Byron Cook is Professor of Computer Science at University College London (UCL) and Director of Automated Reasoning at Amazon Web Services. He leads Amazon's Automated Reasoning Group (ARG) and has driven the broad adoption of formal methods across AWS services. His career spans academia and industry, with significant contributions to program verification and automated reasoning. His research focuses on verification, automated reasoning, program analysis, computer/network security, programming languages, theorem proving, logic, and applications to hardware design, operating systems, and biological systems. Cook's work bridges theoretical foundations with practical applications in cloud security and system reliability, particularly through his leadership in applying formal methods to AWS infrastructure. Cook's recent publications demonstrate a strong focus on applying automated reasoning to cloud security challenges, particularly around access control policies, network reachability, and cryptographic implementations. His work shows a clear trajectory from theoretical program verification toward practical security applications in large-scale cloud environments, with emphasis on making formal methods accessible to developers through "one-click" verification tools. Scientific Awards: FREng (Fellow of the Royal Academy of Engineering) As an academic advisor, Cook has mentored numerous PhD students and interns who have gone on to significant careers in programming languages and verification research. His work at Amazon has secured substantial research funding for developing and deploying automated reasoning tools across AWS services. Cook founded and leads Amazon's Automated Reasoning Group (ARG), which develops tools like IAM Access Analyzer, Tiros, Zelkova, and T2. Previously, he managed the Programming Principles and Tools (PPT) group at Microsoft Research Cambridge, where he co-founded projects including TERMINATOR, SLAyer, and the Bio Model Analyzer (BMA).

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

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

استادیار

National and Kapodistrian University of AthensGreece

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.

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

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.

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

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

دانشیار

National and Kapodistrian University of AthensGreece

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.

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

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.

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

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

استاد

National and Kapodistrian University of AthensGreece

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.

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

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.

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

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

دانشیار

National and Kapodistrian University of AthensGreece

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.

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

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)

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

Koushik Senمشاهده پروفایل

استاد

National and Kapodistrian University of AthensGreece

Koushik Sen is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. His academic career spans major contributions to software engineering and programming languages research through active participation in premier conferences including PLDI, ICSE, and ISSTA. His research focuses on Software Engineering , Programming Languages , and Formal Methods , with particular emphasis on developing software tools that enhance programmer productivity and software quality. Key research thrusts include automated test generation , symbolic execution , fuzzing techniques , and program synthesis . His work bridges theoretical foundations with practical tool development for real-world software verification challenges. Analysis of his publication record reveals consistent contributions to automated testing methodologies, with recent work integrating machine learning (particularly large language models) into traditional program analysis techniques. His research shows strong continuity in improving software reliability through innovative input generation and vulnerability detection approaches. As an active academic leader, he has served as General Chair for MAPL (2020), Program Chair for ISSTA (2017), and committee member for numerous top-tier conferences including PLDI, ICSE, and SPLASH across multiple years. His academic advising manifests through collaborative publications with students on topics like test corpus expansion (Bonsai Fuzzing), visualization synthesis (VizSmith), and smart contract auditing (ItyFuzz), though specific student names aren't listed in the source material. His research has been supported through conference participations and likely associated grants given his extensive publication record.

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

Ilya Sergeyمشاهده پروفایل

دانشیار

National and Kapodistrian University of AthensGreece

Ilya Sergey is an Associate Professor at the National University of Singapore (NUS) School of Computing, with previous faculty appointments at University College London (2015-2018). His academic career spans multiple prestigious institutions including IMDEA Software Institute (postdoctoral position) and KU Leuven (PhD). His educational background includes a PhD in Computer Science from KU Leuven (2012), an MSc in Mathematics and Computer Science from Saint Petersburg State University (2008), and professional experience as a software engineer at JetBrains prior to academia. Sergey's research focuses on the intersection of programming language theory and practical software verification, with particular emphasis on concurrent systems , smart contracts , and program synthesis . His work bridges theoretical foundations in type theory and separation logic with practical applications in blockchain technology and Rust programming. He has developed novel techniques for verifying heap-manipulating programs, analyzing commutativity in distributed transactions, and synthesizing correct-by-construction code. Analysis of his recent publications reveals a clear trajectory toward practical verification of blockchain systems and concurrent data structures, with increasing focus on Rust programming language applications. His work demonstrates consistent innovation in mechanized reasoning techniques while maintaining relevance to real-world software challenges, particularly in the domains of smart contracts and distributed systems. Sergey maintains an active research group at NUS, as evidenced by his social media references to lab traditions and student collaborations. He frequently participates in major programming languages conferences as both author and committee member, serving in leadership roles including General Chair for ICFP 2025. His research lab follows distinctive traditions, including location-based Mattermost status updates when traveling. Sergey is deeply engaged with the programming languages community through conference organization, mentoring activities, and outreach initiatives such as nature walks for conference attendees.

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

Angelo Sifalerasمشاهده پروفایل

استاد

University of MacedoniaGreece

Angelo Sifaleras is a Full Professor at the Department of Applied Informatics, School of Information Sciences, University of Macedonia (Thessaloniki, Greece). He also serves as an Adjunct Professor of Quantitative Methods at the Hellenic Open University. His academic credentials include a Ph.D. in Applied Informatics (University of Macedonia, 2007) and a B.Sc. in Mathematics (Aristotle University of Thessaloniki, 1999). Research Focus: Professor Sifaleras specializes in Mathematical Programming , Network Optimization , and Heuristic Methods . His work integrates computational optimization with real-world logistics, supply chains, and sustainable systems. Key research themes include metaheuristic algorithms for vehicle routing, pollution-aware logistics, and parallel computing solutions for network analysis. Publication Trends: His 15 most recent articles emphasize hybrid metaheuristics (e.g., combining reinforcement learning with Variable Neighborhood Search), sustainable supply chain modeling, and high-performance computing applications. Dominant domains include operations research, environmental optimization, and educational algorithm visualization. Teaching & Service: He instructs courses in Combinatorial Optimization, Linear Algebra, and Heuristic Methods, employing tools like CPLEX, Gurobi, and SageMath. As an editor for Operations Research Forum and the Yugoslav Journal of Operations Research , he supports academic discourse in optimization. A Senior ACM member, he contributes to conferences like ICVNS and ITS.

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