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

Joseph Eremondiمشاهده پروفایل

استادیار

• Programming Languages
• Type Theory
• Dependent Types
• +۱۲ مورد دیگر

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.

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

استاد

• Model-Based Systems Engineering
• Cyber-Physical Systems
• Software Engineering
• +۱۲ مورد دیگر

Daniel Varro is a Professor affiliated with McGill University (Faculty of Engineering, School of Computer Science), with strong ties to Budapest University of Technology and Economics and Linköping University. He is a leading researcher in model-driven engineering, cyber-physical systems, and software engineering, actively contributing to top-tier conferences such as MODELS, ICSE, and ASE. His research focuses on model-based systems engineering (MBSE) , automated model generation , model transformations , and constraint-based consistency checking . Recently, his work has expanded into integrating large language models (LLMs) and machine learning into modeling workflows, including model querying, domain modeling, and bug detection. The recent publications reveal a strong trend toward AI-augmented modeling, logic-based solvers (e.g., Refinery), and safety assurance of autonomous systems (e.g., COLREGs compliance). His work bridges formal methods with practical software engineering challenges in industrial and safety-critical domains. Scientific Awards: No specific awards mentioned in the text. Advising and Grants: While no explicit list of students or grants is provided, his mentorship in the Doctoral Symposium and repeated leadership roles suggest active supervision and likely grant funding. He has led projects on automated model generation, model quality, and AI integration in modeling. Labs and Teams: Daniel Varro is associated with research groups focused on model-driven engineering and software evolution, likely leading or co-leading teams working on the VIATRA and Refinery frameworks for model transformation and solving.

Tom Schrijversمشاهده پروفایل

استاد

• Programming Languages
• Functional Programming
• Type Systems
• +۶ مورد دیگر

Tom Schrijvers is a Professor at the Department of Computer Science in the Faculty of Engineering Science at KU Leuven, Belgium. He leads the Programming Languages Group within the Declarative Languages and Artificial Intelligence (DTAI) research group. His research focuses on programming languages, particularly functional and logic programming, with special emphasis on Haskell, type systems, and algebraic effects. His research interests include: Functional Programming, especially Haskell Type Systems and Type Theory Algebraic Effects and Handlers Logic Programming, particularly Prolog Constraint Programming Domain-Specific Languages Programming Language Theory Prof. Schrijvers' recent research has focused on effect systems, staged programming, and language composition. His work on algebraic effect handlers has been particularly influential, providing new insights into how effects can be modularly composed and handled in functional languages. He has also made significant contributions to the understanding of type classes and their implementation in Haskell. His publications demonstrate a consistent focus on practical applications of programming language theory, with work spanning from foundational type theory to applied domain-specific languages for areas like fluorescence microscopy. His research often bridges the gap between theoretical programming language concepts and practical implementation concerns. Prof. Schrijvers has supervised numerous PhD students to completion, including Pieter Wuille, Benoit Desouter, George Karachalias, Steven Keuchel, Amr Saleh, Alexander Vandenbroucke, and Ruben Pieters. He currently supervises PhD students Klara Mardirosian, César Santos, Gert-Jan Bottu, Koen Pauwels, Birthe van den Berg, and Roger Bosman. His research group has received funding from various sources including EU projects like GRACeFUL. The Programming Languages Group at KU Leuven, which he leads, focuses on functional (Haskell) and logic (Prolog, Datalog, CLP) programming languages, as well as general programming language theory. The group has been active in numerous research projects and collaborations across Europe.

Conrad Wattمشاهده پروفایل

استادیار

• WebAssembly
• Formal Verification
• Programming Languages
• +۴ مورد دیگر

Conrad Watt is an Assistant Professor at Nanyang Technological University (NTU), Singapore , specializing in WebAssembly, formal verification, and concurrency. He previously served as a Research Fellow at Peterhouse, University of Cambridge, and earned his PhD under Peter Sewell. Co-chair of the W3C WebAssembly Community Group Active in WebAssembly standards development, including concurrency specifications Developed mechanizations in theorem provers like Isabelle/HOL Collaborator with industry (wasmtime engine) and academic teams on verification tools Research Focus: Formal verification of low-level languages, concurrency models, and security mechanisms for WebAssembly. His work bridges theoretical rigor with practical applications, including WasmRef-Isabelle and threads projects. Recent Trends: 2025 publications explore separation logic automation and concurrency experiments, while 2024-2023 work emphasizes specification toolchains (SpecTec), verified interpreters, and memory-safe execution techniques. Scientific Awards ACM Doctoral Dissertation Award Honorable Mention EAPLS Best Dissertation Award Advising: Supervises PhD students Qiyuan Xu and Antanas Kalkauskas. Collaborates with researchers like Philippa Gardner and Jean Pichon-Pharabod.

Loris D'Antoniمشاهده پروفایل

دانشیار

• Programming Languages
• Software Verification
• Program Synthesis
• +۴ مورد دیگر

Loris D'Antoni is an Associate Professor in the Department of Computer Science and Engineering at the University of California at San Diego (UCSD) . He is also a Visiting Academic at Amazon Web Services (AWS) . His research focuses on helping people write trustworthy software through techniques in program synthesis, formal verification, and machine learning robustness. Bachelor and Master in Computer Science from University of Torino (2008, 2010) PhD in Computer Science from University of Pennsylvania (2015) His research integrates programming languages , automata theory , and formal methods to ensure software reliability. Recent work explores semantics-guided synthesis and specification-aligned LLMs , with applications in network security, machine learning fairness, and automated code repair. Key trends in his publications include program synthesis , formal verification , and trustworthy AI systems . He has contributed to tools like AutomataTutor and SemGuS , a framework for customizable synthesis problems using constrained Horn clauses. Phillip R. Certain-Gary D. Sandefur Distinguished Faculty Award NSF CAREER Award Microsoft Research Faculty Fellowship Google and Facebook Faculty Awards Best Paper Award at ICDCN 2023 Distinguished Paper Award at SBES 2021 D'Antoni actively contributes to academic community service as a committee member in PLDI , OOPSLA , POPL , and CAV . He leads the Programming Systems Group at UCSD and collaborates with SemGuS research team on synthesis frameworks.

Fahiem Bacchusمشاهده پروفایل

استاد

• Artificial Intelligence
• Constraint Satisfaction Problems
• Satisfiability (SAT)
• +۷ مورد دیگر

Fahiem Bacchus is a Professor in the Department of Computer Science at the University of Toronto, within the Faculty of Arts and Science. His research is centered on foundational problems in Artificial Intelligence, particularly in reasoning, representation, and algorithm design. Institution: University of Toronto School: Faculty of Arts and Science Department: Department of Computer Science Email: fbacchus@cs.toronto.edu His work spans key areas including constraint satisfaction, satisfiability (SAT), automated planning, Bayesian inference, and constraint optimization. He focuses on developing algorithms that exploit domain-specific knowledge and structural properties to improve performance. His research has led to significant contributions such as the TLPlan planning system, which won the AIPS2002 international planning competition, and the 2clseq SAT solver, which demonstrated that extensive binary clause reasoning can dramatically improve solver efficiency. His work on preprocessors like Hypre further advanced formula simplification techniques. The recent articles reflect a strong focus on improving search algorithms through richer reasoning mechanisms, particularly in SAT solving and non-clausal logic. His publications show a consistent trend toward enhancing DPLL-based solvers with advanced inference techniques, reducing search space through preprocessing, and leveraging structural knowledge in logical theories. No scientific awards are explicitly mentioned in the provided text. Bacchus has supervised research and developed educational materials, with involvement in teaching and academic conference organization. While specific grants are not listed, his software releases (2clseq, Hypre, NoClause) suggest externally supported research activity. He has contributed tutorials, talks, and online teaching resources, indicating an active role in academic dissemination and mentoring. His research group has produced several software systems available for non-commercial research use, including 2clseq, Hypre, and NoClause, reflecting a strong applied and experimental component to his work. These tools are used in SAT solving, preprocessing, and non-clausal reasoning, and are documented with detailed technical information and usage instructions.

Pierre Marquisمشاهده پروفایل

استاد

• Artificial Intelligence
• Knowledge Representation
• Automated Reasoning
• +۶ مورد دیگر

Pierre Marquis is a distinguished Professor of Computer Science at Université d'Artois , affiliated with the Centre de Recherche en Informatique de Lens (CRIL-CNRS, UMR 8188) . Since December 2024, he has served as the vice-president for research and doctoral studies at Université d'Artois. His research focuses on Artificial Intelligence , particularly knowledge representation , automated reasoning , inconsistency handling , and knowledge compilation , with recent emphasis on Explainable AI (XAI) . Research Interests: Marquis's work spans foundational AI topics including abduction , induction , belief revision , and preference modeling . He has pioneered knowledge compilation techniques to optimize AI tasks and developed frameworks for reasoning under inconsistency through paraconsistent logics and argumentation. His EXPEKTATION chair (2020-2026) under France's national AI program drives his current focus on interpretable machine learning models. Scientific Awards: 2025: CNRS Silver Medal 2022: AAIA Fellow 2017: Senior Member of Institut Universitaire de France (IUF) 2009: EurAI (ECCAI) Fellow Doctoral Students: Mentoring Clément Lens (critical patient monitoring systems) and Mehdi Sabiri (data-knowledge integration for AI explanations). Collaborating with students like Louenas Bounia (formal XAI models) and Romain Wallon (pseudo-Boolean constraints). Grants & Projects: Leads the EXPEKTATION research chair (2020-2026) and participates in ANR PING/ACK (2019-2023), ANR THEMIS (2021-2025), CNRS IRP MAKC (2020-2024), and H2020 TAILOR (2020-2024). Previously led PIA4 MAIA (2023-2032) and Pint (2022-2023). Labs & Teams: Active in CRIL-CNRS, contributing to PyXAI (Python XAI library) and d4 (model counting), while mentoring teams on consensus belief merging and dynamic constraint processing .

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

دانشیار

• Data Engineering
• Machine Learning
• Anomaly Detection
• +۵ مورد دیگر

Amin Mesmoudi serves as Associate Professor in Data Engineering at the University of Poitiers' IUT (Institut Universitaire de Technologie), with dual laboratory affiliations at LIAS-ENSIP (Poitiers campus) and LIAS-ISAE-ENSMA (Chasseneuil campus). His research bridges theoretical database systems with practical large-scale data engineering challenges, particularly in semantic web technologies and machine learning applications. The laboratory maintains physical presences at both ENSIP's Bâtiment B25 in Poitiers and ISAE-ENSMA's Téléport 2 facility in Chasseneuil, facilitating cross-institutional collaboration. Mesmoudi's research program centers on scalable data management systems, with three interconnected pillars: (1) RDF and graph-based query optimization techniques for billion-triple datasets, (2) machine learning integration for spatial query performance and anomaly detection, and (3) explainability frameworks for complex black-box models. His work demonstrates consistent evolution from foundational database systems (2011-2016) toward contemporary AI-driven data engineering, particularly evident in his 2023-2025 publications on temporal dependency preservation and co-selection explainability. The Data Engineering team within LIAS laboratory provides the primary research context for these investigations. Publication analysis reveals strong methodological continuity in addressing scalability bottlenecks across database paradigms. Early work focused on SQL-on-MapReduce benchmarking for astronomy databases (2015-2016), transitioning to specialized RDF processing frameworks (2019-2021), and culminating in current hybrid approaches combining temporal modeling with machine learning (2023-2025). Key technical themes include fragmentation strategies for distributed data, optimizer feedback mechanisms, and graph-based query acceleration - all targeting real-world performance constraints in big data environments. As a core member of LIAS laboratory's Data Engineering team, Mesmoudi contributes to France's national research infrastructure in computer science and automation systems. The laboratory's dual-university structure enables unique cross-pollination between University of Poitiers' academic programs and ISAE-ENSMA's engineering specialization, with Mesmoudi's work exemplifying this synergy through applications spanning astronomy databases to wireless sensor networks.

David Janinمشاهده پروفایل

دانشیار

• Computer Science
• Functional Programming
• Temporal Media Systems
• +۴ مورد دیگر

David Janin is an Associate Professor in Computer Science at Bordeaux INP , specifically within the ENSEIRB-MATMECA school. He leads the PoSET research project, exploring algebraic models for heterogeneous interactive temporal media systems. Research Affiliations : CNRS INS2I , INRIA Bordeaux Sud-Ouest , Idex Bordeaux , LaBRI (CNRS UMR 5800). Research Focus : His work bridges inverse semigroup theory and functional programming to develop algebraic frameworks for synchronizing diverse temporal media (sound, animation, video). This includes T-calculus in Haskell and Octopus for 3D animation. Technical Contributions : Key developments include models for overlapping tiles , birooted tree languages , and causal function semantics in real-time systems. Contact : janin@labri.fr

Luc Segoufinمشاهده پروفایل

استاد پژوهشی

• Database theory
• Verification
• Logic in computer science
• +۳ مورد دیگر

Luc Segoufin is a Research Professor at INRIA (French National Institute for Research in Computer Science and Automation), affiliated with the Department of Computer Science at École Normale Supérieure (ENS) in Paris. He leads the VALDA research team, focusing on theoretical computer science foundations. His research spans: Database theory: Query answering, consistency, and enumeration complexity Logic and automata: Finite model theory, automata over data structures Computational complexity: Fine-grained analysis and lower bounds Formal methods: Verification and logic-based modeling His recent publications (2022–2024) concentrate on: Dichotomy theorems for query answering under constraints Constant-delay enumeration algorithms for structured data Decidability in logic fragments over trees and graphs Connections between automata, algebra, and complexity No scientific awards are mentioned in available sources. He collaborates extensively within the VALDA team and international researchers on projects involving database theory, logic, and automata. No student advising details are provided.

François Pottierمشاهده پروفایل

پژوهشگر

• programming languages
• functional programming
• type systems
• +۵ مورد دیگر

François Pottier is a senior researcher at Inria in Paris, France, where he leads the Cambium research team. He is affiliated with the Gallium research group and has maintained an active research profile spanning several decades in programming languages and formal methods. His research focuses on programming languages , particularly functional programming and OCaml, type systems design and implementation, program verification using separation logic, and compiler construction . His work bridges theoretical foundations with practical implementation, evidenced by numerous open-source software tools he has developed. Pottier's publication record shows consistent contributions to top programming languages conferences (POPL, ICFP, ESOP) with recent work emphasizing separation logic frameworks, resource analysis, and formal verification of OCaml systems. His research demonstrates a clear trajectory from foundational type theory toward practical verification techniques for real-world programming languages. He has advised numerous PhD students including Remy Seassau, Tiago Soares, Clément Allain, and Alexandre Moine, among others, many of whom have gone on to research positions at institutions like New York University, Imperial College London, and Inria itself. Pottier maintains active service roles in the programming languages community as a member of IFIP Working Group 2.8 on Functional Programming and IFIP Working Group 2.16 on Language Design, and serves on program committees for major conferences including upcoming roles for JFLA 2026 and ITP 2026. He leads the Cambium research team at Inria, which focuses on programming language theory and implementation, particularly around OCaml and formal verification. The team develops both theoretical frameworks and practical tools that have influenced the broader programming languages ecosystem.

J. Garrett Morrisمشاهده پروفایل

پژوهشگر

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

J. Garrett Morris is a researcher and teacher at the University of Iowa's Department of Computer Science, with previous affiliation to the University of Kansas. His work focuses on programming languages, type systems, and formal verification. Active contributor to conferences like POPL, ICFP, and Haskell Recognized for research in session types, linear logic, and functional programming His publications span topics including Exceptional Asynchronous Session Types , Partial Type Constructors , and Constrained Type Families . While no specific awards or students are mentioned in the scraped data, his academic activities include committee roles and keynote sessions.

Mario Alvianoمشاهده پروفایل

استاد

• Artificial Intelligence
• Knowledge Representation and Reasoning
• Combinatorial Search and Optimization
• +۵ مورد دیگر

Mario Alviano is a Full Professor in Computer Science (INF/01) at the University of Calabria, Department of Mathematics and Computer Science. He leads the LAIA lab (Laboratorio di Applicazioni dell'Intelligenza Artificiale) and serves as co-PI in the PRIN project PRODE ('Probabilistic Declarative Process Mining'). Current projects: FAIR ('Future AI Research'), Tech4You ('Technologies for climate change adaptation'), SERICS ('SEcurity and RIghts in the CyberSpace'), CAL.HUB.RIA , RADIOAMICA , and STROKE 5.0 His research focuses on Answer Set Programming (ASP), particularly in optimization, nonmonotonic reasoning, and applications to logistics, healthcare, and cybersecurity. He has authored over 120 publications in top venues like AIJ, AAAI, and IJCAI. Recent academic contributions includes work on: Temporal Many-valued Conditional Logics Weighted Knowledge Bases with Typicality Explainable AI via xASP and ASP Chef Defeasible Reasoning Scalability Notable awards: Artificial Intelligence Award 'Marco Somalvico' (2017) ICLP Best Paper Awards (2015, 2016) LPNMR Best Paper Award (2022) CILC Best Paper Award (2023)

Magnus Madsenمشاهده پروفایل

دانشیار

• Programming Languages
• Compilers
• Type and Effect Systems
• +۷ مورد دیگر

Magnus Madsen is an Associate Professor at Aarhus University, Department of Computer Science. He leads the development of the Flix programming language, a declarative tool integrating logic, functional, and imperative features with Java interoperability. His work spans type and effect systems, program analysis, and JavaScript bug-finding tools, particularly for asynchronous applications. Academic Affiliation: Aarhus University (Denmark) Leadership: Flix Programming Language Magnus's research focuses on programming language design, type systems, and static/dynamic analysis. This includes Datalog constraints, polymorphic effects, and nullability frameworks. His contributions to JavaScript analysis address asynchrony and concurrency challenges. Key trends in his work include declarative program analysis, effect system design, and Datalog-based frameworks like IFDS/IDE. Recent papers explore rank-polymorphic function inference, purity reflection, and stratification in logic programming. Scientific awards include: Sapere Aude grant (2023) Dahl-Nygaard Junior Prize (2022) STEM Grant (2022) Amazon Research Award (2021) DFF Project One (2020) ECOOP 2023 Distinguished Paper ICSE 2016 Distinguished Paper Current PhD students advised: Jonathan Lindegaard Starup, Matthew Lutze, Andreas Stenbæk Larsen (co-advised with Aslan Askarov), Caroline Palma Berger (co-advised with Clemens Nylandsted Klokmose).

Adrien Pommelletمشاهده پروفایل

دانشیار

• Formal Methods
• Model Checking
• Automata Theory
• +۵ مورد دیگر

Adrien Pommellet is an Associate Professor at EPITA , affiliated with the Laboratoire de Recherche en Informatique (LRE) automata team. His research focuses on formal methods, automata theory, and program synthesis. Education: PhD in Computer Science from Université Paris-Diderot (2018), Parisian Master of Research in Computer Science (2012) His research interests include active and passive learning of automata , model-checking algorithms for Büchi automata, and program synthesis . He actively contributes to the development of the Spot formal verification tool. Recent publications emphasize synthesis algorithms , automata reduction techniques , and LTL verification . He has also explored type systems and formal verification of concurrent programs. Teaching roles include courses in computer science (AAA, COMP, CPXA) and formal logic (FOLO, LOFO). Formerly taught ALGO, LOGI, and PING. He worked as a research engineer at CS Communications & Systèmes before joining EPITA's LRDE (now LRE) verification team in 2019.