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

Amin Timanyمشاهده پروفایل

دانشیار

• Programming Languages
• Type Theory
• Logical Relations
• +۹ مورد دیگر

Amin Timany is an Associate Professor in the Department of Computer Science at Aarhus University, Denmark, where he conducts research in programming languages, type theory, and formal verification. He is a member of the Logic and Semantics Group and actively contributes to the development of logical relations, separation logic, and proof assistants such as Coq and Iris. He holds a PhD in Computer Science from KU Leuven (2018) and was previously a postdoctoral fellow with FWO at KU Leuven. His research focuses on mechanized semantics, program equivalence, concurrency, and distributed systems verification. He is particularly known for solving the long-standing problem of proving encapsulation in the ST monad using logical relations. His recent publications span top-tier venues including POPL, ICFP, PLDI, and CPP, with key contributions in guarded interaction trees, higher-order separation logic (e.g., Trillium), and modular verification of CRDTs and virtual machines. His work emphasizes formalization and mechanization in Coq, often within the Iris framework. He has served on numerous program committees and has chaired conferences such as CPP and sessions at CoqPL. Notably, his paper 'Modular Denotational Semantics for Effects with Guarded Interaction Trees' received a Distinguished Paper Award at POPL 2024. PhD, KU Leuven, 2018 MSc, TU Dresden, 2013 He teaches courses such as Compilation, Program Logics, and Advanced Topics in Programming Language Theory. He collaborates extensively with researchers like Lars Birkedal, Robbert Krebbers, and Derek Dreyer, and mentors students in formal methods and PL theory.

• Type Theory
• Programming Language Semantics
• Formalization of Mathematics
• +۷ مورد دیگر

Niccolò Veltri is an Assistant Professor in the Department of Software Science at Tallinn University of Technology, Estonia. He is a member of the Logic and Semantics research group and co-organizes the Theory Seminar (TSEM). His primary research interests lie in Type Theory , Programming Language Semantics , Formalization of Mathematics , and Categorical Proof Theory . His work emphasizes rigorous formalization using proof assistants, particularly Agda, to develop and verify complex logical and computational systems. The recent publications highlight a consistent focus on foundational aspects of logic and computation. Key themes include the formalization and metatheory of substructural and non-commutative logics (e.g., Lambek calculus, skew monoidal categories), the use of focusing for proof normalization, the semantics of process calculi (CCS, π-calculus) in guarded and cubical type theories, and the constructive treatment of coinductive data and final semantics. The consistent use of Agda for formalization is a hallmark of his research output. No scientific awards were mentioned in the provided text. Niccolò Veltri advises several PhD students, including Michel Smykalla, Ioannis Andreou, Andrea Laretto, Michele De Pascalis, Philipp Joram, and Cheng-Syuan Wan, often in collaboration with Tarmo Uustalu and Fosco Loregian. There is no mention of specific grants in the provided text. He is a core member of the Logic and Semantics research group at the Institute of Computer Science, Tallinn University of Technology, which drives his collaborative research and the organization of the Theory Seminar (TSEM).

Ranald Cloustonمشاهده پروفایل

مدرس

• Computer Science
• Mathematical Logic
• Formal Methods
• +۳ مورد دیگر

Ranald Clouston is a Lecturer in the ANU College of Systems & Society at the Australian National University. His research focuses on developing logics and type systems to ensure well-behaved computational processes and support formal mathematics. He holds a PhD from the University of Cambridge (2010) and previously worked as a research fellow at ANU, a postdoc and assistant lecturer at Aarhus University in Denmark, before returning to ANU in 2018. His research interests span theoretical computer science and mathematical logic, including modal logics, dependent type theory, program verification, and categorical semantics. Recent work emphasizes integrating modal operators into type systems, developing guarded recursion frameworks, and advancing formal methods for reasoning about infinite structures and mutable resources. Ranald’s publications reflect a deep engagement with foundational issues in logic and programming semantics. His articles explore topics such as interpolation theorems for tense logics, modular proof systems for separation logics, and guarded type theories for coinductive reasoning. These contributions highlight his expertise in bridging abstract logical principles with practical computational applications. While no specific scientific awards are listed, his academic trajectory demonstrates sustained scholarly achievement. His advising and grant activities remain unspecified in available records. No lab or team affiliations are explicitly mentioned in the provided information.

• Program Verification
• Programming Language Design
• Logic
• +۶ مورد دیگر

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge, affiliated with the Computer Laboratory and a Fellow of Trinity College . His research focuses on program verification, programming language design, and the intersection of logic, semantics, and type theory. PhD in Computer Science from Carnegie Mellon University (2011) His work addresses foundational challenges in programming languages, including refinement type systems with explicit proofs, deterministic parsing with fused lexing, and verification of systems code using separation logic. He has also contributed to bidirectional typechecking, higher-order reactive programming, and logical models for concurrency. Recent publications highlight trends in refinement types with explicit proof terms, parser combinator optimization, and formal verification of C and WebAssembly code. These works span type theory, denotational semantics, and practical compiler design. Distinguished Paper Award, POPL 2020 Distinguished Paper Award, PLDI 2019 He has collaborated extensively on projects involving functional reactive programming, logical relations, and substructural type systems. His contributions include the design of the flap parser library and the Datafun language, which extends Datalog with higher-order features.

Reuben Roweمشاهده پروفایل

مدرس ارشد

• Formal Program Verification
• Proof Theory
• Type Systems
• +۵ مورد دیگر

Reuben Rowe is a Senior Lecturer in the Department of Computer Science at Royal Holloway, University of London . He previously held postdoctoral positions at the University of Kent (PLAS group) and University College London (PPLV group), and served as a Teaching Fellow at Imperial College London for their MSc in Computing Science. Educational Background BA in Computer Science from University of Cambridge Computer Lab (2004), Fitzwilliam College MSc (Distinction) in Advanced Computing from Imperial College London (2008) PhD in Computer Science from Imperial College London (2013) Research Interests focus on formal program verification , non-wellfounded proof theory , and type systems , particularly intersection types and guarded recursive types . His work explores fundamental models of computation (Lambda Calculus, Term Rewriting Systems), Curry-Howard Isomorphism , and logics for computer science . He has advanced cyclic proof systems for program termination and contributed to tools like ROTOR (OCaml refactoring) and Cyclist (cyclic theorem proving). Publication Trends highlight expertise in automated verification frameworks, cyclic proof structures, and formal models for functional and imperative programming. Key collaborations include James Brotherston , Liron Cohen , and Simon Thompson , funded by EPSRC grants EP/N028759/1 and EP/K040049/1 . Teaching includes first-year programming labs (CS1822) and Object-Oriented Programming II (CS1812/13). He maintains an academic webpage and ORCID profile .

Amin Timanyمشاهده پروفایل

دانشیار

• Programming Languages
• Formal Methods
• Type Theory
• +۳ مورد دیگر

Amin Timany serves as an Associate Professor in the Department of Computer Science at Aarhus University, Denmark. His research focuses on foundational aspects of programming languages and formal verification systems, with particular expertise in logical frameworks for program correctness. His primary research interests span: Programming Languages Theory Formal Methods and Verification Type Systems and Type Soundness Separation Logic for Concurrency Logical Relations and Denotational Semantics Mechanized Proof Systems Analysis of Timany's recent publications (2022-2025) reveals a strong emphasis on separation logic extensions for distributed systems, guarded recursion techniques, and type soundness proofs. His work frequently bridges theoretical foundations with practical verification challenges, particularly in capability-based security and CRDT verification. The publications demonstrate consistent contributions to top venues including POPL, PLDI, and CPP. Timany actively participates in academic service, having served as conference chair for CPP 2025. His research involves significant collaboration with international teams, particularly with researchers at Aarhus University and other European institutions. The publication record shows steady output with 40+ research items, including 2 PhD supervisions noted in his profile.

Robbert Krebbersمشاهده پروفایل

دانشیار

• Semantics
• Separation logic
• Theorem proving
• +۱۳ مورد دیگر

Robbert Krebbers is an Associate Professor in the Department of Software Science at Radboud University Nijmegen, Netherlands. His research focuses on advancing program verification techniques for complex programming paradigms such as concurrency, higher-order functions, and modular code, with applications to systems languages like C, Rust, and Scala. He develops rigorous mathematical foundations and practical verification tools, primarily using the Coq proof assistant. His most significant research contribution is as co-designer and co-leader of Iris , a highly influential framework for concurrent separation logic in Coq. Iris has been widely adopted in verification projects worldwide. Before returning to Radboud, he served as an Assistant Professor at Delft University of Technology and completed a postdoctoral fellowship at Aarhus University. He earned his PhD cum laude from Radboud University between 2011 and 2015. His research interests include: Semantics Separation logic Theorem proving Coq Program verification Concurrent and higher-order programming His recent publications (2020–2025) show a consistent focus on mechanized verification, linearizability, session types, deadlock freedom, and foundational enhancements to Iris and separation logic. These works appear in top-tier venues like POPL, PLDI, ICFP, and OOPSLA, with several receiving distinguished paper or artifact awards. Notable scientific awards include: POPL 2023 Distinguished Paper Award (DimSum) POPL 2022 Distinguished Paper Award (Simuliris) PLDI 2021 Distinguished Paper and Artifact Awards (RefinedC) CPP 2021 Distinguished Paper Award (Machine-Checked Semantic Session Typing) ECOOP 2017 Distinguished Paper Award 2023 Alonzo Church Award (as part of Iris team) He has advised PhD students such as Ike Mulder and Jules Jacobs. He actively contributes to the academic community as a program committee member, steering committee member, and organizer for major conferences including POPL, PLDI, ICFP, and CPP. His work is supported by major grants such as ERC Consolidator Grant (RustBelt) and Villum Investigator Grant (CPV). He is a core member of the Logic and Semantics Group and the Iris research project, which involves collaborations across institutions globally. His personal website is https://robbertkrebbers.nl .

Federico Olmedoمشاهده پروفایل

استادیار

• Program Verification
• Probabilistic Programming
• Language-Based Security
• +۵ مورد دیگر

Federico Olmedo is an Assistant Professor at the Computer Science Department of the University of Chile, where he teaches courses like Program Analysis and Verification ( CC4101 ) and Discrete Mathematics for Computer Science ( CC3101 ). His research focuses on the semantics and verification of probabilistic programs , with applications in language-based security , differential privacy , and formal verification of cryptographic systems . Previously, he was a postdoctoral researcher at RWTH Aachen University and earned his PhD from the Technical University of Madrid in 2014. Research Interests : Program Verification Probabilistic Programming Language-Based Security Theorem Provers Quantum Computing Cryptographic Proofs Publications span formal methods for probabilistic programs, including weakest precondition calculi , runtime analysis of quantum programs , and machine-checked proofs for cryptographic protocols . Notable works include the Best Theory Paper Award at ECOOP 2016 and foundational research on conditioning in probabilistic programming . He co-developed the CertiCrypt and CertiPriv frameworks for verifying cryptographic proofs and differential privacy in Coq. Scientific Awards : ECOOP 2016 Best Theory Paper Award

Alejandro Aguirreمشاهده پروفایل

پژوهشگر ارشد

• Formal Verification
• Probabilistic Programming
• Programming Language Semantics
• +۳ مورد دیگر

Alejandro Aguirre is a Research Fellow at the Department of Computer Science, Aarhus University , where he works with Lars Birkedal. Previously, he was a PhD student at the Imdea Software Institute in Madrid under Gilles Barthe. His research focuses on formal verification , probabilistic programming , and programming language semantics . Recent work includes: Modular Reasoning about Error Bounds (2025) for concurrent probabilistic programs Applying Guarded Type Theory to model recursion and probabilistic choice Developing Error Credits for resourceful error bound analysis Asynchronous Probabilistic Couplings in higher-order separation logic He received the Distinguished Paper Award at ICFP '24. His publications span journals and conferences like POPL, ICFP, ESOP, and ICALP, with a focus on theoretical foundations and practical verification tools.

• Data Management
• Computational Logic
• Database Theory
• +۱۰ مورد دیگر

Michael Benedikt is Professor of Computer Science at the Department of Computer Science, University of Oxford, and a Fellow of University College, Oxford. His research lies at the intersection of computational logic, database theory, and theoretical computer science, with a focus on query answering, logic-based data management, and formal methods for data integration. Institution: University of Oxford, Department of Computer Science Position: Professor of Computer Science Email: michael.benedikt@cs.ox.ac.uk Office: 355 Wolfson Building, Parks Road, Oxford OX1 3QD, UK His primary research interests include data management, computational logic, model theory, query reformulation, integrity constraints, existential rules, and fixpoint logics. He investigates theoretical foundations of querying Web and social network data, ontology-based data integration, and finite model reasoning. His recent publications span top venues such as VLDB, PODS, LICS, ICALP, and IJCAI, covering topics like scalable querying of nested data, interpolation in fixpoint logics, finite open-world query answering, and rewriting recursive queries. A unifying theme across his work is the application of logical methods to ensure correctness, decidability, and efficiency in data access and transformation. Best Paper Award, ICALP 2017 (Track B) EPSRC Established Career Fellowship (2015–2020) He has supervised numerous PhD students and postdoctoral researchers, including Jaclyn Smith, Djordje Zivanovic, Antonia Kormpa, and Benjamin Spencer. His research group has been supported by grants from EPSRC and Microsoft Research. He actively contributes to the academic community through service on program committees (e.g., LICS, PODS, IJCAI, VLDB) and editorial boards (e.g., Journal of Computer and System Sciences). He co-authored a book on interpolation-based query reformulation published by Morgan Claypool.

Patrick Bahrمشاهده پروفایل

دانشیار

• Type Systems
• Compilers
• Functional Programming
• +۴ مورد دیگر

Patrick Bahr is an Associate Professor at the IT University of Copenhagen and Co-Head of Education for the Master of Software Design program. His research focuses on developing programming languages and tools to ensure high-assurance software through formal methods. Education : PhD in Computer Science (2012), University of Copenhagen; MSc in Computational Logic (2009), Dresden & Vienna University of Technology; BSc in Computer Science (2008), Dresden University of Technology Patrick's research spans Type Systems , Compilers , and Functional Reactive Programming (FRP) , emphasizing Modal Types to ensure causality and productivity. His work includes Formal Verification of compiler correctness and Domain-specific Languages for enterprise and financial contracts. Recent publications highlight trends in Graph-Based Compilers , Asynchronous FRP , and Guarded Recursion . His methodologies often integrate Haskell and Agda for verified implementations. Key contributions include Sound-By-Construction Type Systems and Monadic Compiler Calculation . Scientific Awards : Best Contribution to RTA 2010 DIKU Paper of the Year 2012 He actively contributes to program committees (e.g., TFP 2026, ICFP 2024) and has led research projects like Guarded Recursive Types funded by the Danish Independent Research Fund (2015-2019). Collaborations span institutions such as the University of Nottingham and Utrecht University.

Lars Birkedalمشاهده پروفایل

استاد

• Logic and Semantics of Programming Languages
• Type Theories
• Program Logics
• +۶ مورد دیگر

Lars Birkedal is a Professor of Computer Science at Aarhus University, Denmark, where he serves as Head of the Logic and Semantics Group. He previously held positions at the IT University of Copenhagen until 2012 and served as Head of Department of Computer Science at Aarhus from 2014 to 2017. His educational background includes a Ph.D. in Computer Science from Carnegie Mellon University, USA, completed in December 1999. Birkedal's primary research interests focus on the logic and semantics of programming languages and type theories. His current work centers on program logics for reasoning about distributed, concurrent, higher-order, and imperative programs; cyber-security; and type theories with guarded recursion. He has made significant contributions to separation logic, particularly through the development of the Iris framework, which earned him the 2023 Alonzo Church Award. His research bridges theoretical foundations with practical applications in program verification and security. His recent publications demonstrate a strong trend toward mechanized verification of complex systems, with particular emphasis on concurrent and distributed programming. The research spans multiple subfields including separation logic variants, capability systems, information flow security, and formal verification of low-level systems. A notable pattern is the integration of logical frameworks with practical verification tools, often implemented in proof assistants like Coq. His scientific achievements have been recognized with numerous prestigious awards: Fellow of the ACM ERC Advanced Grant from the European Research Council (2023) 2023 Alonzo Church Award for Outstanding Contributions to Logic and Computation Villum Investigator grant from the Villum Foundation (2019) Danish Minister of Research Elite Research Award (2015) Sapere Aude Advanced Grant from the Danish National Science Research Council (2013) ACM SIGPLAN Milner Award (2013) Birkedal has advised numerous PhD students and postdocs, including Lau Skorstengaard, Kristoffer Just Andersen, Morten Krogh-Jespersen, and Robbert Krebbers. His research has been supported by significant grants including an ERC Advanced Grant (2023), a Villum Investigator grant (2019), and a Sapere Aude Advanced Grant (2013). He has served in editorial roles including Editor-in-Chief of Logical Methods in Computer Science (2014-2020) and Chairman of the board, and as PC Chair for POPL 2020. He leads the Logic and Semantics Group at Aarhus University and has been instrumental in several major research projects including the CHORDS project (Compositional Higher-Order Reasoning about Distributed Systems) and the Center for Basic Research in Program Verification (CPV). His earlier ModuRes project (Modular Reasoning about Concurrent Higher-Order Imperative Programs) laid important groundwork for verification of modern programming language features.

Rasmus Ejlers Møgelbergمشاهده پروفایل

استاد

• Denotational semantics of programming languages
• type theory
• category theory
• +۵ مورد دیگر

Rasmus Ejlers Møgelberg is a Professor at the IT University of Copenhagen, where he leads the Section for Theoretical Computer Science and coordinates the Programming, Logic and Semantics research group. His academic career includes prior postdoctoral positions at DISI (Universita di Genova) and LFCS (University of Edinburgh). His research spans denotational semantics of programming languages , type theory , category theory , guarded recursion , and domain theory , with applications in modeling computational effects and parametric polymorphism. Current work focuses on guarded type theory for reactive and probabilistic programming systems. Recent publications (2019-2025) demonstrate consistent innovation in guarded recursion frameworks, including denotational models for clocked type theory, guarded dependent types, and modal logics for reactive programming. Key trends involve bridging category theory with practical programming language features to handle recursion, concurrency, and probabilistic choice. He has supervised three PhD students to completion: Magnus Baunsgaard Kristensen (2022, Cubical Modal Type Theories), Christian Uldal Graulund (2021, Type Theories for Reactive Programming), and Marco Paviotti (2016, Denotational Semantics in Guarded Type Theory). Postdoctoral researchers include Maaike Zwart (current), Andrea Vezzosi, Niccolo Veltri, Bassel Mannaa, and Patrick Bahr (now ITU associate professor). His research is funded by the Independent Research Fund Denmark project "Algebraic Effects and Guarded Recursion" (2022-2025). As coordinator of the Programming, Logic and Semantics group, he directs theoretical research on programming language foundations, emphasizing denotational semantics and type systems for next-generation language design.

Lars Birkedalمشاهده پروفایل

استاد

• Programming Languages
• Type Theory
• Separation Logic
• +۴ مورد دیگر

Lars Birkedal is a Professor in the Department of Computer Science at Aarhus University, Denmark. He is a leading researcher in programming languages and formal methods with extensive contributions to the field over the past decade. His work appears consistently in top-tier programming languages conferences including POPL, ICFP, and PLDI, where he has served in leadership roles such as Program Chair and committee member. Birkedal's research primarily focuses on the theoretical foundations of program verification, with significant contributions to separation logic, type theory, and formal methods for concurrent and probabilistic systems. His work bridges theoretical computer science with practical verification challenges, particularly through the development and application of the Iris framework for higher-order concurrent separation logic. He has pioneered approaches for reasoning about probabilistic programs, capability-based security, and memory models for modern architectures. Analysis of Birkedal's recent publications (2023-2025) reveals a continued focus on advancing separation logic for increasingly complex systems. His work shows a clear trajectory from foundational theoretical work toward practical verification of real-world systems like WebAssembly while maintaining rigorous formal guarantees. There's a notable emphasis on probabilistic programming, error bounds analysis, and distributed systems verification in his most recent contributions. As a faculty member at Aarhus University, Birkedal has built a strong research group focused on programming language theory and formal verification. His leadership in the programming languages community is evident through his repeated service on program committees for major conferences and his mentorship of numerous graduate students and junior researchers, though specific student names aren't listed in the available information. His research has likely been supported by significant grants from Danish and European funding agencies, given the sustained output and international collaborations evident in his publication record.

Timothy Henryمشاهده پروفایل

دانشیار

• Artificial Intelligence
• Cybersecurity
• Machine Learning
• +۳ مورد دیگر

Dr. Timothy Henry serves as Associate Professor in the Department of Computer Science and Information Systems at Rhode Island College's School of Business, leveraging 40+ years of cross-sector experience in academia, industry, and military service. He pioneered Rhode Island's first undergraduate Artificial Intelligence major and two AI minors while establishing critical cybersecurity infrastructure including a state-of-the-art cyber range for hands-on training. His educational credentials include: Ph.D. in Applied Mathematical Sciences from University of Rhode Island Master's in Computer Science from Old Dominion University Bachelor's in Mathematics from U.S. Coast Guard Academy Dr. Henry's research integrates theoretical and practical dimensions of Artificial Intelligence, Cybersecurity, and Machine Learning with emphasis on secure systems implementation. His work consistently bridges foundational computer science concepts with societal implications, particularly through ethical frameworks for emerging technologies. This dual focus manifests in both curriculum development and award-winning scholarly publications addressing real-world security challenges. His textbook publications demonstrate evolving expertise from core data structures to contemporary AI ethics, with consistent recognition for educational impact. The progression from algorithmic foundations to societal implications reflects his holistic approach to computing education, emphasizing both technical rigor and responsible innovation. Major honors include: TAA Excellence Award nomination (2025) for AI security textbook Consecutive TAA awards (2018-2019) for data structures and ethics textbooks McGuffey Longevity Award for sustained educational impact As academic lead for Rhode Island's Governor's AI Task Force and Higher Ed AI Policy Task Force, Dr. Henry shapes statewide technology strategy while developing next-generation educational infrastructure. His industry leadership in government healthcare projects translates directly into classroom applications through the cyber range facility. He directs the Institute for Cybersecurity & Emerging Technologies while advancing practical training through the cyber range facility. His task force leadership connects academic research with state policy development, creating pathways for student engagement in real-world AI implementation challenges.