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

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.

• Formal Methods
• Interactive Theorem Proving
• Probability Theory
• +۴ مورد دیگر

Rémy Degenne is affiliated with the University of Lille, Inria, CNRS, Centrale Lille, and the CRIStAL research laboratory (UMR 9198) in Lille, France. His work lies at the intersection of formal methods, mathematical logic, and probability theory, focusing on the mechanized verification of foundational results using the Lean proof assistant and its mathlib library. His research centers on formalizing advanced concepts in probability, particularly martingale convergence theorems. By encoding Doob's theorems in mathlib, he contributes to the rigorous foundation of probabilistic reasoning within interactive theorem proving. This work supports the broader goal of ensuring correctness in mathematical proofs and probabilistic algorithms through machine-checked verification. The available publication highlights a strong trend in bridging theoretical mathematics with programming language techniques, particularly in the formalization of measure-theoretic probability. His contributions align with the growing field of certified mathematics and trustworthy computation. Affiliation: University of Lille Research Unit: CRIStAL (UMR 9198) Associated Organizations: Inria, CNRS, Centrale Lille He has contributed to the CPP (Certified Programs and Proofs) conference, a premier venue for research on formal verification and proof assistants. No information is available regarding advising, grants, or teaching activities.

William Slofstraمشاهده پروفایل

دانشیار

• Quantum Information
• Quantum Computation
• Non-local Games
• +۱۳ مورد دیگر

William Slofstra is an Associate Professor in the Department of Pure Mathematics at the University of Waterloo and a member of the Institute for Quantum Computing. His primary academic home is within the Faculty of Mathematics at Waterloo, where he contributes to both pure mathematical research and quantum information science. Slofstra's research spans two major areas: the mathematics of quantum information and computation, and classical areas of Lie theory and algebraic combinatorics. Within quantum information, his main interests include non-local games, quantum correlation sets, self-testing and device-independence, entanglement theory, and multi-prover interactive proofs. He also investigates new mathematical tools such as decision problems in operator algebras and approximate representation theory that could advance these areas. In Lie theory and algebraic combinatorics, his research focuses on Kac-Moody groups and algebras, Schubert varieties, Coxeter groups, and hyperplane arrangements. His publication record shows a strong trajectory from more classical mathematical research toward quantum information theory, with recent work demonstrating deep connections between group theory and quantum non-locality. His most significant contributions include proving that the set of quantum correlations is not closed, establishing undecidability results for quantum correlation membership problems, and developing connections between hyperlinear profiles of groups and entanglement requirements in non-local games. Slofstra maintains an active research program with numerous collaborations, particularly with Ed Richmond in the area of Schubert varieties and with various researchers in quantum information. His work has appeared in top journals including the Journal of the American Mathematical Society, Forum of Mathematics Pi, and the Computational Complexity Conference. He is engaged in educational activities, having worked on turning his notes for PMATH 343 into a book titled 'Linear algebra and quantum probability.' He also maintains a podcast and YouTube channel, though he notes he has minimal social media presence.

Claudio Sacerdoti Coenمشاهده پروفایل

دانشیار

• Mathematical Knowledge Management
• Interactive Theorem Proving
• Logical Frameworks
• +۱۴ مورد دیگر

Claudio Sacerdoti Coen is an Associate Professor in Computer Science at the Department of Computer Science and Engineering , University of Bologna. His research focuses on Mathematical Knowledge Management , Interactive Theorem Proving , and their applications to functional programming languages and markup languages like XML and MathML. He has led the DAMA project for didactic applications of theorem provers. Employment: Associate Professor (2017–present), previously Lecturer (2007–2017) Education: Ph.D. in Computer Science (University of Bologna, 2004), Master’s in Computer Science (2000) Research Interests include: Integration of XML-based Mathematical Knowledge Management with Interactive Theorem Provers (e.g., Coq, Matita) Reduction strategies in the Calculus of (Co)Inductive Constructions Formal verification of algorithms and compilers Constructive analysis and formal topology User interface design for proof assistants Publications over the last decade highlight advancements in: Efficient substitution mechanisms for lambda calculi Formalization of mathematical theorems (e.g., Lebesgue’s Dominated Convergence Theorem) Development of proof assistant frameworks (Matita kernel, ELPI interpreter) Mathematical document structuring and search engine design

Enrico Tassiمشاهده پروفایل

پژوهشگر

• Interactive Theorem Proving
• Formal Verification
• Type Theory
• +۵ مورد دیگر

Enrico Tassi is a researcher at Inria, France, affiliated with the STAMP team. His work focuses on the technology of formal proofs, particularly type theory, interactive theorem proving, and its application to formalizing mathematics. He is a key contributor to the development of tools like Coq-Elpi , Hierarchy-Builder , and the small scale reflection Coq extension. His research spans proof assistant architecture, software design, and formal verification, with a strong emphasis on free software principles. Enrico completed his Ph.D. at the University of Bologna in 2008, where he designed the Matita interactive theorem prover. He contributed to the formalization of the Odd Order Theorem and the Paral-ITP project, aiming to scale Coq for large mathematical libraries. His software projects include Elpi , a meta-language for proof assistants, and past contributions to Debian as a developer (2006–2016), focusing on integrating the Lua language into Debian systems. His publications highlight innovations in unification algorithms, tactical design, and proof structuring techniques. Articles address challenges in bi-directional type inference, pattern-based proof command focusing, and nonuniform coercion implementations. His work on small-scale reflection and Hierarchy-Builder demonstrates expertise in algebraic hierarchies and formal library management. Current efforts target enhancing OCaml-based systems through Elpi's high-level programming capabilities. Key Collaborations : Mathematical Components team (INRIA), D.A.M.A. Project Major Tools : Coq-Elpi, Hierarchy-Builder, Matita Formalization Efforts : Ordered Uniformities, Odd Order Theorem, Finite Group Theory

Nikita Kovalمشاهده پروفایل

پژوهشگر

• Concurrent Programming
• Kotlin Coroutines
• Concurrent Data Structures
• +۶ مورد دیگر

Nikita Koval is a Researcher at JetBrains , specializing in concurrent programming, Kotlin coroutines, and testing frameworks. His work bridges academic research with industrial application, focusing on synchronization primitives, lock-free data structures, and JVM-based concurrency tools. Academic rank: Researcher Affiliation: JetBrains Research interests include: Concurrent algorithm design and optimization Formal verification of synchronization mechanisms Testing frameworks for JVM-based languages Memory-efficient lock-free data structures Scalability in coroutine communication Distributed systems debugging Publication trends show a focus on Kotlin coroutines, JVM concurrency, and testing frameworks like Lincheck. His work spans algorithm design (union-find, queues), formal verification (CQS), and practical tools for concurrency testing (Lincheck) across conferences like PPoPP, PLDI, and ECOOP. Scientific recognition: Nikita received the Best Paper Award at OPODIS 2019 for his work on concurrent union-find algorithms. His contributions to Lincheck and CQS have been adopted into Kotlin's core libraries. Workshop leadership: He offers a 4-day corporate workshop on concurrent algorithms, covering testing, debugging, and implementation of lock-free data structures, now booked for Q3/Q4 2025. The curriculum includes hands-on Java/Kotlin coding with topics like segment queues, fetch-and-add queues, flat combining, and concurrent hash tables.

Tomáš Skřivanمشاهده پروفایل

پژوهشگر ارشد

• Physics Simulation
• Computer Graphics
• Numerical Methods
• +۳ مورد دیگر

Tomáš Skřivan serves as a Research Fellow at the Hoskinson Center for Formal Mathematics , Carnegie Mellon University. His work bridges formal mathematics with practical scientific computing through the development of the SciLean library in Lean 4, targeting enhanced reliability in machine learning and simulation software. Skřivan's research spans interdisciplinary domains with core emphases on: Physics-based simulation of fluid dynamics and wave phenomena Computer graphics algorithms for light transport and rendering Formal verification techniques applied to numerical methods Mathematical modeling of viscoelastic materials His publication trajectory since 2016 reveals evolving expertise from computational fluid dynamics (water wave simulation, viscoelastic modeling) toward formal methods in scientific computing, consistently merging theoretical rigor with practical implementation. Recent work on SciLean represents a strategic pivot toward verified software foundations. As a key contributor to the Hoskinson Center's mission, Skřivan collaborates on projects leveraging proof assistants to eliminate errors in scientific code. The center, established through Charles Hoskinson's support, pioneers mathematically guaranteed correctness in computational science through formal verification frameworks.

• Quantum computation
• Quantum information, computation and communication

Professor Zhengfeng Ji is an Adjunct Professor at the Centre for Quantum Software and Information within the Faculty of Engineering and Information Technology at the University of Technology Sydney. His research focuses on quantum computation, quantum information theory, and quantum communication. Quantum complexity theory Quantum algorithms Quantum network optimization Entanglement characterization Recent publications highlight advancements in quantum network routing frameworks and quantum proof systems. He has secured multiple grants including the Sydney Quantum Academy Postdoctoral Fellowship and ARC Discovery Projects. Quantum Exponential Time Hypothesis Quantum PCP Conjecture Post-quantum Cryptographic Protocols Scientific awards include: SQA Scholarship Sydney Quantum Academy Postdoctoral Fellowship SUSTech Scholarship

Ilya Sergeyمشاهده پروفایل

دانشیار

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

Ilya Sergey is an Associate Professor at the National University of Singapore (NUS) School of Computing, with previous faculty appointments at University College London (2015-2018). His academic career spans multiple prestigious institutions including IMDEA Software Institute (postdoctoral position) and KU Leuven (PhD). His educational background includes a PhD in Computer Science from KU Leuven (2012), an MSc in Mathematics and Computer Science from Saint Petersburg State University (2008), and professional experience as a software engineer at JetBrains prior to academia. Sergey's research focuses on the intersection of programming language theory and practical software verification, with particular emphasis on concurrent systems , smart contracts , and program synthesis . His work bridges theoretical foundations in type theory and separation logic with practical applications in blockchain technology and Rust programming. He has developed novel techniques for verifying heap-manipulating programs, analyzing commutativity in distributed transactions, and synthesizing correct-by-construction code. Analysis of his recent publications reveals a clear trajectory toward practical verification of blockchain systems and concurrent data structures, with increasing focus on Rust programming language applications. His work demonstrates consistent innovation in mechanized reasoning techniques while maintaining relevance to real-world software challenges, particularly in the domains of smart contracts and distributed systems. Sergey maintains an active research group at NUS, as evidenced by his social media references to lab traditions and student collaborations. He frequently participates in major programming languages conferences as both author and committee member, serving in leadership roles including General Chair for ICFP 2025. His research lab follows distinctive traditions, including location-based Mattermost status updates when traveling. Sergey is deeply engaged with the programming languages community through conference organization, mentoring activities, and outreach initiatives such as nature walks for conference attendees.