جستجوی استاد راهنمای دانشگاهی

Ilias Sakellariouمشاهده پروفایل

استادیار

• Constraint Logic Programming
• Multi-Agent Systems
• Artificial Intelligence
• +۳ مورد دیگر

Ilias Sakellariou is an Assistant Professor in the Department of Applied Informatics at the University of Macedonia. He holds a BSc in Physics from Aristotle University of Thessaloniki, an MSc in Knowledge-Based Systems from the University of Edinburgh, and a PhD in Distributed Constraint Logic Programming from Aristotle University of Thessaloniki. Education: BSc in Physics, Aristotle University of Thessaloniki MSc in Knowledge-Based Systems, University of Edinburgh PhD in Distributed Constraint Logic Programming, Aristotle University of Thessaloniki Research Interests: Constraint Logic Programming, Multi-Agent Systems (BDI, Agent-Based Simulation), AI applications in 5G networks, cloud/network slicing, and distributed systems. His work includes projects like NECOS (cloud slicing) and UNIC (5G network infrastructure). Publications: His research spans agent-based modeling, network slicing, and AI-driven systems. Recent works focus on emotional agents in simulations and 5G infrastructure optimization. Projects & Grants: Participated in EU-funded projects such as NECOS (H2020) and UNIC (FED4FIRE+), contributing to cloud slicing and network architecture design. His work includes software tools like TXStates (NetLogo extensions for state machines) and eX-Machines for evacuation simulations. Labs/Teams: Develops simulation tools for agent-based systems, emphasizing NetLogo extensions for complex agent modeling and validation.

Marakakis Emmanuelمشاهده پروفایل

استاد

• Artificial Intelligence
• Logic Programming
• Knowledge Systems
• +۴ مورد دیگر

Emmanuel Marakakis is a Professor at the Department of Electrical and Computer Engineering (Informatics specialty) of the Hellenic Mediterranean University. He holds a PhD from the University of Bristol (1997) and academic responsibilities for courses like Logic Programming and Artificial Intelligence. He directs the 'Artificial Intelligence and Systems Engineering' research laboratory and has supervised 34 undergraduate and 4 postgraduate theses. Education: PhD: University of Bristol, UK (1997) - Logic Program Development MSc: Concordia University, Canada (1984) - Database Query Generation BSc: University of Ioannina (1979) - Mathematics Research focuses on AI subfields including Logic Programming, Natural Language Processing, and Semantic Web technologies. He authored a widely-used Prolog textbook (2nd ed. 2019). Previously held leadership roles at Technical University of Crete, including Department Chair and Laboratory Director, while contributing to European research programs at FORTH. No specific scientific awards listed, though his work includes 8 journal articles, 16 conference papers, and 171 citations (h-index 7).

Christos Nomikosمشاهده پروفایل

دانشیار

• Algorithm Design and Analysis
• Approximation Algorithms
• Computational Complexity
• +۳ مورد دیگر

Christos Nomikos is an Associate Professor at the Department of Computer Science and Engineering, University of Ioannina. He holds a PhD from the National Technical University of Athens (NTUA) and has been a faculty member since 2003. His roles include teaching and research supervision in computer science disciplines. Education: Diploma in Electrical Engineering, NTUA, 1992 PhD in Computer Science, NTUA, 1997 Research Interests: Christos Nomikos focuses on theoretical computer science and logic, including algorithm design and analysis, computational complexity, formal languages, logic programming, and graph theory. His work explores foundational aspects of programming languages and their semantics, as well as applications in knowledge representation and automated reasoning. Teaching: In the 2024-25 academic year, he teaches Discrete Mathematics II , Principles of Programming Languages , Computational Complexity , and Approximation Algorithms . He emphasizes structured learning approaches and maintains a dedicated ecourse page for students. Advising & Grants: He supervises undergraduate thesis projects in computer science, with a focus on theoretical topics like Turing machine transformations and Boolean grammar algorithms. No explicit grant information is provided in the texts. His advising process involves rigorous academic evaluation and prefers candidates with strong performance in core computer science courses. Labs/Teams: While no specific lab or team affiliations are mentioned, his research collaborations include work with international conferences and journals, indicating active participation in academic networks.

• Numerical Analysis
• Computer Science
• Partial Differential Equations
• +۵ مورد دیگر

Kosmas Iordanidis is a Professor of Mathematics actively involved in teaching courses related to computer science and numerical analysis. His academic contributions include instruction in: Introduction to Computer Science Numerical Analysis II Numerical Solution of Partial Differential Equations (Postgraduate Course) Research interests are evident from his teaching focus, spanning computational mathematics, algorithm design, and numerical methods for differential equations. He has developed extensive educational materials, including lecture notes, slides, and exercises in FORTRAN programming , Boolean Algebra , and Arithmetic Logic Units (ALU). Key technical themes include computer arithmetic, logic function simplification with Karnaugh maps, and numerical solutions for scientific computing. Course materials from 2005–2006 highlight structured teaching across 13 educational weeks, covering topics such as: Computer components and information processing systems Combinational circuits and symbolic languages Microprogramming, memory systems, and high-level language comparisons Applications in BCD arithmetic , Newton-Raphson method , and Gaussian integration

Stamatopoulos Panagiotisمشاهده پروفایل

استادیار

• Artificial Intelligence
• Constraint Programming
• Logic Programming
• +۵ مورد دیگر

Stamatopoulos Panagiotis is an Assistant Professor in the Department of Informatics and Telecommunications at the University of Athens since May 2001. His career spans roles as Lecturer (1993-2001), Collaborating Researcher (1989-1993), and Research Associate (1989-1993) under EU programs. He holds a PhD in Computer Science (1988) and Physics degree (1982) from the University of Athens. Research Focus: Artificial intelligence, constraint programming, natural language processing, and combinatorial optimization. Teaching: Logic programming and introductory programming courses. His work bridges constraint programming with operations research for solving scheduling/resource allocation problems. No scientific awards or publications were listed in the provided text.

Ilias Kapoutsisمشاهده پروفایل

دانشیار

• Organizational Behavior
• Workplace Politics
• Leadership
• +۳ مورد دیگر

Ilias Kapoutsis serves as Associate Professor of Management at Athens University of Economics and Business (AUEB), affiliated with the School of Business and Department of Business Administration. His academic profile combines rigorous theoretical research with practical organizational applications, evidenced by publications in premier journals including Journal of Management and Journal of Organizational Behavior. His educational foundation includes: Bachelor's degree in Business Administration from AUEB Ph.D. in Management from AUEB MSc in Business Information Technology from University of Manchester Dr. Kapoutsis' research program investigates political behavior dynamics in organizations, examining motivational drivers, cognitive logic, and balancing mechanisms that govern workplace politics. He explores leadership integrity, emotional labor consequences, remote work adaptations, and negotiation processes. His work reveals how political will, skill, and prudence interact to shape career trajectories and organizational effectiveness, often employing nonlinear modeling to capture complex behavioral patterns. Analysis of his recent publications (2020-2025) shows evolving focus on leader-follower power dynamics, passion burnout thresholds in healthcare, and phronesis (practical wisdom) in leadership. His methodological approach combines multi-study designs with systematic reviews, contributing to theoretical refinement in organizational behavior through examination of contextual contingencies and boundary conditions. While holding editorial roles as Associate Editor for Frontiers in Psychology: Organizational Psychology and Guest Editor for European Management Journal special issues, no specific scientific awards are documented in available sources. Dr. Kapoutsis leads significant research initiatives including the Greek National Employment Strategy (2021-2027) commissioned by the Ministry of Labour, and UAE National Research Fund projects on public sector strategic planning. His applied work includes founding the Athens Negotiation Tournament in 2019 and extensive consulting for organizations like IKEA, National Bank of Greece, and Ministry of National Defence, translating academic insights into real-world management solutions. Information regarding dedicated research laboratories or specialized teams is not explicitly provided in current documentation.

Elvira Albertمشاهده پروفایل

استاد

• Program Verification
• Program Optimization
• Blockchain
• +۷ مورد دیگر

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.

Işıl Dilligمشاهده پروفایل

دانشیار

• Program analysis
• Program synthesis
• Program verification
• +۴ مورد دیگر

Işıl Dillig is an Associate Professor of Computer Science at the University of Texas at Austin, where she leads the UToPiA research group. Her academic career spans over a decade of significant contributions to programming languages research, particularly in program analysis, verification, and synthesis. Dr. Dillig received all her academic degrees (BS, MS, and PhD) from Stanford University before joining the faculty at UT Austin. Her educational background established the foundation for her innovative research approach that bridges theoretical computer science with practical applications. Her research focuses on developing techniques to make software systems more reliable, secure, and easier to build through advanced program analysis, verification, and synthesis methods. She has pioneered approaches that combine symbolic reasoning with machine learning to tackle complex software engineering challenges across multiple domains including security, databases, and programming language theory. Her work demonstrates exceptional depth in creating practical tools that address real-world software development problems while maintaining strong theoretical foundations. Analysis of Dr. Dillig's publication record reveals a consistent trajectory of innovation in program synthesis, with recent work expanding into neurosymbolic approaches that bridge neural networks with formal methods. Her research shows strong connections between theoretical foundations and practical applications, particularly in security-critical systems, database technologies, and blockchain applications. The evolution of her work demonstrates increasing sophistication in handling complex program structures while maintaining practical usability. Dr. Dillig has received prestigious recognition for her research contributions: Sloan Fellowship NSF CAREER award As a dedicated educator and research leader, Dr. Dillig has served in significant roles including Program Chair for PLDI 2022 and Steering Committee member for PLDI. She has mentored numerous students through her UToPiA research group, guiding research in program synthesis, verification, and analysis. Her work has been supported by substantial research grants that have enabled innovative projects at the intersection of programming languages and security. Dr. Dillig leads the UToPiA (UT Austin Programming, Languages, and Analysis) research group, which focuses on developing novel techniques for program analysis, verification, and synthesis. The group maintains strong collaborations with industry partners and academic institutions worldwide, translating theoretical advances into practical tools that address real software engineering challenges.

Shachar Itzhakyمشاهده پروفایل

دانشیار

• Program Synthesis
• Automated Reasoning
• Functional Programming
• +۵ مورد دیگر

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.

Amal Ahmedمشاهده پروفایل

استاد

• correct and secure compilation
• safe language interoperability
• foreign-function interfaces
• +۹ مورد دیگر

Amal Ahmed is a Professor and Associate Dean for Graduate Programs at Khoury College of Computer Sciences, Northeastern University, where she leads research in programming languages and secure compilation. She received her PhD in Computer Science from Princeton University and has established herself as a leading researcher in compiler correctness, language interoperability, and type systems. Her research focuses on correct and secure compilation across the software-hardware stack and safe language interoperability, including design of sound foreign-function interfaces (FFIs) and richly typed compiler intermediate languages. She makes extensive use of semantics and type systems for reasoning about imperative and probabilistic programming languages, multi-language systems, security, concurrency, and provenance. Her work has significantly advanced the understanding of gradual typing, compiler verification, and compositional language interoperability. Dr. Ahmed's publications reveal a research trajectory focused on building solid semantic foundations for language interoperability and secure compilation. Her recent work spans topics from probabilistic separation logic to WebAssembly interoperability, with consistent emphasis on formal verification and semantic techniques. She has developed frameworks for reasoning about multi-language systems that preserve security properties across language boundaries. NSF CAREER Award recipient Editorial Board: Journal of Functional Programming (2017–present) Editorial Board: Mathematical Structures in Computer Science (2016–present) Member: IFIP Working Group 2.8 (Functional Programming, 2014–present) As an educator and mentor, Dr. Ahmed has advised numerous PhD students, postdocs, and undergraduates, many of whom have gone on to successful academic and industry careers. She has organized the Programming Languages Mentoring Workshop and regularly teaches advanced courses in programming languages. She serves on the steering committees of major conferences including POPL, SPLASH, and PLMW, and has chaired program committees for ESOP and POPL.

Mohamed Faouzi Atigمشاهده پروفایل

استاد

• Formal Verification
• Concurrency
• Model Checking
• +۴ مورد دیگر

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

استاد

• Programming Languages
• Formal Methods
• Computer Systems
• +۵ مورد دیگر

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.

Minki Choمشاهده پروفایل

پژوهشگر ارشد

• Verified Compilation
• Relaxed Memory Concurrency
• Program Logic
• +۲ مورد دیگر

Minki Cho is a Research Fellow in the Department of Computer Science and Engineering at Seoul National University, South Korea. Having completed their Ph.D. in August 2023 with a thesis titled "Simplifying Reasoning under Weak Memory Concurrency," they continue active research while maintaining institutional affiliation. Cho's educational background includes: Sep. 2017 - Aug. 2023: Ph.D. Computer Science and Engineering, Seoul National University Mar. 2014 - Feb. 2017: B.S. Computer Science and Engineering, B.S. Philosophy of Mathematics and Logics (double major), Seoul National University Mar. 2011 - Feb. 2014: Seoul Science High School Cho's research focuses on Verified Compilation , Relaxed Memory Concurrency , and Program Logic , bridging theoretical foundations with practical applications in programming language design and verification. Their work addresses fundamental challenges in weak memory models, compiler optimizations, and formal verification frameworks, with particular emphasis on developing rigorous semantic models that enable practical compiler optimizations while maintaining program correctness. Cho's publication record demonstrates consistent contributions to top-tier venues including PLDI, POPL, and OOPSLA from 2020-2025, showing evolution from foundational work on relaxed memory concurrency toward more comprehensive verification frameworks supporting complex language features like integer-pointer casting and liveness properties. Recognition for Cho's work includes: PhD Dissertation Award, Department of Computer Science and Engineering, Seoul National University (2023) Gold medal in University Students Contest of Mathematics, Korean Mathematical Society (2014) Prior to completing their Ph.D., Cho gained teaching experience as a TA for: Computational Civilization (2020 Spring) Programming Languages (2019 Fall) Principles and Practices of Software Development (2019 Spring/2018 Spring) Principles of Programming (2018 Fall)

Stephen Chongمشاهده پروفایل

استاد

• Programming languages
• Information security
• Language-based security
• +۳ مورد دیگر

Stephen Chong is a Gordon McKay Professor of Computer Science in the Harvard John A. Paulson School of Engineering and Applied Sciences, where he serves as Co-Director of Undergraduate Studies for Computer Science. His academic career spans over a decade of teaching and research at Harvard, where he has made significant contributions to programming languages and information security. Chong received his PhD from Cornell University under the guidance of Andrew Myers, and a bachelor's degree from Victoria University of Wellington, New Zealand. Prior to graduate school, he worked as a consultant and contractor in the software industry, bringing practical experience to his academic research. Professor Chong's research focuses on language-based information security, using programming language techniques to provide information security assurance. His work bridges the gap between theoretical foundations and practical applications, developing tools and frameworks that help programmers write trustworthy programs. His research has evolved to address increasingly complex security challenges in modern computing environments, from web applications to cyber-physical systems. His recent publications reveal a strong trend toward integrating advanced programming language techniques with security analysis, particularly through the use of Datalog, SMT solvers, and program synthesis. His work on Formulog has been particularly influential, extending Datalog with mechanisms to construct and reason about SMT formulas for static analysis. His research has expanded to address security challenges in cyber-physical systems, where sensor attacks pose unique threats to safety-critical infrastructure. Chong has received numerous prestigious awards including an NSF CAREER award, an AFOSR Young Investigator award, and a Sloan Research Fellowship. He has also served in leadership roles for major conferences including CSF 2012-2013, PLMW @ PLDI 2021, and as SIGPLAN-M Chair for 2025-2026. As an educator, Chong has mentored numerous students through Harvard's undergraduate research programs and has served as a thesis advisor. His teaching portfolio includes foundational courses like CS51, systems courses like CS61, and advanced topics in programming languages (CS152) and compilers (CS1530). He has been instrumental in shaping Harvard's computer science curriculum, particularly in security and programming languages. Chong leads a research group focused on language-based security, with projects including Formulog (for SMT-based static analysis), PRINCESS (for autonomous adaptation of software), and work on secure shell scripting (Shill). His group collaborates with researchers across Harvard and other institutions to tackle challenging problems at the intersection of programming languages and security.

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

استاد

• Verification
• Automated Reasoning
• Program analysis
• +۸ مورد دیگر

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).