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

Anand Pillayمشاهده پروفایل

استاد

• Model Theory
• Mathematical Logic
• Algebra
• +۴ مورد دیگر

Anand Pillay is the William J. Hank Family Professor of Mathematics at the University of Notre Dame's Department of Mathematics within the College of Science. He holds an Emeritus title from the Swanlund Chair at the University of Illinois (since 2006). His education includes a B.A. in Mathematics and Philosophy from Oxford (1973), an M.Sc. in Pure Mathematics from London (1974), and a Ph.D. in Mathematics from London (1978). Pillay's research focuses on Model Theory, particularly stability theory and its applications to algebra, geometry, number theory, and combinatorics. He has contributed significantly to topics like definable groups, differential algebraic groups, and VC-dimension in combinatorics. His work bridges pure logic with applied areas such as differential equations and algebraic geometry. Key Research Themes: Model-theoretic classification, applications of stability theory, differential Galois theory, and combinatorial regularity. Recent Trends: Explores pseudofinite groups, VC-dimension in group structures, and parameter identifiability in ODE models. He has received prestigious awards like the Humboldt Research Prize (2001) and is an AMS Fellow (2012). Pillay has authored over 200 publications and supervised numerous graduate students, including current advisees Nicolas Chavarria Gomez and Leo Jimenez. His editorial roles include co-Editor-in-Chief of the Notre Dame Journal of Formal Logic and Associate Editor of the Journal of the American Mathematical Society. Pillay's academic leadership includes organizing major international conferences and programs, such as the MSRI Model Theory of Fields semester (1998) and the Newton Institute Model Theory and Applications program (2005). His teaching spans advanced courses in model theory and logic, alongside undergraduate mathematics. His research has been supported by grants from the NSF, EPSRC, and Marie Curie Excellence Chair programs. Pillay's work continues to impact foundational mathematics and interdisciplinary applications.

• Computability
• Concurrency
• Formal Methods
• +۳ مورد دیگر

Dr. Ulrich Berger serves as Reader (Associate Professor) in Computer Science at Swansea University's Faculty of Science and Engineering. His research spans computability theory, concurrent programming, formal methods, and robotics applications. Recent work includes industrial automation integration and human-centered manufacturing systems. Publications demonstrate consistent focus on theoretical foundations (computability, program extraction) and applied industrial research (robotics, IIoT, and augmented reality). His work on concurrent algorithms and computable analysis provides frameworks for practical implementations in manufacturing environments. As an active researcher, he contributes to topics ranging from reinforcement learning for robotic control to stress-reducing UI design, bridging theoretical computer science with industrial challenges.

George Booleمشاهده پروفایل

استاد

• Mathematical Logic
• Differential Equations
• Symbolic Logic
• +۵ مورد دیگر

George Boole (1815-1864) was the first Professor of Mathematics at Queen’s College, Cork (now University College Cork), serving from 1849 until his death. Renowned for pioneering Boolean algebra and foundational work in mathematical logic, he authored seminal texts like An Investigation of the Laws of Thought (1854). His academic contributions span differential equations, probability theory, and symbolic logic, laying groundwork for the digital age. Boole’s career included lecturing daily in Cork’s Schools of Arts and Engineering, while also serving on the library committee and leading the Cork Cuvierian Society. His legacy is marked by honorary degrees (LL.D. from Trinity College, D.C.L. from Oxford) and awards like the Keith Medal (1855) and FRS election (1857). Memorials include stained-glass windows in Lincoln and Cork Cathedrals, and the Boole Library at UCC. His research emphasized mathematical rigor and interdisciplinary applications, with over 50 articles and treatises. Boole’s work bridges pure and applied mathematics, influencing computer science and modern logic. Despite limited formal education, his self-taught expertise and dedication to students—visiting the unwell and aiding underprivileged learners—left a lasting academic imprint.

• Theoretical Computer Science
• Constraint Satisfaction Problems
• Algebraic Methods
• +۳ مورد دیگر

Silvia Butti is a Senior Research Associate in the Department of Computer Science at the University of Oxford, where she also holds a Junior Research Fellowship at Lady Margaret Hall. She specializes in theoretical computer science, focusing on constraint satisfaction problems (CSPs), algebraic methods, approximation algorithms, and computational complexity. Her research bridges theoretical foundations with applications in distributed computing and combinatorial optimization. She earned her PhD from Universitat Pompeu Fabra (Barcelona, Spain) in 2022, supervised by Victor Dalmau, and holds an MSc in Mathematics and Foundations of Computer Science from the University of Oxford (2018) and a BSc in Mathematics from University College London (2017). Her academic journey is supported by prestigious fellowships, including the INPhINIT “la Caixa” and Marie Skłodowska-Curie Actions. Her research interests include the algebraic analysis of CSPs, inapproximability, and the interplay between hierarchies like Sherali-Adams and Weisfeiler-Leman invariants. She actively contributes to conferences such as LICS, MFCS, and CP, and has published extensively on topics ranging from promise problems to distributed algorithms. Dr. Butti teaches courses on computational complexity, combinatorial optimization, and probability and computing at the University of Oxford. She is committed to science communication, engaging with outreach initiatives like Maths Fest, the Royal Institution Masterclasses, and the UNIQ Summer School. Her work is funded by the UKRI-ERC grant NAASP, focusing on new approaches to approximability of satisfiable problems.

Andrea Corradiniمشاهده پروفایل

استاد

• Computer Science
• Programming Languages
• Concurrency
• +۵ مورد دیگر

Andrea Corradini is a Full Professor at the Computer Science Department of the University of Pisa , where he coordinates internationalization efforts. His research focuses on algebraic and categorical semantics of programming languages, concurrency, graph grammars, and term rewriting systems. He teaches advanced programming courses and has advised numerous students in their academic and research endeavors. His recent work spans ecological studies on wildlife behavior, machine learning applications, and formal methods in software engineering. Teaching: Advanced Programming (Master's level) Fondamenti dell'Informatica (Bachelor's level) Research Interests: Formal semantics of programming languages Graph transformation systems Concurrency theory Applications of category theory in computer science Recent Research Trends: His publications explore interdisciplinary topics, including wildlife behavioral ecology (e.g., brown bears, lynx), machine learning for material science, and formal verification techniques. Recent studies highlight human impacts on animal behavior and innovative computational methods for ecological modeling. Scientific Contributions: Dr. Corradini has coordinated international projects like ASCENS and GETGRATS, advancing graph transformation theory. His work bridges theoretical foundations with practical applications in software systems and ecological conservation.

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

دانشیار

• Logic synthesis
• Hardware formal verification and validation
• Boolean/switching theory
• +۵ مورد دیگر

David Kebo Houngninou is an Associate Professor in the Department of Computer Science and Engineering at Texas A&M University, part of the College of Engineering. He holds a Ph.D. (2017), M.S. (2010), and B.S. (2008) in Computer Engineering from Southern Methodist University, Washington University in St. Louis, and the University of Evansville, respectively. His research focuses on logic synthesis , hardware formal verification , and Boolean/switching theory , with notable contributions to RISC-V architecture education through the FLIP simulator. He has received awards including the Research Days Outstanding Poster Award (2017) and multiple Outstanding Graduate Student Awards (2015-2016). Teaching interests include micro-architecture, formal verification, and computer systems courses. Professional experience spans roles at Texas Instruments (design engineer), IBM Research (researcher), and adjunct faculty positions. His work includes developing tutorials on microcontroller interfacing (STM32F107VC), CUDD BDD package usage, and Verilog parsing tools. Key projects involve creating educational simulators, formal verification frameworks, and hardware-software co-design methodologies. He actively contributes to diversity initiatives through roles like Doctoral Consortium Chair at the CMD-IT/ACM Tapia Conference.

• Philosophical Logic
• Vagueness
• Philosophy of Mathematics
• +۳ مورد دیگر

Dr. Stewart Shapiro is a Professor in the Department of Philosophy at Ohio State University's College of Arts and Sciences. He holds a B.A. from Case Western Reserve University and a Ph.D. from SUNY Buffalo. His expertise spans philosophical logic, vagueness, philosophy of mathematics, and philosophy of language. His research explores the foundations of mathematics, logic, and language, with significant contributions to understanding mathematical ontology, pluralism in logic, and the semantics of mathematical concepts. He investigates structuralism, formalism, and the epistemic access to abstract objects. Recent publications examine logical pluralism, the interplay between ontology and semantics, and the revision of inconsistent conceptual frameworks. His work frequently engages with historical figures like Frege, Aristotle, and Brouwer while addressing contemporary debates in formal epistemology and mathematical philosophy.

Leif Petersonمشاهده پروفایل

مدرس

• Biostatistics
• Bioinformatics
• Machine Learning
• +۱۰ مورد دیگر

Leif Peterson is a Lecturer in the Department of Statistics at Rice University since 2022. He concurrently serves as Principal of NXG Logic, LLC, a data analytics startup, and operates as an independent consultant in biostatistics, bioinformatics, and machine learning. His research focuses on computational methods, quantitative finance, and advanced statistical techniques including Monte Carlo simulation and neural networks. Education: Ph.D. in Epidemiology-Biostatistics from The University of Texas Health Science Center M.P.H. in Radiological Physics from the University of Michigan B.S. in Nuclear Medicine from Ferris State University Prior roles include Radiation Specialist at NASA’s Johnson Space Center (1986-1995), Associate Professor of Medicine at Baylor College of Medicine (1995-2006), and Director of the Center for Biostatistics at Houston Methodist Research Institute (2006-2019). He held adjunct roles at the University of Texas School of Public Health and taught at the University of Houston and Texas A&M. Research interests span mathematical algorithms, eigendecomposition, text mining, and numerical optimization. His recent work addresses portfolio optimization, genetic algorithms for financial trading, and PCA analysis in time series. Scientific contributions include studies on radiation dosimetry, ALS pathophysiology, and cardiovascular interventions. Notable honors include the 2000 Young Investigators Program Award (National Research Council) and 1995 Program Scholar (First Annual Schull Symposium). Professional affiliations include IEEE Computational Intelligence Society and the International Neural Network Society. His work bridges academia and industry, with active roles in biostatistics, healthcare policy, and data science innovation.

Konstantinos Mamourasمشاهده پروفایل

استادیار

• Programming Languages
• Formal Methods
• Stream Processing
• +۳ مورد دیگر

Konstantinos Mamouras is an Assistant Professor in the Department of Computer Science at Rice University, affiliated with the College of Engineering. His research focuses on programming abstractions for data streams, runtime verification for cyber-physical systems, and program semantics. He holds a PhD from Cornell University (2015) under Dexter Kozen and has held postdoctoral roles at the University of Pennsylvania. Education: PhD in Computer Science, Cornell University (2015) Research Interests: Mamouras designs languages and tools for efficient data stream processing (e.g., StreamQRE) and explores formal methods in program verification. His work bridges theoretical foundations (e.g., Kleene Algebra) with practical implementations, addressing challenges in real-time decision systems and resource-constrained applications like medical monitoring. Recent projects include GPU-accelerated regex matching, energy-efficient automata processors, and compositional monitoring frameworks for continuous signals. Publications: His work spans algorithm design, formal verification, and hardware-software co-design. Notable contributions include reconfigurable automata processors, verified regex matchers, and energy-efficient genome alignment accelerators. He has received awards at PLDI (2024) and EuroSys (2021) for impactful research. Awards: Best Paper Award, EuroSys 2021 Distinguished Paper Award, PLDI 2024 Teaching & Advising: Mamouras teaches courses on IoT programming, formal methods, and verified software. He advises students (e.g., Alexis Le Glaunec, Agnishom Chattopadhyay) and has supervised MSc and PhD theses on topics like streaming algorithms and quantitative monitoring. His lab focuses on advancing programming models for real-time data systems.

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

Luís Caires is a Full Professor of Science and Methodology of Programming at the Department of Computer Science and Engineering, Técnico Lisboa. He is also a Core Researcher at INESC-ID and holds the ERA Chair under the H2020 BIG initiative. Previously, he served as a Full Professor at the Department of Computer Science, NOVA FCT, and was the founding Director of the NOVA Laboratory for Computer Science and Informatics. His research focuses on the theory and practice of programming languages, emphasizing trustworthy concurrent, distributed, and decentralized systems. Key areas include type systems for resource management in concurrent systems, integration of foundational concepts (types, logics, process algebra) with systems building (compilers, type-checkers), and interdisciplinary themes like computational theories of mind and quantum programming models. Recent work includes the development of the Linear Session Abstract Machine (LSAM) and the CLASS language, which ensure safety properties in concurrent programming. He actively participates in academic communities, serving as a PC member for ECOOP, FoSSaCS, and LICS. His contributions span software tools like the SLMC model checker for spatial logics and DIFT for dependent information flow types. His research bridges theoretical foundations with practical implementations, emphasizing both correctness and practical usability. Key Projects: LSAM, CLASS, DIFT, SLMC Grants: H2020 BIG (ERA Chair) Labs/Teams: INESC-ID, NOVA Laboratory for Computer Science and Informatics

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

Robert Atkey is a Chancellor’s Fellow and Lecturer in the Department of Computer and Information Sciences at the University of Strathclyde, where he is part of the Mathematically Structured Programming (MSP) group. His research focuses on programming language design and analysis, leveraging mathematical frameworks like category theory, type theory, and denotational semantics. He has contributed to parametricity theory, effect systems, and resource-aware verification systems such as ThreadSafe for Java concurrency. Key research areas include: Parametricity in higher-kinded and dependent type systems Applications of parametricity in DSL representation and scientific programming Development of parameterised monads for effect tracking Formal verification techniques for resource usage and concurrency defects Professional activities include programme committee roles for ESOP 2017 and POPL 2016, co-chairing the 2016 Mathematically Structured Functional Programming workshop, and organizing the Scottish Programming Languages and Verification Summer School 2024. His work bridges academic research with industrial applications, exemplified by the ThreadSafe static analysis tool developed at Contemplate. Current projects include ElePQuant (quantitative predicate logic foundations) and AISEC (AI security through construction). He collaborates on interdisciplinary initiatives like the DTP 2224 research consortium.

Jan Stühmerمشاهده پروفایل

استادیار

• Machine Learning
• Artificial Intelligence
• Molecular Mechanics
• +۷ مورد دیگر

Jun.-Prof. Dr. Jan Stühmer is an Assistant Professor and Principal Investigator (PI) at the Helmholtz Institute for Information Technology (HITS). His research focuses on machine learning, artificial intelligence, and their interdisciplinary applications in molecular mechanics, protein structure prediction, and materials science. He explores advanced graph neural networks, neuro-symbolic systems, and geometric algorithms to address challenges in computational biology, weather forecasting, and computer vision. Key research interests include permutation-invariant learning models (e.g., Set-LLM), error correction in machine learning systems, and the development of physics-based force fields like Grappa. His work bridges theoretical computer science with practical applications in drug design, materials discovery, and climate modeling. Recent contributions highlight innovations in protein design through geometric algebra, dynamic graph representation learning, and the optimization of crystal structure networks. Dr. Stühmer’s methodologies often integrate spatial information learning and ensemble forecasting techniques, showcasing a commitment to impactful, cross-disciplinary research. Despite extensive publications since 2009, no awards or grants are explicitly mentioned in the provided data. His academic trajectory reflects a sustained focus on advancing machine learning fundamentals and their real-world implications.

Anders Mörtbergمشاهده پروفایل

دانشیار

• Homotopy Type Theory
• Univalent Foundations
• Cubical Type Theory
• +۱۳ مورد دیگر

Anders Mörtberg is an Associate Professor in Computational Mathematics at the Department of Mathematics, Faculty of Science, Stockholm University. He has been a faculty member since 2019 and was promoted to associate professor with tenure in April 2023. His research lies at the intersection of type theory, logic, and formal verification, with a focus on Homotopy Type Theory (HoTT) and Univalent Foundations. His primary research interests include: Computational justifications for univalence and higher inductive types via cubical type theory Computer formalization of mathematics and computer science Constructive mathematics and logic Category-theoretic foundations Functional programming and proof assistants His recent publications demonstrate a strong trend toward synthetic homotopy theory, cohomology, and algebraic structures formalized in Cubical Agda. He has made significant contributions to both theoretical developments and practical implementations, particularly in advancing Cubical Agda as a full-featured proof assistant. His work enables rigorous, machine-checked proofs in algebraic topology and constructive algebra. Scientific awards include: Distinguished Paper Award at LICS 2023 Distinguished Paper Award at CPP 2023 Distinguished Paper Award at ICFP 2019 He advises several PhD students, including Axel Ljungström (main supervisor), Max Zeuner, Gabriel Saadia, Errol Yuksel, and Elisabeth Stenholm (external main supervisor). He has received competitive research grants from the Swedish Research Council (Vetenskapsrådet) and the Knut and Alice Wallenberg Foundation, supporting postdoctoral recruitment and foundational work on proof assistants. He regularly teaches courses such as Programming Paradigms and Programming for Mathematicians at Stockholm University. He is a core developer of Cubical Agda , an extension of Agda with native support for univalence and higher inductive types, and has contributed to UniMath , cubicaltt , and yacctt . His software tools are widely used in the formal methods and type theory communities.

Cyril Cohenمشاهده پروفایل

پژوهشگر

• Formal Methods
• Interactive Theorem Proving
• Type Theory
• +۱۲ مورد دیگر

Cyril Cohen is a permanent researcher (Chargé de Recherche) at Inria, affiliated with the CASH team in the Laboratoire de l'Informatique du Parallélisme (LIP) at École Normale Supérieure de Lyon (ENS de Lyon), France. He is also associated with CNRS and Université Claude Bernard Lyon 1. Previously, he was a member of the STAMP team at Inria Sophia Antipolis (2014–2024) and completed a postdoctoral position at the University of Gothenburg and Chalmers, Sweden (2012–2014). He earned his PhD in 2012 from École Polytechnique under the supervision of Assia Mahboubi. PhD: École Polytechnique, 2012 Postdoc: University of Gothenburg and Chalmers, 2012–2014 Researcher: Inria STAMP team, 2014–2024 Current: Inria CASH team, LIP, ENS de Lyon His research centers on the formalization of mathematics and programming languages using the Coq proof assistant. Key interests include type theory, formal verification, algebraic structures, real and complex analysis, measure theory, and proof transfer mechanisms. His work bridges theoretical mathematics and practical software verification. He has made foundational contributions to the Coq ecosystem, particularly in the areas of algebraic hierarchies, parametricity, and metaprogramming. The most recent publications reflect a strong trend toward advancing the theoretical and practical foundations of interactive theorem proving. His work spans formalizing classical mathematics (e.g., analysis, Galois theory), developing new logical frameworks (e.g., Cubical Type Theory), and engineering scalable proof automation tools (e.g., Hierarchy Builder, MetaCoq, Trocq). These efforts aim to make formal verification more expressive, efficient, and accessible. Cyril Cohen has not received any explicitly mentioned scientific awards in the provided texts. He has not mentored any PhD or master’s students listed in the provided materials. His research is highly collaborative, involving key figures in the formal methods community such as Assia Mahboubi, Thierry Coquand, and Enrico Tassi. He has contributed to major collaborative grants and projects including the Mathematical Components library, the MetaCoq project, and the development of Hierarchy Builder. These projects often involve multi-institutional and international collaboration. Cohen is a core member of the CASH team at LIP, ENS de Lyon, which focuses on formal methods, proof assistants, and the formalization of mathematics. The team develops and maintains key components of the Coq ecosystem, including libraries for algebra, analysis, and type theory. They also work on meta-tools for Coq such as Elpi and Template-Coq, enabling advanced metaprogramming and reflection.

René Thiemannمشاهده پروفایل

دانشیار

• Program Verification
• Interactive Theorem Proving
• Termination Analysis
• +۷ مورد دیگر

René Thiemann is an Associate Professor in the Department of Computer Science at the University of Innsbruck, Austria, where he is a member of the Computational Logic group. His research is centered on formal methods, with a focus on program verification, termination analysis, and interactive theorem proving using Isabelle/HOL. He has led and contributed to several FWF-funded research projects, including Automation of Rewriting Infrastructure and Certifying Termination and Complexity Proofs of Programs . His research interests include: Program Verification via Interactive Theorem Proving (Isabelle, CeTA) Termination and Complexity Analysis of Programs and Rewriting Systems Term Rewriting and Dependency Pairs SAT and SMT Solving Formalization of Algebraic Structures (e.g., algebraic numbers, Smith normal form) Automated Reasoning and Certified Software The most recent articles highlight his continued work in formal verification, particularly in certifying termination, confluence, and complexity proofs. His publications show a strong trend toward mechanizing mathematical and logical foundations in Isabelle/HOL, with applications in rewriting, arithmetic, and program analysis. He frequently publishes in top venues such as CPP, ITP, LICS, and FSCD. He has served on program committees for conferences including CPP and RTA, and he regularly advises and collaborates on formalization projects. While no explicit grants or advising roles are listed, his leadership in multiple FWF projects indicates significant grant involvement. He teaches courses such as Program Verification, Functional Programming, Constraint Solving, and Interactive Theorem Proving in Isabelle/HOL, reflecting his expertise in formal methods and programming languages.