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

Michael C. Laskowskiمشاهده پروفایل

استاد

• Model Theory
• Mathematical Logic
• Classification Theory
• +۷ مورد دیگر

Michael C. Laskowski is a Professor in the Department of Mathematics at the University of Maryland, College Park. His office is located in Room 3312 of the Mathematics Building with contact information including phone (301) 405-5336 and email mcl@math.umd.edu. For Fall 2025, he teaches Math 712 (Mathematical Logic I) on Tuesdays and Thursdays from 12:30-1:45 PM, with office hours on Tuesdays from 11:00 AM to 12:00 PM. His research focuses on model theory with significant contributions across multiple subfields: Classification theory (uncountable spectra, Karp complexity, Schröder-Bernstein property) Atomic models of countable theories Borel complexity of first-order theories Monadic expansions and NIP theories Mutually algebraic structures Hrushovski and Fraisse constructions Laskowski's recent publications (2022-2024) demonstrate continued innovation in model theory, particularly in monadic NIP characterizations, Borel completeness, and atomic model theory. His work bridges foundational mathematical logic with applications in combinatorics and computer science. His research program has received continuous NSF funding through grants DMS-9403701 to 2154101, spanning over 30 years of sustained scholarly contribution. His collaborative network includes prominent researchers like Saharon Shelah, John Baldwin, and Simon Thomas. While the webpage doesn't list specific students, his numerous collaborations suggest extensive mentorship of graduate students throughout his career.

• Theoretical Computer Science
• Logic in Computer Science
• Algorithms
• +۷ مورد دیگر

Alexandre Vigny is a junior professor at University Clermont Auvergne, France, where he conducts research at the intersection of logic, algorithms, and graph theory. His work focuses on theoretical computer science, particularly in model checking, query enumeration, and distributed algorithms on sparse graph classes. Research Interests: Theoretical Computer Science Logic in Computer Science Parameterized and Distributed Algorithms Graph Theory and Structural Sparsity Database Query Evaluation Reconfiguration Problems His recent publications explore algorithmic meta-theorems, first-order logic with connectivity, elimination distance, and distributed domination, primarily on sparse and structurally constrained graphs. His work appears in top venues such as LICS, ICALP, PODS, and JACM. Scientific Awards: No awards explicitly mentioned. Advising and Grants: Co-supervising Jona Dirks, PhD student since October 2024, with Mamadou Kanté. No specific grants mentioned, but active in collaborative research with prominent figures like Sebastian Siebertz, Luc Segoufin, and Patrice Ossona de Mendez. Labs and Teams: Previously part of Sebastian Siebertz’s team at the University of Bremen. Collaborates with researchers across Europe, including in Warsaw and Paris. Involved in the theoretical computer science community, co-organizing the PODC-DARE workshop.

Olivier Gauwinمشاهده پروفایل

استادیار

• Automata Theory
• Formal Languages
• Logic in Computer Science
• +۶ مورد دیگر

Olivier Gauwin serves as an Assistant Professor at the University of Bordeaux, holding dual roles in academic instruction and research. He teaches within the Computer Science Department at the University Institute of Technology (IUT), while conducting research as a core member of LaBRI's Numeric and Sustainability team. His institutional presence spans both the IUT campus in Gradignan (office 111) and LaBRI's research facilities in Talence (office 311), reflecting his integrated contributions to theoretical computer science and applied sustainability initiatives. His educational trajectory demonstrates deep theoretical foundations: Habilitation à diriger des recherches (HDR) from University of Bordeaux (2020) titled Transductions: resources and characterization PhD in Computer Science from Université Lille 1 (2009) titled Streaming Tree Automata and XPath , conducted at LIFL/INRIA Master's degree (DEA) from Centre de Recherche en Informatique de Lens (2004) titled Fusion itérée de croyances Gauwin's research program bridges abstract theory and practical applications, with early work establishing fundamental results in automata theory for XML stream processing. His investigations into visibly pushdown automata, nested words, and transducers created novel frameworks for efficient query answering in data streams. Recent years show strategic expansion into sustainability, where he adapts formal methods to environmental modeling challenges. This evolution maintains rigorous theoretical grounding while addressing contemporary computational sustainability needs through the Numeric and Sustainability team. Analysis of his 15 most recent publications reveals consistent methodological excellence across theoretical computer science. Core themes include automata minimization (notably proving NP-completeness for visibly pushdown automata), logical characterizations of transductions, and streamability analysis for nested structures. His work demonstrates exceptional coherence—advancing from foundational XML processing (2008-2013) to resource-optimized transducers (2015-2018) and current sustainability applications, always maintaining focus on computational efficiency and formal verifiability. Dr. Gauwin actively mentors the next generation of computer scientists: Supervised PhD completion of Nathan Lhote (2015-2018) on logical characterizations of transductions Guided PhD research of Félix Baschenis (2014-2017) on transducer minimization and resource optimization His research is institutionally supported through LaBRI (UMR 5800), a joint CNRS-University of Bordeaux laboratory, though specific external grants aren't detailed in available materials. Current work continues through the Numeric and Sustainability team, where he integrates automata theory with environmental computation challenges in collaborative projects spanning theoretical innovation and real-world sustainability applications.

• Logic
• Algorithms
• Graph Theory
• +۳ مورد دیگر

Alexandre Vigny is an Assistant Professor at University Clermont Auvergne in France, focusing on the intersection of logic, algorithms, and graph theory. He has previously held postdoctoral positions at the University of Bremen (2019-2023) and the University of Warsaw (2018-2019), and completed his PhD at University Paris Diderot (2015-2018) under Arnaud Durand and Luc Segoufin. Current role: Junior Professor at University Clermont Auvergne (2023-present) Postdoctoral experience: University of Bremen (2019-2023), University of Warsaw (2018-2019) PhD: University Paris Diderot (2015-2018) His research interests span theoretical computer science, with a focus on first-order logic, graph algorithms, and complexity analysis. Recent work includes advances in algorithmic meta theorems, reconfiguration problems on sparse graphs, and distributed domination algorithms. Publications highlight applications of logic in solving graph-theoretic problems and query enumeration in database theory. Key trends in his 2025 publications include lower bounds analysis for dominating sets in sparse graphs, token sliding reconfiguration on DAGs, and elimination distance metrics. Earlier works (2017-2024) cover dynamic query evaluation, monadic stability, and parameterized distributed complexity frameworks. Teaching roles have included courses in algorithm design, object-oriented programming, database systems, and model theory across Clermont Auvergne, Bremen, and Paris institutions. Co-supervises PhD student Jona Dirks (2024-present) in reconfiguration problems on directed graphs.

Marie Kerjeanمشاهده پروفایل

پژوهشگر

• Mathematical Logic
• Functional Analysis
• Programming Language Theory
• +۵ مورد دیگر

Marie Kerjean is a CNRS researcher affiliated with the Love team at LIPN (Laboratoire d'Informatique de Paris Nord) within University of Paris 13 . Her research bridges the gap between programming language theory, formal proofs, and functional analysis, focusing on Math-Comp Analysis and ANR DiPLo projects. Key Research Areas: Mathematical Logic Functional Analysis Differential Linear Logic Type Theory Formal Proof Assistants Applications to Differentiable Programming Recent Publications highlight interdisciplinary work in differential linear logic, dialectica categories, and formalization of mathematical structures. She chairs and organizes conferences like JFLA 2026 and LICS 2024 , with a CPP 2026 program committee role. Scientific Recognition: Distinguished Paper at LICS 2024 ANR DiPLo Grant (2024) for Logic and Differentiable Programming Advisory Roles include co-supervising Jad Koleilat 's PhD thesis. She is visiting JFLI in Tokyo (Feb-Jul 2026) and on maternity leave (Jun-Dec 2025). Contact: marie.kerjean@cnrs.fr or kerjean@lipn.univ-paris13.fr .

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

استاد

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

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania, School of Engineering and Applied Science. He is a leading researcher in programming languages, type theory, logic, and computer security, with extensive contributions to formal verification, program synthesis, and language-based security. Affiliation: University of Pennsylvania, Department of Computer and Information Science Role: Schlein Family President's Distinguished Professor, Associate Chair Research Group: PL Club (with Benjamin Pierce and Stephanie Weirich) His research focuses on foundational and applied aspects of programming languages, including formal verification of compilers and systems, type-driven program synthesis, information-flow security, quantum programming, and mechanized metatheory. He develops tools and frameworks such as Vellvm (verified LLVM semantics in Coq), Interaction Trees (for modeling impure computations), and QWIRE (for quantum program verification). The recent publications highlight a strong trend toward formal verification, semantics engineering, and program synthesis, particularly using interactive theorem provers like Coq. His work spans functional programming, type systems, concurrency, security, and compiler correctness, with a consistent emphasis on mechanized proofs and practical verification tools. Distinguished Paper Award, ECOOP 2023 Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award, POPL 2020 Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO Top Picks (2013) Alfred P. Sloan Fellow (2009–2010) NSF CAREER Award (2004) Best Paper at SOSP (2001) Intel Foundation Graduate Fellowship (2001) Best Paper at ICFP (1999) NSF Graduate Fellowship (1996) Zdancewic actively mentors graduate students and postdocs, many of whom have become faculty or researchers in industry. He has led significant research initiatives including the NSF Expedition on Deep Specification and the Vellvm project. He is currently General Chair for POPL 2025 and has served on numerous program committees for top-tier programming language conferences. He leads the Security-Oriented Languages (SOL) group and is deeply involved in the PL Club at Penn, fostering collaborative research in programming languages. His current projects include verified compiler infrastructure, quantum programming semantics, and expressive security policies.

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

استاد

• Algebraic Geometry
• Commutative Algebra
• Computation
• +۳ مورد دیگر

David Eisenbud is a Professor of Mathematics at the University of California, Berkeley, and a former Director of the Simons Laufer Mathematical Sciences Institute (SLMath, formerly MSRI). He holds academic affiliations at UC Berkeley and SLMath, where he contributed to facility expansions and endowment growth. His roles include Senate Faculty and leadership in organizations like the American Mathematical Society and the Simons Foundation. Education: PhD in Mathematics (1970) from the University of Chicago under Saunders MacLane and J.C. Robson. Pre-UC Career: Taught at Brandeis University (1970–1997) and served as MSRI Director (1997–2007, 2013–2022). Research Interests: Algebraic geometry, commutative algebra, homological algebra, and computational methods. Notable contributions include work on syzygies, free resolutions, and the Macaulay2 software system for algebraic geometry. Awards: Steele Prize for Exposition (2010), Distinguished Public Service Award (2020), American Academy of Arts and Sciences Fellow (2006). Grants/Advising: Extensive support from NSF; advised over 20 PhD students in areas like algebraic geometry and commutative algebra. Labs/Teams: Co-founded the Journal of Algebra and Number Theory and led MSRI's outreach programs like the National Math Festival.

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

استاد

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

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania. His research spans programming languages, computer security, formal verification, and type theory, with significant contributions to LLVM verification, program synthesis, and quantum programming. He co-leads Penn's Programming Languages Research Group with Benjamin Pierce and Stephanie Weirich. His research focuses on: Programming language foundations (type theory, linear logic, semantics) Formal verification (Coq, LLVM, interaction trees) Security (information-flow control, memory safety) Emerging paradigms (quantum programming, secure distributed systems) Publication trends reveal deep engagement with formal methods (67%), programming language design (20%), and systems security (13%), primarily using Coq for mechanized verification. Recent works demonstrate increased focus on parallel/streaming computation and synthesis techniques. Awards Distinguished Paper Awards (ECOOP 2023, POPL 2020) Schlein Family President's Distinguished Professor (2021) Lindback Distinguished Teaching Award (2018) IEEE MICRO Top Picks (2013) Sloan Fellowship (2009-2010) NSF CAREER Award (2004) Best Paper Awards (SOSP 2001, ICFP 1999) Research Leadership Directs multiple NSF-funded projects including DeepSpec (verified systems infrastructure), Vellvm (LLVM semantics), and ExCAPE (program synthesis). Advises 5 PhD students and 31 former advisees/postdocs. Served as General Chair for POPL 2025 and associate chair for PLDI/ICFP/POPL. Infrastructure Leads the Vellvm project developing Coq-based LLVM semantics, the Interaction Trees framework for recursive/impure programs, and Qwire for quantum circuit verification. Maintains active collaborations with Galois Inc. and INRIA.

Andrew K. Hirschمشاهده پروفایل

استادیار

• Choreographic Programming
• Information-Flow Security
• Computational Effects
• +۳ مورد دیگر

Andrew K. Hirsch is an Assistant Professor at the University at Buffalo, SUNY , Department of Computer Science and Engineering. He leads the Databases and Programming Languages group and focuses on programming languages for decentralized systems, particularly choreographic programming and information-flow security. Education: Ph.D. in Computer Science (2019) from Cornell University, supervised by Ross Tate on computational effects. B.S. in Computer Science and Pure Mathematics from The George Washington University. Research Interests: His work centers on choreographic programming, a paradigm ensuring deadlock-free concurrent systems, and information-flow security for decentralized applications. He also explores computational effects and type systems in programming language theory. Publications: Recent work includes advancements in process polymorphism (OOPSLA 2025), type-level polymorphism (PLACES 2025), and security definitions for higher-order declassification (OOPSLA 2023). Students: Doctoral: Michael Piskozub, Keith Allen Mason Masters: Alexander Bohosian, Gianna Bossoreale Undergraduate: Alex Doyoon Kim, Julia Montouri Recent Alumni: Ethan Canton, Tiffany Cai, Vamsi Krishna Bellam, Vincent Chan, Frank (Feng-Mao) Tsai Projects: Leads initiatives such as Choret (open choreographies) and The Pirouette Language and Compiler , which translate choreographic programs into concurrent system implementations.