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

• Programming Language Theory
• Semantics of Programming Languages
• Domain Theory
• +۷ مورد دیگر

Gordon Plotkin is a Professor at the School of Informatics, University of Edinburgh, where he is affiliated with the Laboratory for Foundations of Computer Science (LFCS). His research lies at the intersection of theoretical computer science and programming language semantics, with a profound influence on the formal understanding of computation. His research interests include Programming Language Theory, Semantics of Programming Languages, Domain Theory, Operational Semantics, Lambda Calculus, Type Theory, Concurrency Theory, and Algebraic Effects. His seminal work on structural operational semantics and domain theory has laid the foundation for modern semantics of programming languages. His publications span over five decades, showing a sustained and evolving research trajectory from foundational work in lambda calculus and domain theory to recent contributions in algebraic effects, probabilistic computation, and biochemical systems modeling. The articles demonstrate a consistent focus on formal methods, mathematical rigor, and the algebraic structure of computational effects. He has collaborated with leading researchers including Martín Abadi, John Power, Glynn Winskel, and John Reynolds. His work continues to influence both theoretical and practical developments in programming languages and systems. Gordon Plotkin has made foundational contributions to computer science, particularly through his development of structural operational semantics and domain-theoretic models of computation. He has advised numerous researchers and supervised many influential PhD theses, though specific student names are not listed in the provided text. His work has been supported by long-standing affiliations with the Laboratory for Foundations of Computer Science and the University of Edinburgh, and he has contributed to major collaborative projects in programming language design and verification. He is associated with several research groups and labs, most notably the Laboratory for Foundations of Computer Science (LFCS), which serves as a hub for theoretical research in programming languages, semantics, and logic at the University of Edinburgh.

• Programming Language Theory
• Dependent and Refinement Types
• Computational Effects
• +۶ مورد دیگر

Danel Ahman is an Associate Professor at the Institute of Computer Science , University of Tartu , Estonia, specializing in programming language theory . His research focuses on dependent/refinement types , computational effects , and verified software . Education PhD in Theoretical Computer Science (University of Edinburgh, 2017) MPhil in Advanced Computer Science (University of Cambridge, 2012) BSc in Informatics (Tallinn University of Technology, 2010) Research Interests : Danel investigates programming languages with algebraic effects and effect handlers for verified software, exploring denotational/operational semantics and fibrational approaches to effects. His work bridges theoretical computer science with practical formal verification. Scientific Awards : Estonian Research Council grant (2025) Marie Skłodowska-Curie Fellowship (2019) PhD dissertation prize (2018) Google/Citrix dissertation awards (2012) Teaching & Supervision : He teaches courses like Logic in Computer Science and Functional Programming at the University of Tartu, and supervised BSc/MSc theses on topics including asynchronous effects and formal verification. Danel also organizes research seminars and guest lectures on F*.

• Quantum Computing
• Quantum Foundations
• ZX-calculus
• +۷ مورد دیگر

John van de Wetering is an Assistant Professor at the Theoretical Computer Science group of the Informatics Institute, University of Amsterdam, working with the QuSoft research center. He co-authored the open-access book Picturing Quantum Software and developed the PyZX quantum compiler. His research spans quantum computation and quantum foundations, focusing on diagrammatic methods like the ZX-calculus and ZH-calculus. Quantum circuit optimization and verification Quantum foundations via algebraic/compositional methods Co-creator of PyZX His recent publications explore multi-qutrit systems, completeness of graphical calculi, and quantum state representations. Supervises students in quantum computing, including Lia Yeh and Sarah Li. Directs the new Master's program in Quantum Computer Science at UvA. Actively contributes to open-source projects and international conferences. Notable collaborations include Aleks Kissinger, Neil J. Ross, and QuSoft researchers. Uses GitHub for DiZX development (qudit extension of PyZX). No explicit scientific awards mentioned.

Parisa Kordjamshidiمشاهده پروفایل

دانشیار

• Artificial Intelligence
• Machine Learning
• Natural Language Processing
• +۷ مورد دیگر

Parisa Kordjamshidi is an Associate Professor of Computer Science and Engineering at Michigan State University (MSU), leading the Heterogeneous Learning and Reasoning (HLR) Lab. Her research focuses on Neuro-Symbolic AI, spatial language understanding, and structured learning, with notable contributions to frameworks like Saul for declarative programming. She joined MSU in 2019 after roles at Tulane University and the Florida Institute for Human and Machine Cognition. Education: Ph.D. in Computer Science from KU Leuven (2013), postdoctoral research at UIUC's Cognitive Computation Group, and work in the KnowEng project. Research Interests: Artificial Intelligence, Machine Learning, Natural Language Processing, Neuro-Symbolic systems, spatial semantics extraction, structured output learning, and multimodal reasoning. Key projects include NSF CAREER awards for spatial language understanding and ONR grants for integrating domain knowledge into AI. Awards: NSF CAREER (2019), Amazon Faculty Research Award (2022), Fulbright Scholar (2025), and Rising Stars at MIT EECS (2015). Grants: Active projects on Neuro-Symbolic compositional generalization (ONR), spatial language learning (NSF), and collaborations with the Department of Media and Information for health misinformation management. Professional Activities: Editorial roles at JAIR, TACL, and Frontiers journals; service on program committees for ACL, EMNLP, and AAAI; organization of workshops like Spatial Language Understanding (SpLU) and CLeaR. Lab and Software: HLR Lab develops Saul (declarative learning-based programming framework) and tools for spatial role labeling. Her team emphasizes mentoring, with structured weekly meetings, reading groups, and conference participation for students.

Farzaneh Derakhshanمشاهده پروفایل

استادیار

• Type Theory
• Proof Theory
• Programming Languages
• +۷ مورد دیگر

Dr. Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology (Illinois Tech), where she explores logical foundations of concurrency and develops formal methods for program verification. She earned her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Frank Pfenning, followed by a postdoctoral fellowship at CMU with Limin Jia and Stephanie Balzer. Current affiliation: Illinois Tech (since ~2021) Previous affiliation: Carnegie Mellon University (Ph.D. and postdoc) Research focus: Type theory, logical verification, and security for concurrent systems Teaching: Courses on programming languages, type systems, and security Her research addresses fundamental challenges in concurrent programming, including: Developing modal logic frameworks for system verification Designing type systems for intermittent computing Creating behavioral type systems for security guarantees Applying relational logic to GPU security and secure compilation Investigating logical foundations of session-typed processes Formal verification of cyclic process networks Current research trends include: Hybrid dynamic verification for parallel systems Logical approaches to side-channel security Formal methods for cyber-physical systems Crash-resilient computing models Security verification in decentralized applications Noninterference proofs in session-typed concurrency Scientific recognition: NSF SaTC CORE Collaborative Award #2350217 Organizing committee member at Dagstuhl Seminar 26071 Professional leadership: Program committee co-chair for PLACES 2025 Committee roles at LICS 2026, ESOP 2026, ICFP 2025, and ECOOP 2025 Regular reviewer for ACM Transactions journals Laboratory involvement: Co-director of behavioral types research at Illinois Tech Collaboration with Carnegie Mellon's formal verification group Key participant in the FACCT workshop

• Computational Logic
• Declarative Logic Programming
• Answer-Set Programming
• +۵ مورد دیگر

Hans Tompits is an Associate Professor in the Department of Knowledge-Based Systems at Technische Universität Wien (Vienna University of Technology). His research focuses on computational logic, declarative logic programming, and formal methods, with a particular emphasis on Answer-Set Programming (ASP). He coordinates the Master's program in Logic and Computation and leads projects in areas such as formal methods for optimization, fault-tolerant autonomous systems, and algorithmic composition. His work bridges theoretical advancements with practical applications, including tools like SeaLion (an ASP IDE with debugging support) and dlvhex (an ASP-based semantic web reasoner). He has contributed to foundational topics like program equivalence, debugging techniques, and integration of ASP with external systems. His recent projects address challenges in autonomous vehicle architectures, music composition algorithms, and safety-critical system design. Tompits has published extensively on topics ranging from nonmonotonic reasoning and modal logics to the development of declarative programming tools. His interdisciplinary approach spans computer science, mathematics, and AI, with applications in both academic and industrial contexts.

• Theoretical Computer Science
• Artificial Intelligence
• Automated Deduction
• +۶ مورد دیگر

Christian Fermüller is an Associate Professor in the Department of Theory and Logic at the Faculty of Informatics, Technische Universität Wien (TU Wien). His research focuses on theoretical computer science, artificial intelligence, automated deduction, and formal logic systems. He specializes in fuzzy logic, proof theory, and non-classical logics, with contributions to semantic games, dialogue systems, and computational models of reasoning under vagueness. **Research Interests:** Foundations of fuzzy logic and many-valued logics Proof theory and analytic calculi Game-based semantics for non-classical logics Formal models of judgment aggregation and argumentation theory Applications in automated reasoning and computational intelligence **Grants & Projects:** Austrian Science Fund (FWF) projects on graded deontic reasoning (2025–2027), semantic games and analytic calculi (2019–2023), and fuzzy logic foundations (2008–2013) Co-PI of the LogICCC initiative exploring contextualism and fuzzy logic **Teaching:** Courses include logical methods in computer science, quantum computing, and theoretical computer science. Supervised over 15 PhD and master’s theses on topics ranging from semantic games to argumentation frameworks. **Affiliations:** Active in the LogiCS research group and regularly organizes seminars on logic and computation.

Daniel Fruminمشاهده پروفایل

استادیار

• Logic
• Type Theory
• Program Verification
• +۵ مورد دیگر

Daniel Frumin is an Assistant Professor in the Department of Fundamental Computing Science at the University of Groningen, affiliated with the Bernoulli Institute. His research focuses on Logic, Type Theory, and Program Verification, with a particular emphasis on formal methods for concurrency, type systems, and homotopy type theory. He has contributed to foundational work in denotational semantics, modular programming language design, and mechanized verification of concurrent systems. His expertise includes the application of logical frameworks to concurrency models, such as ReLoC (Relational Logic for Concurrent Programming) and the integration of type theories with operational semantics. Recent work explores guarded interaction trees, interval domains in homotopy type theory, and compositional security properties for fine-grained systems. Frumin has published extensively in top-tier venues like ESOP, CONCUR, and ACM POPL, with peer-reviewed contributions on topics ranging from bunched implications in session-based concurrency to formal verification of data structures like concurrent queues. His research often bridges theoretical computer science and practical formal verification, leveraging tools like Coq for mechanized proofs. Collaborations include projects with institutions such as Aarhus University (Denmark) and the University of Bologna, focusing on univalent foundations, categorical semantics, and security verification. His work is supported by grants from the Dutch Research Council (NWO) and industry partnerships like Meta's Folly Library verification efforts. Labs/Teams: Active contributor to the Bernoulli Institute's Formal Methods Group and the Univalent Foundations initiative. His research group specializes in applying type-theoretic and categorical methods to concurrency and verification challenges.

Matteo Acclavioمشاهده پروفایل

استادیار

• Proof Theory
• Logic in Computer Science
• Concurrency Theory
• +۵ مورد دیگر

Matteo Acclavio is an Assistant Professor in Computer Science at the School of Engineering and Informatics, University of Sussex, affiliated with the Foundations of Software Systems (FoSS) research group. A logician specializing in proof theory and its applications to computer science, his work bridges mathematical logic with concurrency theory and process calculi. Education: PhD in Mathematics, Aix-Marseille University, France Master in Discrete Mathematics and Foundations of Theoretical Computer Science, Aix-Marseille University Master in Mathematics, Roma Tre University, Italy Bachelor in Mathematics, Roma Tre University His research focuses on graphical proof systems, linear logic, modal logic, and concurrency theory. Publications highlight contributions to deep inference, sequent calculus, and the intersection of logic with distributed systems. Recent work explores logical frameworks for concurrency, such as choreographic programming, and graphical models for proof systems. He teaches courses like Operating Systems and maintains active collaborations in theoretical computer science.

Brigitte Pientkaمشاهده پروفایل

استاد

• Type theory
• Programming languages
• Logical frameworks
• +۷ مورد دیگر

Brigitte Pientka is a Full Professor in the School of Computer Science at McGill University, where she leads the Computation and Logic group. She received her PhD from Carnegie Mellon University in 2003, and previously studied at the University of Edinburgh and Technical University of Darmstadt. Her educational background includes: PhD from Carnegie Mellon University (2003) Studies at the University of Edinburgh Studies at Technical University of Darmstadt Dr. Pientka's research focuses on developing theoretical and practical foundations for building and reasoning about reliable, safe software systems. She combines theoretical research on logical foundations of computer science in programming languages and verification with system building. Her work spans logics (classical and non-classical), type theory, theorem proving, logic and functional programming, and logical frameworks. She has made significant contributions to the field of contextual types and mechanized metatheory. Her recent publications demonstrate a strong trend toward modal type theory, contextual types, and session types, with applications to functional programming, verification, and meta-programming. She has made significant contributions to the Beluga system, which explores how to combine functional programming with dependently-typed, higher-order data specified in the logical framework LF. Her work often bridges theoretical foundations with practical implementations for mechanized reasoning. Dr. Pientka has received several notable awards: Humboldt Fellowship Test of Time Award @ PPDP'18 for 'Programming with proofs and explicit contexts' Best student paper award at ICLP'03 She is actively involved in mentoring and academic service, having served as PC Chair for ICFP'24, CPP'23 and CPP'24, and as General Chair for POPL'20. She is an Executive Editor of Logical Methods in Computer Science and serves on the editorial boards of the Journal of Functional Programming and ACM Transactions of Computational Logic. She leads the Computation and Logic group at McGill University, which focuses on developing theoretical and practical foundations for reliable software systems through research in logical frameworks, type theory, and programming language design.

Ross Horneمشاهده پروفایل

مدرس ارشد

• Security protocols
• Privacy-preserving technologies
• Concurrency theory
• +۷ مورد دیگر

Ross Horne is a Senior Lecturer in the Department of Computer & Information Sciences at the University of Strathclyde, Glasgow, United Kingdom. He is a member of the StrathCyber and Mathematically Structured Programming research groups. Education: PhD (University of Southampton, 2012), BA (Oxford University, 2005) Prior Appointments: Research Fellow at University of Luxembourg (2018-2023), Senior Research Fellow at Nanyang Technological University (2015-2018), Associate Professor at Kazakh-British Technical University (2012-2015) Research Interests: Dr. Horne's work focuses on security and privacy protocols for digital systems, particularly addressing threats in payment technologies, ePassports, and decentralized identity management (e.g., Solid protocol). His theoretical contributions bridge concurrency theory, proof theory, and logic through applications to security verification and process calculi. Developed formal models for unlinkability in EMV payment protocols Created intuitionistic logical frameworks for process equivalence Explored graphical proof systems beyond formulaic representations Investigated legal-compliant AI for space systems (CubeSat anomaly detection) Scientific Contributions: He has published extensively in top venues including ACM CCS, IEEE CSF, LICS, and CONCUR. His 2017 CONCUR best paper introduced intuitionistic characterizations of bisimilarity. Principal Investigator for EU COST Action on Distributed Knowledge Graphs Co-developed privacy models adopted in Luxembourg parliamentary responses Advising: Currently accepting PhD students with strong mathematical and computer science skills for research in security/privacy of emerging systems. Former student Semen Yurkov completed a thesis on privacy-preserving smart card payments. Interdisciplinary Work: Collaborates with space lawyers through the Interdisciplinary Master Program in Space Resources. Projects include AI for CubeSat reliability and legal-compliant software certification frameworks.

Farzaneh Derakhshanمشاهده پروفایل

استادیار

• Concurrency
• Formal Methods
• Programming Languages
• +۴ مورد دیگر

Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology. She received her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Prof. Frank Pfenning and completed a postdoctoral fellowship at CMU with Profs. Limin Jia and Stephanie Balzer. Her research focuses on formal methods for concurrent and secure systems. Education: Ph.D. in Pure and Applied Logic, Carnegie Mellon University (2021) Dr. Derakhshan's research explores logical foundations for concurrent program design, emphasizing correctness guarantees (safety, reactivity) and security properties (fault tolerance, side-channel protection). Current projects include modal logics for under/over-approximation, relational logic for GPU security, type systems for intermittent computing, and behavioral types for security enforcement. Her work bridges theoretical logic with practical systems challenges. Recent publications (2021-2025) reveal strong thematic continuity in concurrency, security, and formal verification. Key trends include session-typed process models for secure communication, modal type systems for intermittent computing, and logical frameworks for program assurance. These contributions demonstrate consistent innovation at the intersection of programming languages, logic, and cybersecurity. Scientific Awards: No scientific awards are mentioned in the provided text. Advising and Research Funding: Current Students: PhD: Godha Pallavi Bhogadi, Myra Dotzel, Lang Liu; Master's: Akash Madhu Former Students: Narasimha Karthik G. (MS), Griffin Colomer (BSc) Grants: NSF SaTC CORE #2350217: "Mixed Assurance Reasoning via Modal Logic" (2024) Dr. Derakhshan leads an active research group focused on programming language security, collaborating with Carnegie Mellon University researchers. She co-organizes community initiatives including the 2026 Dagstuhl Seminar on Behavioural Types for Resilience and serves on multiple program committees for top programming languages conferences.

Willem Heijltjesمشاهده پروفایل

مدرس ارشد

• Logic
• Proof Theory
• Lambda-Calculus
• +۳ مورد دیگر

Willem Heijltjes is a Senior Lecturer in the Department of Computer Science at the University of Bath. His research focuses on logic and proof theory, particularly on canonical graphical representations of proofs (proof nets) and their applications in lambda-calculus and type systems. He is actively involved in theoretical computer science, exploring foundational aspects of programming languages and computational logic. He leads the project 'Typed Lambda-Calculi with Sharing and Unsharing', funded by the Engineering and Physical Sciences Research Council (EPSRC) from 2019 to 2022. This project investigates advanced type systems and computational models, contributing to the understanding of call-by-value and call-by-name evaluation strategies in the context of linear logic and sequent calculus. His research interests span lambda-calculus, linear logic, proof nets, type systems, and programming language semantics. He has published extensively in top-tier conferences such as CSL, FSCD, and LICS, addressing topics like probabilistic termination, functional machine calculus, and normalization without syntax. He is currently accepting doctoral students in these areas. Heijltjes collaborates internationally on foundational computer science topics, including the development of combinatorial proofs and the exploration of confluence in higher-order rewriting systems.

Lars-Henrik Erikssonمشاهده پروفایل

مدرس ارشد

• Formal Methods
• Logic in Computer Science
• Programming Language Theory
• +۷ مورد دیگر

Lars-Henrik Eriksson is a Senior Lecturer in the Department of Computer Science at Uppsala University, part of the Department of Information Technology. He holds a PhD and is recognized as an Excellent Teacher and educational mentor. He currently serves as the program director for the Master's program in Computer Science and has previously held leadership roles, including Head of the Department of Computer Science from 2004 to 2018. PhD in Computer Science Excellent Teacher Award Pedagogical Mentor at Uppsala University His research focuses on the applications of logic in computer science, particularly formal methods for software development. His work spans formal specification, verification, and synthesis, with strong emphasis on logic programming, interactive theorem proving, and logical frameworks. He has made significant contributions to the use of formal methods in safety-critical domains such as railway signaling. His current research includes modeling application domains within formal methods and formalizing concurrency theory using the Isabelle proof assistant. The recent publications reflect a sustained focus on modal logics for nominal transition systems, formal verification tools (e.g., GTO), and domain-specific applications of formal methods. These works demonstrate deep integration of theoretical logic and practical software engineering, especially in distributed and safety-critical systems. The recurring themes include concurrency, verification, and the use of domain models to enhance formal reasoning. Scientific Awards and Recognitions: Excellent Teacher Pedagogical Mentor Lars-Henrik Eriksson has advised numerous students through project supervision, thesis reviews, and course mentorship, though no formal list of advisees is provided. He has been involved in significant research management, including leading the department and directing a master’s program. He has also collaborated with industry, particularly in railway signaling, contributing to safety analysis and formal verification projects with Trafikverket and through companies he co-founded. He is a board member of Formal Methods Europe and served as program committee chair for the FME Symposium 2002 (part of FLoC’02). His work bridges academia and industry, especially in the application of formal methods to real-world engineering challenges.

Nobuko Yoshidaمشاهده پروفایل

استاد

• Programming Languages
• Concurrent and Distributed Systems
• Formal Verification
• +۴ مورد دیگر

Prof. Nobuko Yoshida is the Christopher Strachey Chair of Computing at the University of Oxford's Department of Computer Science, leading the Programming Languages research theme. She joined Oxford in 2022 from Imperial College London, holding one of the oldest chairs in the department, previously held by Tony Hoare and Samson Abramsky. Her research focuses on session types , notably introducing Multiparty Session Types in 2008, which revolutionized protocol verification and earned the Most Influential POPL Paper Award (2018). Her work spans concurrent and distributed systems , formal verification, and industry collaborations with companies like Red Hat, Google, and EDF Energy. She holds EPSRC funding, is an Honorary Fellow at Glasgow University, and serves on editorial boards for leading journals like ACM Transactions on Programming Languages and Systems. Her research group develops tools such as Scribble for runtime monitoring, deployed in projects like the US Ocean Observatories Initiative. Awards include the British Computing Society Fellowship and EPSRC Established Career Fellowship. She mentors over 19 researchers who have secured academic and industry roles globally. Current students include Ari Hernawan, Kai Pischke, Jessica Richards, and Litu Zou.