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

Marcelo Fioreمشاهده پروفایل

استاد

• Category Theory
• Lambda Calculus
• Equational Logic
• +۵ مورد دیگر

Marcelo Fiore is a Professor in Mathematical Foundations of Computer Science at the Department of Computer Science and Technology, University of Cambridge, and a Fellow of Christ's College. His research spans category theory, lambda calculus, equational logic, type theory, and mathematical structures in computer science. University: University of Cambridge Department: Department of Computer Science and Technology Academic Rank: Professor College Affiliation: Christ's College Fiore's work focuses on the intersection of category theory and computer science, particularly in abstract syntax, denotational semantics, and algebraic structures. Recent publications explore combinatorial models, normalization by evaluation, and homotopy type theory applications. 2025: Creation/annihilation operators in mathematical structures 2024: Lawvere theories in toposes and differential linear logic 2023: Homotopy type theory and normalization frameworks 2022: Second-order abstract syntax formalization and quotient types Fiore has advised PhD students including N. Arkor (2022) and O.M. Elsayed (2011), who researched monadic structures and second-order algebraic theories respectively. He contributes to departmental initiatives such as the Accelerate Programme for Scientific Discovery and Data Trusts Initiative at Cambridge.

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

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

Matthew Collinsonمشاهده پروفایل

مدرس ارشد

• Logic
• Theoretical Computer Science
• Information Security
• +۱۲ مورد دیگر

Matthew Collinson is a Senior Lecturer in Computing Science at the University of Aberdeen, where he also serves as Head of Computing Science and Academic Line Manager. He holds an affiliation with the Scottish Informatics and Computer Science Alliance (SICSA) and leads the EPSRC-funded project SSPEDI (Supporting Security Policy with Effective Digital Intervention). Education: BSc Mathematics, University of Edinburgh (1997) MSc Mathematical Logic, University of Manchester (1998) PhD Computer Science, University of Manchester (2003) Research Interests: His research spans theoretical computer science and cybersecurity , focusing on non-classical logics (intuitionistic, modal, substructural), semantics of computation , concurrency theory , and type theory . He applies these foundations to information security , particularly in modelling security policies, access control, and the economics of cybersecurity decisions. His work integrates formal verification , simulation tools (e.g., Gnosis), and game-theoretic models . Publications Trends: Recent publications (2016–2022) emphasize human-centred security , exploring how persuasion and behavioural interventions can reduce cybersecurity vulnerabilities. Earlier works (2008–2015) concentrate on mathematical systems modelling , layered graph logics , and trust domains , bridging high-level policy and low-level system configurations. Projects & Grants: SSPEDI (2017–2020, EPSRC): Human dimensions of cybersecurity policy compliance. ALPUIS (EPSRC consortium): Algebra and logic for security policy and utility. Trust Domains (RCUK/TSB, 2011–2014): Framework for modelling secure information sharing. Seconomics (EU FP7, 2012–2015): Socio-economic impacts of cybersecurity regulation. PhD Supervision: He has successfully supervised PhD students including Kevin McDonald (2014), Barry Taylor (2015), and Robert (Bob) Duncan (2016), whose theses addressed logic-based security architectures, vulnerability analysis, and cloud stewardship respectively. Labs & Teams: His research is conducted within the Computing Science section of the School of Natural and Computing Sciences, leveraging collaborations with National Grid, HP Labs, and other academic partners.

• Graph Representation Learning
• Deep Learning
• Reinforcement Learning
• +۷ مورد دیگر

Jian Tang is an Assistant Professor at HEC Montreal and the Montreal Institute for Learning Algorithms (MILA), as well as an Associate Professor at the Department of Computer Science and Operations Research (DIRO) at Université de Montréal. He is also affiliated with IVADO (Institut de valorisation des données) as a member. His research spans multiple institutions including collaborations with leading biology labs worldwide and access to extensive computational resources through industry partners. Ph.D. in Computer Science, Peking University (2009-2014) Visiting Ph.D. student, University of Michigan (2011.10-2013.8) B.S. in Mathematics, Beijing Normal University (2005-2009) Professor Tang's research focuses on the intersection of deep learning and graph theory, with particular emphasis on geometric deep learning, knowledge graph reasoning, and applications in drug discovery. His work bridges symbolic and neural approaches to create robust reasoning systems that can handle complex structured data. He has pioneered techniques in graph representation learning that have significantly advanced the field of molecular property prediction and protein design. His publication record shows a clear trajectory toward applying geometric deep learning to biological problems, with a growing emphasis on protein design, molecular conformation generation, and multi-omics analysis. Recent work demonstrates sophisticated integration of 3D geometry with deep learning architectures to model complex biomolecular interactions. Canada CIFAR Artificial Intelligence Chairs (CCAI Chair) Tencent AI Lab Rhino-Bird Gift Fund Amazon Faculty Research Award Microsoft-Mila collaboration grant National Research Council Canada (NRC) Collaborative Research and Development Grant Professor Tang actively mentors doctoral and master's students, with six recent graduates working on cutting-edge topics including graph neural networks for reasoning, protein design, and molecular representation learning. His research is supported by substantial funding from industry partners including Microsoft, Amazon, and Tencent, as well as government agencies like NRC. He collaborates extensively with biology labs worldwide, applying AI to solve real-world biomedical challenges. He leads a research group focused on geometric deep learning for drug discovery, with active projects in protein design using geometric-aware models and large language models for multi-omics analysis. The group has access to thousands of GPUs through industry collaborations, enabling large-scale experiments in molecular simulation and generative modeling.

Bala Ayikudi Ramachandrakumarمشاهده پروفایل

پژوهشگر

• Parameterized Verification
• Automata Theory
• Formal Verification
• +۴ مورد دیگر

Bala Ayikudi Ramachandrakumar is a post-doctoral researcher at the Max Planck Institute for Software Systems (MPI-SWS), working under Rupak Majumdar. He holds a Ph.D. from the Technical University of Munich, advised by Prof. Javier Esparza. His research focuses on parameterized verification, automata theory, and formal methods applied to cyber-physical systems and distributed computing. Key interests include the analysis of threshold automata, VASS models, and well-quasi orders. Education: Ph.D. in Computer Science (2019–2024), Technical University of Munich; Prior academic background not explicitly detailed. Research Interests: Parameterized Verification, Automata Theory, Formal Verification, Theoretical Computer Science, Cyber-Physical Systems, and Distributed Systems. His work bridges foundational theory with practical verification challenges in concurrent and networked systems. Publications (2024–2018): Recent work includes decidability results for affine continuous VASS and complexity analyses of threshold automata. Over 15 peer-reviewed articles in top venues like LICS, POPL, and CONCUR. Grants and Awards: None explicitly listed in provided texts.

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

Kazushige Terui is an Associate Professor at the Research Institute for Mathematical Sciences (RIMS), Kyoto University. His research focuses on mathematical logic and its applications to computer science, particularly proof theory, computational complexity, and nonclassical logics. He investigates proof normalization complexity, algebraic reformulations of proof-theoretic techniques, and logical foundations of computation. Terui maintains an active research group at RIMS and teaches courses including Mathematical Logic and Computer Science Fundamentals. Research Interests: Terui's work spans: Proof-theoretic aspects of nonclassical logics (linear logic, substructural logics) Computational complexity of proof normalization in lambda calculus Algebraic reformulation of logical techniques (cut-elimination, interpolation) Denotational semantics approaches to complexity characterization Effective proof discovery methods based on programming language theory Publications: His recent articles primarily explore proof theory, computational complexity, and logical foundations, with frequent focus on lambda calculus, linear logic, and type systems. Works frequently bridge theoretical computer science and mathematical logic. Education & Outreach: Authored the book Can Computers Become Mathematicians? (2015) for general audiences and maintains extensive lecture materials on mathematical logic and computer science foundations.

James Brotherstonمشاهده پروفایل

استاد

• Logic
• Computation
• Separation Logic
• +۵ مورد دیگر

James Brotherston is Professor of Logic and Computation in the Programming Principles, Logic and Verification Group (PPLV) at University College London's Department of Computer Science. His research spans logic, computation, and verification, with a focus on separation logic, cyclic proofs, and automated reasoning for program correctness. Research interests include: Foundations of program verification using separation logic Automated reasoning via cyclic proof systems Concurrency and deadlock detection Formal methods for security and resource management Applications of substructural logics in computer science His publications demonstrate consistent focus on logical foundations of verification, with recent work expanding into concurrency testing and atomic operations compatibility. Trends include theoretical advances in proof systems alongside practical verification tools. Scientific awards and grants: Facebook Testing and Verification Research Award (2019) £6M EPSRC Programme Grant for IRIS project (2018-2024) Facebook Faculty Grant (2015) Multiple EPSRC fellowships and grants totaling over £1.2M (2008-2017) He has supervised 12+ PhD students and research fellows, with current students working on verification of concurrent systems. Leads research in the PPLV group and collaborates internationally on logical frameworks.

Tommaso Moraschiniمشاهده پروفایل

دانشیار

• Algebraic Logic
• Duality Theory
• Universal Algebra
• +۳ مورد دیگر

Tommaso Moraschini is an Associate Professor at the Department of Philosophy of the University of Barcelona (UB) , where he also contributes to the Institute of Mathematics of the UB . He is affiliated with the Barcino research group , focusing on advanced logical systems. Research Interests : Algebraic Logic, Duality Theory, Universal Algebra, Intuitionistic Logic, Modal Logic. Teaching : Abstract Algebraic Logic, Algebraic Logic, and The Algebra of Logic. Recent Publications (2021–2025): Explores topics such as Heyting algebras, structural completeness, epimorphisms, and Leibniz hierarchies, reflecting his expertise in algebraic and mathematical logic. Contact details: Department of Philosophy, University of Barcelona , Carrer de Montalegre 6, 08001 Barcelona, Spain.

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.

Paul Corazzaمشاهده پروفایل

استاد

• Set Theory
• Mathematical Logic
• Large Cardinals
• +۵ مورد دیگر

Dr. Paul Corazza is a Professor of Computer Science and Mathematics at Maharishi University of Management (MUM). He holds a BA from Maharishi International University, an MS and PhD from Auburn University. His research explores the intersection of foundational mathematics (set theory, large cardinals, lambda calculus) with Maharishi Vedic Science principles, particularly the dynamics of wholeness and self-referral systems. Dr. Corazza's work includes pioneering the Wholeness Axiom, which addresses large cardinal foundations through self-referential embeddings. He also contributes to software engineering, designing rules engines for industries like insurance and localization frameworks for tech companies. Education: BA: Maharishi International University MS/PhD: Auburn University Research interests span set theory's infinitary structures, algorithmic foundations rooted in self-referral principles, and applications of Vedic Science to computational models. His work bridges abstract mathematics and practical software systems, emphasizing holistic computational frameworks inspired by universal dynamics. Dr. Corazza has over 15 years of industry experience, including roles at Google and e-Trade, focusing on large-scale software engineering and rules engines. He has authored over 15 papers in mathematical logic and a textbook on logic and computability. Key Contributions: Wholeness Axiom for large cardinal foundations Fixed-point principles in lambda calculus Design of enterprise rules engines using Jess language

• Non-classical logics
• Algebraic Logic
• Universal algebra
• +۳ مورد دیگر

Stefano Bonzio is an Associate Professor of Mathematical Logic at the Department of Mathematics and Computer Science, University of Cagliari, where he previously served as Assistant Professor (2021-2024). He held a Marie Curie Fellowship at the Artificial Intelligence Research Institute of the CSIC (Spanish National Research Council) and conducted postdoctoral research at the University of Turin, Polytechnic University of the Marche, Czech Academy of Sciences, and University of Cagliari. His educational background includes: PhD in Logic, University of Cagliari Master in "Logic, History and Philosophy of Science", University of Florence Bonzio's research centers on non-classical logics—particularly Kleene logics—and their algebraic foundations, with significant contributions to Algebraic Logic and Universal algebra (specializing in Plonka sums). His work bridges theoretical frameworks with practical applications in computer science, focusing on logical systems that handle partiality, inconsistency, and ignorance. This interdisciplinary approach connects mathematical structures with computational reasoning and philosophical inquiry. His recent publications (2023-2025) reveal a concentrated exploration of variable inclusion logics, residuated structures, and algebraic semantics for non-classical systems. Key themes include the structural analysis of Bochvar and McCarthy algebras, numerical semigroups, and formal models of ignorance, demonstrating consistent innovation in logical frameworks for computational and philosophical problems. Scientific recognition includes: Marie Curie Fellowship While no formal advisees are documented in available sources, Bonzio's academic trajectory indicates active mentorship through his postdoctoral collaborations. His research has been supported by prestigious European frameworks like the Marie Curie program, though specific grant details beyond this fellowship remain unreported. No dedicated laboratories or structured research teams are mentioned in current documentation, though his affiliations with multiple international institutions suggest collaborative network-based research practices.

Rohan Frenchمشاهده پروفایل

دانشیار

• Modal Logic
• Non-Classical Logic
• Proof Theory
• +۴ مورد دیگر

Rohan French is an Associate Professor in the Department of Philosophy at the University of California, Davis (UC Davis), where he has been employed since 2018. Previously, he was a post-doctoral researcher at the University of Groningen in the Netherlands. Education: Ph.D. in Philosophy, Monash University (2011) B.A. in Philosophy and Computer Science, Monash University (2006) Research Focus: French specializes in philosophical logic with emphasis on: Modal and non-classical logics Proof theory and semantic paradoxes Formal methods in philosophy Substructural approaches to logic Logic translation and expressivity Publications Overview: His scholarly output primarily explores technical aspects of logic systems, including model theory, dialogical frameworks, and paradox resolution. Recent works demonstrate consistent focus on valuational semantics, proof-theoretic structures, and applications of non-classical logics to philosophical problems. Collaborative research features prominently in his publication record.

David J. Pymمشاهده پروفایل

استاد

• Proof-theoretic semantics
• Reductive logic and proof-search
• Bunched logics
• +۶ مورد دیگر

Professor David J. Pym holds the position of Professor of Information, Logic, and Security at University College London's Department of Computer Science. He is also an affiliated faculty member in the Department of Philosophy and serves as Head of the Programming Principles, Logic, and Verification Group. His roles include Director of UCL's Centre for Doctoral Training in Cybersecurity, and Honorary Research Fellow jointly directing the Centre for Logic, Language, and Information (CeLLi) at the Institute of Philosophy, School of Advanced Study, University of London. Education includes a ScD from the University of Cambridge and a PhD from the University of Edinburgh. His research spans proof-theoretic semantics, reductive logic, security economics, and systems modeling. He leads major grants such as the EPSRC-funded IRIS Programme and the Leverhulme Trust grant on proof-theoretic semantics. His awards include fellowships from the Royal Society of Arts and the Alan Turing Institute. Key publications include foundational work on reductive logic and proof-search, bunched logics, and cybersecurity modeling. He advises on policy matters for the UK government and contributes to interdisciplinary education initiatives in philosophy and computer science.

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

Marek Zaionc is a Professor at the Faculty of Mathematics and Computer Science, Jagiellonian University in Kraków, Poland. He specializes in theoretical computer science, logic, and computability theory. His research focuses on asymptotic properties of logical systems, lambda calculus, and the quantitative analysis of fuzzy logics. He has held visiting positions at institutions including the University of Alabama (USA), University of Buffalo (USA), and Université de Versailles (France). Education and Career: PhD in Mathematics, University of Warsaw (1985) Habilitation, Jagiellonian University (1993) Professor of Mathematical Sciences, Jagiellonian University (2003) Deputy Dean of Faculty of Mathematics and Computer Science (2002–2003) Research Interests: Asymptotic probability in logic and computability Typed lambda calculus and functional programming Quantitative studies of fuzzy logics and non-classical logics Combinatorial analysis of logical terms and structures Grants and Projects: NCN Grant (2019–2023): Investigating asymptotic equivalence in set theories NCBR Grant (2014–2017): Asymptotic methods in lambda calculus and combinatory logic Narodowe Centrum Badań (2010–2013): Quantitative studies in logic and computation Awards and Recognition: While no specific awards are listed, his extensive publications and leadership roles reflect significant contributions to theoretical computer science and logic. Labs and Teams: Active contributor to the Algorithmics Research Group and Foundations of Computer Science initiatives at Jagiellonian University.