Associate Professor Petridou Sofia is a faculty member in the Department of Applied Informatics at the University of Macedonia, specializing in network protocols and performance analysis. Her research focuses on: Optical and Wireless Networks infrastructure Network Protocol design and optimization Probabilistic Model Checking for protocol verification Clustering algorithms for network efficiency She teaches core courses including Business Data Communications, Cloud Technologies, Cryptographic Protocols, Cryptography, Discrete Mathematics, and Performance Analysis for Clouds and Networks. Dr. Petridou holds advanced degrees in Computer Science and Computer Networks from Aristotle University of Thessaloniki.
Pavlos Fafalios is an Assistant Professor at the School of Production Engineering and Management, Technical University of Crete. His research focuses on Information Systems, with specialties in Information Retrieval, Semantic Web, and Knowledge Engineering. He holds a PhD in Computer Science (University of Crete, 2016) and conducted postdoctoral research at L3S Research Center (Germany) and FORTH (Greece). He has been a visiting lecturer at the Hellenic Mediterranean University and actively contributes to the international research community through over 50 publications. His work emphasizes semantic interoperability, knowledge graphs, and interdisciplinary applications in cultural heritage and digital humanities. Education: Diploma in Information and Communication Systems Engineering (University of the Aegean, 2009) Master's in Information Systems (University of Crete, 2012) PhD in Computer Science (University of Crete, 2016) Research interests include: Information Retrieval (e.g., exploratory search, semantic search) Knowledge Engineering (ontology design, data integration) Applications in maritime history, disaster informatics, and circular economy His recent articles explore ontology governance, knowledge graph applications in fact-checking, and semantic interoperability frameworks. Notable achievements include the Marie Skłodowska-Curie Fellowship (2016-2019) and contributions to projects like the Claimskg system.
Nikos Tzevelekos is a Senior Lecturer at Queen Mary University of London's School of Electronic Engineering and Computer Science, affiliated with the Theory Group and the Centre for Fundamental Computer Science. He holds a PhD from the University of Oxford's Department of Computer Science and previously worked as a postdoctoral researcher there. His primary research interests include theoretical computer science, mathematical models of computation, programming languages, and formal methods. He explores game semantics and category theory to develop tools for program analysis and verification. Education: PhD in Computer Science, University of Oxford Research Interests: Dr. Tzevelekos focuses on foundational aspects of computation, including program semantics, automata over infinite alphabets, and the application of formal methods to software verification. His work bridges abstract theoretical models (e.g., game semantics) with practical tools for analyzing and verifying software systems. Awards: 2023: Distinguished Paper Award at LICS Grants & Advising: Lead researcher on the Innovate UK-funded grant Mokapot/Millr: Next Generation Cloud Computing Infrastructure (2019–2020). Labs/Teams: Member of the Theory Group at Queen Mary, contributing to the Centre for Fundamental Computer Science. Collaborates on projects involving automata theory, program equivalence, and formal verification techniques.
Panagiotis Katsaros is an Associate Professor at the Department of Informatics, Aristotle University of Thessaloniki. His research spans formal verification, model-based system design, dependability, security, and simulation-based performance analysis. He contributes to rigorous methods for embedded systems, IoT, and fault-tolerant computing. His work focuses on Formal verification and model checking Model-based design for multi-core and embedded systems Dependability and security of distributed systems Probabilistic analysis of security risks He has published extensively on these topics, with recent works addressing reactive streaming software, IoT systems, and cloud elasticity. His research often bridges theoretical rigor with practical applications in real-time and safety-critical domains. Scientific awards include BEST PAPER AWARD at 17th Panhellenic Conference on Informatics (PCI 2013) BEST PAPER AWARD at 15th Panhellenic Conference on Informatics (PCI 2011) He collaborates with international institutions and has supervised students in software verification and distributed systems. His contributions to conferences like ETAPS, DSN, and COMPSAC highlight his expertise in systems analysis and software reliability.
Giannis Smaragdakis is a Professor at the Department of Informatics and Telecommunications, University of Athens (since 2016). Previously, he held positions at the University of Massachusetts Amherst (2008-2010), University of Oregon (2006-2008), and Georgia Institute of Technology (2000-2006). His research focuses on applied programming languages and software technologies, including program generators, component-based systems, distributed computing models, and program analysis techniques. He teaches courses on Translators . Education: PhD in Computer Science (1999), University of Texas, Austin Master's in Computer Science (1995), University of Texas, Austin Bachelor's in Computer Science (1993), University of Crete Research Interests: Programming language mechanisms (metaprogramming, modular systems) Runtime systems and memory management Static/dynamic program analysis for error detection Awards: None explicitly listed. Grants & Advising: No specific grants or advisees mentioned. Courses taught include translator/compiler design.
Kostas Karpouzis is an Assistant Professor at Panteion University's Department of Communication, Media and Culture. His research focuses on adaptive computing systems, emotional computing, and applying digital games/gamification in education. He has led over 20 EU/Greek projects like Humaine Network (emotion modeling), CALLAS (emotional computing), and iRead (serious games). He serves as IEEE Greece Computer Chapter Chair, Board Member of Corallia’s gi-Cluster (creative industry consortium), and President of the Association of Informatics and Communications Engineers of Greece. His work includes co-editing Springer's 'Emotion in Games: Theory and Practice' and developing TED-Ed courses on emotion recognition. Key awards include Intel's Ultrabook Design Award (2011), Best Learning Game in Europe (2013), and GALA Serious Games competition win (2018). He advocates coding literacy through initiatives like Girls Go Coding and EU Code Week, and engages in science communication via TEDx talks and OpenScience.gr. His research spans AI ethics, culturally-aware AI systems, educational technology, and emotional health apps. Current projects include H2020 ECoWeB for adolescent mental health and H2020 iRead's Navigo game. He teaches courses on artificial intelligence, cultural informatics, and media technologies.
Elvira Albert is a Professor in the Department of Computer Systems and Programming at the School of Computer Science, Complutense University of Madrid, Spain. She leads the COSTA research group, which specializes in formal methods for program optimization and verification, with a strong focus on blockchain technologies and smart contracts. She holds a Ph.D. in Computer Science. Her research encompasses program verification, static analysis, and compiler construction, particularly applied to blockchain ecosystems. The COSTA group has developed influential tools including circom (for arithmetic circuit compilation), CIVER (for circuit verification), EthIR (EVM decompiler), and superoptimizers such as GASOL and SuperStack. Recent publications (2019-2024) demonstrate her expertise in smart contract safety (e.g., SAFEVM), concurrency testing, and bytecode superoptimization using constraint solvers. Her work consistently bridges theoretical formal methods with practical tool development for the blockchain industry. Albert has secured substantial funding from the Ethereum Foundation for multiple projects (GASOL, GREEN, SOPA, FORVES series, ZK-ARCKIT, GREY). She serves as an area editor for Theory and Practice of Logic Programming (TPLP) since 2019. The COSTA group, under her leadership, maintains an active research agenda in blockchain verification, zero-knowledge proofs, and formally verified compilers. Current projects include ZK-ARCKIT for arithmetic circuit analysis and FORYU for formal semantics of Yul.
Hamid Bagheri is an Associate Professor in the School of Computing at the University of Nebraska-Lincoln and a faculty associate of the Institute for Software Research (ISR) at the University of California, Irvine. He co-directs the ESQuaReD Lab and serves on the review boards of IEEE Transactions on Software Engineering and ACM Transactions on Software Engineering and Methodology. His research focuses at the intersection of software engineering, security, and formal methods, with particular expertise in Security of Mobile Devices and IoT Systems Scaling Formal Verification with Machine Learning Software Analysis and Testing Dependable Cyber-Physical Systems Automated Program Repair and Fault Localization His publication record spans top-tier venues including ICSE, ASE, ISSTA, ESEC/FSE, and IEEE/ACM Transactions, with recent work focusing on efficient analysis of Alloy specifications, IoT security, and ML-enhanced formal verification. His research has been recognized with multiple Distinguished Paper Awards. Among his notable awards are: EPSCoR FIRST Award NSF CISE Career Research Initiation Initiative Award SoC Student Choice Outstanding Teaching Award (2023-2024) CSE Outstanding Teaching Award (2020-2021) NSF EPSCoR First Award (2017) Prof. Bagheri has successfully advised multiple PhD students including Mohannad Alhanahnah (now tenure-track faculty at Chalmers University) and Clay Stevens (now tenure-track faculty at Iowa State University). He has received substantial research funding including NSF SHF Research Grants and has been actively involved in conference organization as PC member and track chair across numerous major software engineering venues.
Shachar Itzhaky is an Associate Professor in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa. His research spans multiple areas of programming languages, formal methods, and software engineering, with a focus on making program development and verification more accessible and efficient. He has served on program committees for numerous prestigious conferences including PLDI, POPL, SPLASH, and ICFP. Dr. Itzhaky's research interests center around program synthesis, automated reasoning, and formal verification. His work in program synthesis explores techniques for automatically generating programs from high-level specifications, with applications in end-user programming and software development. In automated reasoning, he has made significant contributions to e-graph based reasoning, invariant inference, and property-directed verification. His research in formal methods focuses on practical applications for program verification, particularly for data structures and security properties. An analysis of his recent publications reveals a strong focus on leveraging advanced formal techniques for practical program understanding and generation. His work consistently bridges theoretical foundations with practical applications, particularly in program synthesis, verification, and end-user programming tools. The trend shows increasing integration of machine learning techniques with traditional formal methods, as well as expanding applications to security and privacy domains. ACM SIGPLAN John C. Reynolds Doctoral Dissertation Award Dr. Itzhaky has been actively involved in the programming languages research community, serving on numerous program committees and contributing to the advancement of formal methods and program synthesis. His work has practical implications for software development tools, security analysis, and end-user programming environments. While specific grant information isn't detailed in the provided text, his extensive publication record in top-tier venues suggests successful funding for his research endeavors. His work on projects like Object Spreadsheets and Lifty demonstrates a commitment to creating practical tools that address real-world programming challenges. Dr. Itzhaky's research is conducted within the vibrant programming languages and formal methods group at Technion's Computer Science department. His work intersects with multiple research threads including program synthesis, verification, and security, suggesting collaboration across these areas within the department. His tools like EPR-based Verification, PDR∀, and VeriCon represent significant technical contributions that likely form the basis of ongoing research projects with students and collaborators.
Mohamed Faouzi Atig is a Professor in Computer Systems at Uppsala University's Department of Information Technology since July 2021, following a progression from Assistant Professor (2014-2018) to Associate Professor (2018-2021). His academic career began with a post-doctoral position at Uppsala University (2010-2012) after earning his PhD from University of Paris Diderot-Paris 7 in 2010, followed by a docent degree (habilitation equivalent) from Uppsala University in 2017. His research focuses on formal verification of concurrent and infinite-state systems, with particular expertise in model checking , weak memory models (including x86-TSO, Release-Acquire), and automata theory applied to string constraints. His work bridges theoretical foundations with practical verification techniques for modern hardware and programming language semantics. Analysis of his publication record reveals a sustained focus on verification challenges in concurrent systems, evolving from foundational work on memory models (2015) to sophisticated techniques for string constraints (2017) and persistent memory (2024-2025). His research demonstrates consistent contributions to top venues like PLDI and POPL, with increasing complexity in handling real-world memory models while maintaining theoretical rigor. At Uppsala University, he has served on program committees for major conferences including POPL, VMCAI, and SPLASH, demonstrating active engagement with the programming languages research community.
Adam Chlipala is a Professor at the Massachusetts Institute of Technology working at the intersection of programming languages, formal methods, and computer systems. His research focuses on building practical verified systems with end-to-end machine-checked proofs, particularly using the Coq proof assistant. His educational background includes a Computer Science undergraduate degree from Carnegie Mellon University (2003) and a PhD in Computer Science from the University of California, Berkeley (2007). Following a postdoctoral position at Harvard University through 2011, he joined MIT as faculty. Chlipala's research spans multiple domains with strong emphasis on dependent types , verified compilation , and hardware-software co-verification . His work consistently bridges theoretical foundations with practical implementation, as evidenced by his development of the Ur/Web programming language and his focus on creating clean-slate hardware-software stacks with formal guarantees. Key research thrusts include cryptographic constant-time verification, side-channel security, and verified tensor compilation. His recent publications (2020-2025) reveal a clear trajectory toward increasingly complex verified systems, with growing emphasis on hardware-software integration, cryptographic implementations, and performance-critical applications. The work consistently leverages Coq for machine-checked proofs while addressing real-world constraints like timing channels and hardware interfaces. Chlipala is the author of the influential textbook Certified Programming with Dependent Types , which serves as a primary educational resource for Coq at numerous institutions worldwide. His professional activities include significant service to the PL community through program committees for major conferences including PLDI, POPL, ICFP, and CPP. He leads research initiatives connecting hardware and software verification, most notably through the DeepSpec project which aims to build fully verified computing stacks. His current work focuses on practical applications of dependent types for business applications through Ur/Web and verified cryptographic implementations.
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).
Derek Dreyer serves as Scientific Director at the Max Planck Institute for Software Systems (MPI-SWS) and holds the position of Honorarprofessor (Honorary Professor) of Computer Science at Saarland University's Saarland Informatics Campus. With a PhD from Carnegie Mellon University, he has established himself as a leading researcher at the intersection of programming language theory and practical software verification. Dreyer's research focuses on developing formal methods that bridge theoretical foundations with real-world systems programming challenges. His work has significantly advanced the theoretical understanding of programming languages, particularly in the areas of type systems, separation logic, and concurrency. He is renowned for his contributions to the formal verification of the Rust programming language, including the influential RustBelt project. His recent publications demonstrate a consistent focus on making formal verification practical for industrial-strength codebases. The research trajectory shows increasing sophistication in handling complex systems properties while maintaining theoretical rigor. His work spans from foundational logical frameworks to applied verification techniques for specific language features and system components. As an academic leader, Dreyer has served as Program Chair for major conferences including POPL and ICFP, and has mentored numerous students and postdocs. He is known for his insightful commentary on academic life, including a widely-read blog post addressing impostor syndrome in research careers. Dreyer leads a vibrant research group at MPI-SWS that collaborates extensively with both academic and industrial partners. His team's work has influenced both theoretical developments in programming languages and practical verification tools used in industry.
Nate Foster is a Professor of Computer Science at Cornell University's Bowers Computing and Information Science college. He also serves as a Visiting Professor at EPFL's Data Center Systems Laboratory during the 2023-24 academic year and as a Visiting Researcher at Jane Street. His research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems, with particular emphasis on software-defined networking. Dr. Foster's educational background includes: PhD in Computer Science from the University of Pennsylvania MPhil in History and Philosophy of Science from Cambridge University BA in Computer Science from Williams College Nate Foster's research spans multiple areas within programming languages and systems. His current work focuses on the design and implementation of languages for programming software-defined networks. He has also made significant contributions to bidirectional languages (also known as "lenses"), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His interdisciplinary approach combines theoretical foundations with practical systems building, seeking to bridge the gap between formal methods and real-world network programming. An analysis of Foster's recent publications reveals a strong focus on network programming languages, particularly NetKAT and P4. His work consistently applies formal methods to networking problems, with increasing emphasis on verification, equivalence checking, and symbolic execution techniques. The research trajectory shows progression from foundational language design to practical verification tools, demonstrating how theoretical programming language concepts can solve real-world networking challenges. Dr. Foster has received numerous prestigious awards for his contributions: Sloan Research Fellowship NSF CAREER Award ACM SIGPLAN Robin Milner Young Researcher Award (2023) Most Influential POPL Paper Award Tien '72 Teaching Award Google Research Award Yahoo! Academic Career Enhancement Award Cornell Engineering Research Excellence Award Morris and Dorothy Rubinoff Award ACM SIGCOMM Rising Star Award As an active member of the programming languages community, Foster has advised numerous graduate students and secured significant research funding through his NSF CAREER award and Google Research Award. He has served in leadership roles for major conferences including PLDI, POPL, and ICFP, demonstrating his commitment to mentoring the next generation of researchers through programs like PLMW@PLDI. His collaborative approach is evident in his extensive co-authorship network across academia and industry. Foster leads research in the area of programming languages for networking, with particular focus on the NetKAT framework for network verification. His work bridges the gap between formal methods and practical networking systems, creating tools that have influenced both academic research and industry practice in software-defined networking. His collaborations with institutions like EPFL and industry partners like Jane Street demonstrate the real-world impact of his research agenda.
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.
