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

Steve Awodeyمشاهده پروفایل

استاد

• Category Theory
• Homotopy Type Theory
• Algebraic Set Theory
• +۹ مورد دیگر

Steve Awodey is a Professor of Philosophy and Mathematics at Carnegie Mellon University, affiliated with the Dietrich College of Humanities and Social Sciences and the Department of Philosophy. His research bridges Category Theory, Homotopy Type Theory, and Algebraic Set Theory, with significant contributions to constructive mathematics and the philosophy of type theory. PhD in Mathematics, University of Chicago (1997), dissertation: Logic in Topoi: Functorial Semantics for Higher-Order Logic Awodey's work focuses on the intersection of categorical logic, homotopy theory, and constructive mathematics. He co-founded the Univalent Foundations Program at the Institute for Advanced Study and leads the Hoskinson Center for Formal Mathematics at CMU. His recent publications explore algebraic models of type theory, cubical set models, and higher categorical structures. His research output spans formal verification, proof-theoretic semantics, and topos-theoretic interpretations of modal logic. The 15 most recent articles emphasize Homotopy Type Theory (HoTT), polynomial functors, and applications of algebraic geometry to intuitionistic logic. Trends include univalent foundations, higher inductive types, and model category-theoretic approaches. Scientific Awards: The Dean's Chair in Logic, Carnegie Mellon University Participant Support Grant for Homotopy Type Theory Conferences NSF Grant for Homotopy Type Theory Research Advising and Grants: Awodey has advised numerous PhD students across philosophy, mathematics, and computer science on topics like Martin-Löf complexes, polynomial pseudomonads, and synthetic homotopy theory. He has secured multiple NSF grants for HoTT research and conference support, with affiliations to the Institute for Advanced Study and nLab collaborative projects. Labs and Teams: He leads the Hoskinson Center for Formal Mathematics and collaborates with the Laboratory for Symbolic and Educational Computing at CMU. His work engages international research groups in categorical logic and higher category theory.

Hak-Keung Lamمشاهده پروفایل

استاد

• Fuzzy Control Systems
• Neural Networks
• Control Theory
• +۴ مورد دیگر

Dr. Hak-Keung Lam is a Reader in the Department of Engineering at King's College London, part of the Faculty of Natural, Mathematical & Engineering Sciences. He holds an IEEE Fellowship and has been a Clarivate Web of Science Highly Cited Researcher since 2018. His research focuses on fuzzy control systems, neural networks, stability analysis, and their applications in biomedical and engineering domains. Education: Dr. Eng. (2000), B. Eng. (1995), both from Hong Kong Polytechnic University. Research Interests: Fuzzy modeling, neural network-based control, computational intelligence, machine learning, and biomedical applications such as ECG/EEG signal classification. His work bridges theoretical advancements with practical implementations in robotics, autonomous systems, and healthcare technology. Publications: Over 480 publications (as of 2023) in top-tier journals and conferences, with a focus on control systems, fuzzy logic, and intelligent systems. Recent work includes fault-tolerant control, cyber-physical systems, and explainable AI. Awards: IEEE Fellow (2019), 1st Place in PhysioNet Computing in Cardiology Challenge (2022). Grants/Projects: Active projects include fuzzy control system stabilization, autonomous robots in healthcare environments, and networked control of robotic systems. Labs/Teams: Center for Robotics Research, contributing to solutions for societal challenges through robot-centric approaches.

Stuart Kurtzمشاهده پروفایل

استاد

• Theoretical Computer Science
• Computational Complexity Theory
• Type Theory
• +۴ مورد دیگر

Stuart Kurtz is a Professor in Computer Science and the College at the University of Chicago, and serves as Master of the Physical Sciences Collegiate Division. He holds the endowed position of George and Elizabeth Yovovich Professor. His research focuses on theoretical computer science, including computational complexity theory, randomness in computation, type theory, and formal logic. He has contributed to foundational areas such as the Berman-Hartmanis Isomorphism Conjecture and the computational properties of random sets. Kurtz is affiliated with the Theoretical Computer Science and Programming Languages Groups at the University of Chicago. He has been recognized with the 2009 Quantrell Award for teaching excellence. His service roles include Director of Undergraduate Studies and Department Chair in Computer Science. He actively mentors Ph.D. students and has advised multiple graduates in complexity theory and related fields. His academic background includes a Mathematics Ph.D. from the University of Illinois, supervised by Carl Jockusch. He approaches type theory as an intersection of formal logic and functional programming. Research interests span measure-theoretic randomness, computational logic, and complexity class separations. His recent work explores connections between theoretical computer science and interdisciplinary fields like physics and statistics. In teaching, Kurtz has instructed courses such as Formal Language Theory, Discrete Mathematics, and Honors Intro Programming. His service contributions include roles in the Computation Institute and Toyota Technological Institute at Chicago. His lab affiliations and collaborative work reflect a strong commitment to advancing theoretical foundations in computer science.

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.

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

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.

Peter Dybjerمشاهده پروفایل

استاد

• Intuitionistic Type Theory
• Categorical Type Theory
• Proof Assistants
• +۹ مورد دیگر

Peter Dybjer is a Professor of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology in Sweden. He is a leading researcher in the field of type theory, with a focus on intuitionistic type theory, categorical semantics, and proof assistants. His work bridges foundational aspects of mathematics and computer science, emphasizing constructive methods and formal verification. Research Interests: Intuitionistic Type Theory and its categorical semantics Proof assistants and formal verification Inductive and inductive-recursive definitions Game semantics and normalization techniques Dependent type systems and their applications Homotopy Type Theory and univalent foundations Activities & Contributions: Editor of the Bulletin of Symbolic Logic Member of program committees for conferences like TYPES, FSCD, and MFPS Keynote speaker at events including the European Congress of Mathematics and the Hausdorff Research Institute's Summer School on Types, Sets, and Constructions Initiated and directed the Master's Program in Computer Science – Algorithms, Languages, and Logic at Chalmers Teaching & Outreach: Professor Dybjer has taught advanced courses at international summer schools, including: Inductive Definitions in Constructive Type Theory (TYPES Summer School, 2005) Dependent Types at Work (LerNet Summer School, Uruguay, 2008) Normalization by Evaluation (Midlands Graduate School, 2009 and 2015)

Thomas Piechaمشاهده پروفایل

پژوهشگر

• Constructive Semantics
• Proof Theory
• Logic
• +۳ مورد دیگر

Dr. Thomas Piecha is an active researcher and academic staff member in the Department of Computer Science at the University of Tübingen's Faculty of Mathematics and Natural Sciences. Since 2009, he has contributed significantly to proof-theoretic semantics and logic research, while also serving as Managing Director of the Carl Friedrich von Weizsäcker Center since 2021. His international collaborations include visiting positions at Paris 1 Panthéon-Sorbonne (2014/15, 2018/19) and PUC Rio de Janeiro (2020). Dr. Piecha's research focuses on constructive semantics, general proof theory, proof-theoretic semantics, hypothetical reasoning, and game-theoretic approaches to logic. His work bridges computer science, philosophy, and mathematical logic, examining foundational questions about meaning, validity, and inference. He approaches logical systems through their proof structures rather than model-theoretic semantics, investigating how meaning emerges from inferential practices. His recent publications (2021-2025) show a clear trend toward integrating Popper's philosophical insights with contemporary proof theory while continuing to address fundamental problems in constructive semantics. The articles demonstrate consistent focus on completeness problems in proof-theoretic frameworks, logical constants, and the philosophical implications of different semantic approaches to logic. His notable recognition includes: Teaching Award of the Study Commission at the Department of Computer Science (WS 2023/24) Dr. Piecha has secured significant research funding through multiple collaborative projects including DFG-funded initiatives like 'Constructive Semantics and the Completeness Problem' (2019-2023) and joint French-German projects such as 'BEYOND LOGIC' (2015-2019). His research program has been consistently supported by major funding bodies including DFG, ANR, VolkswagenStiftung, and the European Science Foundation. He actively contributes to the academic community through conference organization including the Hilbert-Bernays Summer School on Logic and Computation (2019) and multiple workshops on 'Can software be responsible?'. His work with the Carl Friedrich von Weizsäcker Center since 2021 represents an institutional commitment to interdisciplinary research bridging technical and philosophical aspects of logic.

Carsten Schürmannمشاهده پروفایل

استاد

• Information Security
• Cryptographic Voting Protocols
• Security Analysis
• +۵ مورد دیگر

Carsten Schürmann is a Professor of Theoretical Computer Science at IT University of Copenhagen, where he serves as Center Manager for the Center for Information Security and Trust. His research spans information security, cryptographic voting protocols, identity management, and digital democracy, with significant contributions to security ceremonies and formal verification of protocols. Professor, Department of Computer Science Center Manager, Center for Information Security and Trust Principal Investigator for multiple DIREC projects through 2025 Active researcher with 64 publications and 20 projects listed His research focuses on the intersection of theoretical computer science and practical security challenges, particularly in voting systems and security ceremonies. Schürmann has developed formal methods for analyzing security protocols, with emphasis on human factors in security implementations and cryptographic voting systems. His work bridges logical frameworks with real-world security applications, addressing both technical and socio-technical aspects of security. Analysis of his recent publications reveals a strong emphasis on voting security, with multiple papers on risk-limiting audits, receipt-free voting, and election integrity. His work increasingly incorporates formal logical frameworks to verify security properties, while also addressing human factors in security ceremonies. The research spans theoretical foundations in linear logic to practical applications in election systems. As Principal Investigator, Schürmann leads several major projects funded by the Innovation Fund Denmark, including DIREC initiatives focused on Capacity Building, PhD School, Voting, and Entrepreneurship (2020-2025). He has also established working groups in Adversarial AI and Machine Learning. Organized workshops on Code Scanning (2014) and Verifying Security Protocols in Tamarin (2016) Active media commentator on security issues with 311 media appearances through 2025 Principal Investigator for 7 ongoing and 13 completed research projects Schürmann directs the Center for Information Security and Trust, which serves as a hub for interdisciplinary security research connecting theoretical computer science with practical security applications. His center focuses particularly on voting systems security and security ceremonies, bringing together researchers from multiple disciplines to address complex security challenges.

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.

• Cybersecurity and privacy
• Logic
• Mathematical logic
• +۷ مورد دیگر

Professor David Pym serves as Professor of Information, Logic, and Security in the Department of Computer Science at University College London (UCL), where he maintains an active research program bridging theoretical computer science, mathematical logic, and practical cybersecurity applications. Professor Pym's research spans several interconnected domains: Cybersecurity and privacy, with particular focus on security support interactions and trust-building mechanisms in organizational settings Mathematical logic, especially proof theory, semantics, and resource-aware logical systems Formal methods for system modeling, verification, and interface theory Reductive reasoning and inferentialist approaches to logical frameworks His recent publications reveal a significant evolution from purely theoretical logical frameworks toward practical applications in cybersecurity. A distinctive trend is his development of base-extension semantics applied across multiple logical systems, combined with increasing collaboration with cybersecurity researchers to address real-world security challenges through logical frameworks. His work demonstrates how foundational logical research can inform and improve security practices, particularly through co-design methodologies that integrate diverse perspectives in security modeling. Professor Pym maintains an active collaborative research program with colleagues including Gheorghiu, Gu, Caulfield, and Bujorianu, producing significant contributions to both theoretical foundations and practical applications in information security. His approach uniquely combines rigorous formal methods with practical considerations of implementation and human factors in security systems.

• Formal Verification
• Logic
• Cryptography
• +۳ مورد دیگر

Rajeev Gore is a Professor in the Department of Data Science & AI at Monash University. His research focuses on formal verification, automated theorem proving, and logic systems. He has contributed significantly to areas including modal logics, voting system verification, and cryptographic protocols. Gore has been actively involved in developing verified decision procedures for modal logics and exploring applications in electronic voting systems. His work bridges theoretical computer science and practical applications, with a particular emphasis on ensuring correctness through formal methods. Key contributions include the N-PAT nested model-checker and verified verifiability frameworks for voting systems like BeleniosVS and ElectionGuard. His research also addresses trust domains and cryptographic applications, reflecting a deep engagement with both foundational and applied aspects of logic and computation. Gore's publications span over two decades, demonstrating sustained contributions in formal systems, automated reasoning, and security-critical applications. His work often combines rigorous mathematical foundations with practical tool development, emphasizing trustworthiness and verifiability in complex systems.

ŞERİF ÖZLÜمشاهده پروفایل

دانشیار

• Fuzzy Logic
• Decision Support Systems
• Neutrosophic Sets
• +۴ مورد دیگر

ŞERİF ÖZLÜ is an Associate Professor at Gaziantep University , currently affiliated with the Nizip Vocational School in the Department of Food Processing . He previously served as a Doctor Teaching Staff member at the same institution. Education PhD in Mathematics , Nevşehir Hacı Bektaş Veli University (2011-2015) MSc in Mathematics , Gaziantep University (2009-2011) BSc in Mathematics , Afyon Kocatepe University (2004-2008) Research Interests Özlü’s work focuses on advanced fuzzy logic frameworks, including Bipolar-Valued Type-2 Fuzzy Sets , Neutrosophic Operational Research , and Soft Set Theory . His research integrates these concepts into Multi-Criteria Decision Making (MCDM) problems, with applications in engineering, business, and technology. Key methodologies include aggregation operators (Dombi, Choquet), similarity measures (Dice, Cosine), and hybrid systems combining fuzzy logic with probabilistic or temporal models. Publication Trends Özlü has published extensively in 2024-2025 on cutting-edge fuzzy logic extensions like probabilistic hesitant fuzzy sets and q-rung orthopair models . Earlier works (2014-2021) explored foundational topics in soft set theory, neutrosophic sets, and their algebraic properties.

• Algebra
• Number Theory
• Ordered Algebraic Structures
• +۳ مورد دیگر

Assoc. Prof. Serife Yilmaz serves as an Assistant Professor in the Department of Mathematics at Karadeniz Technical University's Faculty of Science, a position she has held since 2017 following prior appointments as Lecturer PhD (2011-2017) and Lecturer (2010-2011) at the same institution. Her academic credentials include: Doctorate in Mathematics, Karadeniz Technical University (2005-2011) Postgraduate in Mathematics, Erciyes University (2002-2004) Undergraduate in Mathematics, Erciyes University (1998-2002) Dr. Yilmaz's research centers on Algebra, Number Theory, and Ordered Algebraic Structures with specialization in Fuzzy Mathematics, Lattice Theory, and Soft Set Theory. Her work investigates triangular norms, hyperstructures, and fuzzy logic applications, recently expanding into cryptographic implementations. She maintains active contributions to both theoretical foundations and practical applications in algebraic systems. Analysis of her 14 journal publications (2007-2025) reveals consistent focus on lattice-based structures and fuzzy algebraic systems, with notable evolution from foundational triangular norm research toward cryptographic applications. Her recent 2025 publications demonstrate integration of lattice theory with encryption methods, reflecting interdisciplinary expansion while maintaining core algebraic expertise. She has advised two graduate theses and participated in one research project. Academic service includes thesis jury memberships at Giresun University (2019) and assistant professorship appointment committees at Black Sea Technical University (2018). Additional professional activities include jury service for national folk dance competitions organized by the Turkish University Sports Federation and Turkish Folk Dance Federation (2013-2016), demonstrating engagement beyond core academic duties.

Stephanie Balzerمشاهده پروفایل

استادیار

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

Dr. Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. Her research focuses on enabling failure-free software through formal methods like type systems and verification logics. She emphasizes compositional proofs for scalability and practical validation via software artifacts. Programming Languages Type Theory Program Verification Concurrency & Security Her recent work explores timed protocols, disentanglement logic, and multiparty session types. Articles demonstrate semantic logical relations for termination (2025), deadlock freedom in Rust embeddings (2022), and information flow control (2024). Key collaborative papers address cyclic process networks and separation logic frameworks. Scientific recognition includes: NSF CAREER Award (2025) ACM SIGPLAN Distinguished Paper (2022) ECOOP Distinguished Paper (2022) She supervises PhD candidates Yue Yao, Yinsen Zhang, and Zak Kent (with Guy Blelloch), plus Master's student Sonya Simkin. Former advisee Jules Jacobs received Cum Laude distinction at Radboud University. Active in academic service, Balzer chairs PLMW@POPL workshops and co-organizes Oregon Programming Language Summer School. She serves on program committees for LICS, POPL, and ICFP.