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

Shengyi Wangمشاهده پروفایل

پژوهشگر

• Formal Verification
• Programming Languages
• Mechanized Reasoning
• +۷ مورد دیگر

Shengyi Wang is an Associate Research Scholar in the Department of Computer Science at Princeton University, School of Engineering and Applied Science. He is actively engaged in research on formal verification, programming languages, and mechanized reasoning, with a focus on verifying concurrent systems, C programs, and network packet processing. Research Interests: His work centers on foundational and compositional verification of low-level systems using interactive theorem proving. Key areas include separation logic, concurrency, data structure invariants, and certified systems programming. He applies these to real-world challenges in systems security and network correctness. Recent Research Trends: His recent publications (2020–2024) show a strong trajectory in verifying complex systems such as concurrent C programs, P4-based packet processors, and enclave filesystems. The work consistently uses Coq and mechanized proofs to ensure correctness, emphasizing scalability and compositional techniques. Scientific Awards: No awards or fellowships are mentioned in the provided text. Advising and Grants: No formal students or advisees are listed. No grants or funding sources are explicitly mentioned. Labs and Teams: While not explicitly stated, his collaborations with researchers like Andrew W. Appel, Lennart Beringer, and William Mansky suggest involvement in Princeton’s formal methods and systems verification research group, likely associated with the Department of Computer Science.

Mauro Jaskelioffمشاهده پروفایل

استاد مدعو

• Functional Programming
• Algebraic Effects
• Monad Transformers
• +۴ مورد دیگر

Mauro Jaskelioff is an Adjunct Professor at the College of Exact Sciences, Engineering and Surveying of the National University of Rosario (Argentina), where he heads the Computer Science Department . He is also an adjunct researcher at CIFASIS-CONICET. His research focuses on functional programming, monad transformers, algebraic effects, and program calculation. Education : PhD in Computer Science (University of Nottingham, 2009), Licenciateship in Computer Science (National University of Rosario, 2004), and prior studies in Electronic Engineering. Research Highlights : Developed the Monatron extensible monad transformer library, formalized modular operational semantics, and advanced algebraic effect handling. His work bridges category theory and practical Haskell implementations. Teaching : Courses in Data Structures & Algorithms, Programming with Categories, and Programming Languages. Students : Supervised PhD/MS students including Martín Ceresa, Guido Martínez, Exequiel Rivas, and Pablo Buiras. Publications : Key contributions in monad transformers, applicative traversals, and effect systems. Collaborations with Tom Schrijvers, Nicolas Wu, and Graham Hutton.

• Proof Assistants
• Formal Verification
• Inductive and Coinductive Reasoning
• +۶ مورد دیگر

Andrei Popescu is a Senior Lecturer in the Department of Computer Science at the University of Sheffield, specializing in formal verification and proof assistants. Previously, he held faculty positions at Middlesex University and TU Munich. University of Sheffield (2020–present) Middlesex University (2014–2020) TU Munich (2010–2020) His research focuses on proof assistants (Isabelle/HOL), inductive/coinductive reasoning, syntax with bindings, and information flow security. Key projects include CoCon (verified conference system) and CoSMeDis (confidentiality-verified social media). Recent publications address Gödel's incompleteness theorems, modular (co)datatypes, and security verification. Awards include POPL Distinguished Paper Awards (2023–2025) and the RS 3 Best Paper Award (2012–2013). He teaches courses on software/hardware verification and previously taught decision support systems, web development, and verification techniques. Andrei is actively involved in conference organization and program committees, including POPL, ITP, and CSF.

• Formal Verification
• Programming Languages
• Term Rewriting Systems
• +۵ مورد دیگر

Ștefan Ciobaca is a researcher at the Faculty of Computer Science of the Alexandru Ioan Cuza University of Iasi , Romania. His work focuses on formal verification, programming language theory, and security protocols, with significant contributions to reachability logic and term rewriting systems. He actively mentors students in Dafny and F* verification techniques and develops tools for program equivalence proofs. Research Interests : Formal verification of cryptographic protocols, reachability logic, program equivalence, term rewriting systems, static analysis tools, and unification modulo builtins. Key Contributions : Developed the AKiSS tool for security protocol verification and contributed to the K Framework for programming language semantics. Students : Supervised multiple BSc/MSc theses on algorithm verification using Dafny and F*, including projects on SAT solvers, string algorithms, and data structure correctness. Collaborations : Partnered with Bitdefender on static analysis tool development and participated in international conferences like POPL, ICFP, and IJCAR. His recent work includes verifying image compression algorithms in Dafny and developing educational tools for logic-based program verification.

• Theoretical Computer Science
• Coalgebras
• Category Theory
• +۱۲ مورد دیگر

Stefan Milius is a Senior Lecturer (Akademischer Direktor) at the Chair of Theoretical Computer Science (Computer Science 8) within the Faculty of Engineering at Friedrich-Alexander University Erlangen-Nuremberg (FAU). He is actively involved in research, teaching, and academic leadership, with a strong emphasis on theoretical foundations of computer science. His research interests are centered on coalgebras, category theory, universal algebra, formal verification, semantics of iteration and recursion, and logic in computer science . He investigates algebraic and categorical methods for modeling and reasoning about computational systems, particularly through the lens of fixed points, automata, and logical semantics. His recent publications (2022–2025) span top-tier venues such as LICS, CALCO, ICALP, MFPS, POPL, and CONCUR, showcasing a consistent focus on algebraic language theory with effects, nominal automata, graded semantics, bialgebraic reasoning, and coalgebraic algorithms . The work often involves deep categorical constructions and has applications in program equivalence, formal verification, and automata minimization. Stefan Milius has received several prestigious awards, including: Ackermann Award (2006) for his PhD thesis Best Theory Paper at FM 2019 EATCS Best Paper Award at MFCS 2017 CALCO 2015 Best Paper Award Braunschweig Prize for Outstanding Academic Achievements (2000) He plays a significant role in the academic community as Editor-in-Chief of Logical Methods in Computer Science (since 2020), member of the advisory board of TheoretiCS , and editorial board member of Applied Categorical Structures . He has served on numerous program and steering committees, including FoSSaCS, LICS, MFPS, CALCO, and CMCS. He has also supervised student projects and thesis topics in theoretical computer science, though specific student names are not listed. He has been involved in externally funded research, including the BMBF project VerSyKo at TU Braunschweig (2011–2012), focusing on formal verification of synchronous software components. His current work continues to advance foundational methods in theoretical computer science with broad applicability.

Paul Downenمشاهده پروفایل

استادیار

• Programming Languages
• Logic
• Formal Methods
• +۵ مورد دیگر

Paul Downen is an Assistant Professor in the Miner School of Computer & Information Sciences at the University of Massachusetts Lowell, where he has been teaching since Fall 2021. His academic journey began with dual Bachelor's degrees in Computer Science and Computer Engineering from Lawrence Technological University in 2010, followed by a Ph.D. in Computer Science from the University of Oregon in 2017. He has also been a visiting researcher at INRIA and Microsoft Research. His educational background includes: Ph.D. in Computer Science (2017), University of Oregon - Eugene, OR Dissertation Title: Sequent Calculus: A Logic and a Language for Computation and Duality B.S. Computer Science (2010), Lawrence Technological University - Southfield, MI B.S. Computer Engineering (2010), Lawrence Technological University - Southfield, MI Dr. Downen's research centers on the intersection of logic and programming languages, with a focus on using logical foundations to improve the efficiency, correctness, and safety of programs and their compilation. His primary research lies in the Curry-Howard correspondence or proofs-as-programs paradigm, exploring how logical principles can inform both program design and compiler optimization. He is particularly interested in duality principles in computation, where he investigates how concepts like functional and object-oriented programming paradigms represent dual perspectives on the same underlying computational processes. His publication record shows a consistent focus on foundational aspects of programming languages, with recent work exploring copatterns, macro systems, evaluation strategies, and the relationship between type systems and machine representation. His research often bridges theoretical concepts with practical implementation, particularly through contributions to the Glasgow Haskell Compiler (GHC). Among his notable achievements are: Best Paper Award (2017) at Programming Languages Design and Implementation (PLDI) Oregon Doctoral Research Fellowship (2017) from the University of Oregon Best Paper Award nomination (2012) at European Joint Conferences on Theory and Practice of Software Best Paper Award nominee (2025) at Trends in Functional Programming Dr. Downen has been instrumental in organizing the Oregon Programming Languages Summer School, expanding its reach to diverse audiences through a "Foundations" lecture series. His teaching portfolio includes courses on Organization of Programming Languages, Assembly Language Programming, and Effective Functional Programming. His research has resulted in practical implementations within GHC, including Sequent Core (an alternative intermediate language based on sequent calculus) and Join Points (an optimization for control flow).

Herman Geuversمشاهده پروفایل

استاد

• Theoretical Computer Science
• Type Theory
• Lambda Calculus
• +۴ مورد دیگر

Herman Geuvers is a Professor of Computer Science (Theoretical Computer Science) at Radboud University Nijmegen, where he leads the Foundations group within the Institute for Computing and Information Science (ICIS), part of the Faculty of Science. He also holds a part-time professorship at the Technical University of Eindhoven's Faculty of Mathematics and Computer Science. His roles include chairing the Examination Board for Computing Science at Radboud and the board of the Institute for Programming Research and Algorithmics (IPA). He chairs the Steering Committee of the FSCD conference and is a member of the COST Action CA20111 on Formal Proofs. Geuvers holds a Master's and PhD in Mathematics from Radboud University (1988 and 1993, respectively). He has led significant projects like the ARPA initiative to advance Proof Assistant usage and contributed to the EUTypes network. His teaching includes advanced courses on Type Theory, Semantics, Complexity, and Proving with Computer Assistance. His research focuses on logic in computer science, type theory, lambda calculus, and formal methods. He emphasizes integrating proof assistants like Coq into mathematics and software verification. He has supervised numerous PhD students and remains active in organizing international conferences and workshops.

• Type Theory
• Interactive Theorem Proving
• Dependently Typed Programming
• +۶ مورد دیگر

Dr Anton Setzer is a Reader in the Department of Computer Science at Swansea University, part of the School of Mathematics and Computer Science. His research focuses on foundational aspects of type theory, interactive theorem proving, and formal verification, with particular emphasis on dependently typed programming and blockchain technologies. He is affiliated with the Computational Foundry at Bay Campus and supervises PhD students in critical domains like smart contracts and cybersecurity. Research Interests: Setzer’s work spans type theory (especially Martin-Löf variants), coinduction, proof theory, and their applications in dependently typed systems. His recent projects include formal verification of smart contracts (Solidity, Bitcoin Script) using Agda and exploring blockchain-enabled coordination protocols for UAVs. He also investigates foundational topics like predicative Mahlo universes in type theory. Academic Contributions: Setzer has pioneered techniques for integrating automated and interactive theorem proving, developed formal semantics for CSP processes in Agda, and contributed to coalgebraic type theory. His work on inductive-inductive definitions and copatterns has advanced functional programming methodologies. Supervision & Collaboration: Current PhD topics include SMT solving for railway systems, secure UAV coordination, and pharmaceutical supply chain technologies. He collaborates with Prof Arnold Beckmann on blockchain verification and Monika Seisenberger on railway safety systems. His teaching includes critical systems design (CSCM13) and blockchain technology (CSCM29).

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.

Håkon Robbestad Gylterudمشاهده پروفایل

دانشیار

• Dependent Type Theory
• Homotopy Type Theory
• Logic in Computer Science
• +۹ مورد دیگر

Håkon Robbestad Gylterud is an Associate Professor in the Department of Informatics at the University of Bergen, Norway. His academic work bridges mathematics and computer science, with a strong focus on logical foundations and formal systems. University: University of Bergen School: Faculty of Mathematics and Natural Sciences Department: Department of Informatics Position: Associate Professor His research centers on dependent type theory and homotopy type theory (HoTT), aiming to formalize mathematical reasoning and computational structures. He explores foundational concepts such as multisets, iterative sets, and data structures with symmetries within type-theoretic frameworks. His interests extend to category theory, algebra, topology, and the computer formalization of mathematics, emphasizing constructivity and rigorous logical modeling. The recent publications highlight a consistent trend in applying homotopy type theory to diverse mathematical structures—ranging from multisets and sets to planar graphs and category-theoretic constructions. These works demonstrate a deep engagement with univalent foundations and higher-dimensional reasoning, contributing to the theoretical robustness of type systems. No scientific awards are explicitly mentioned in the provided texts. Håkon advises research through collaborative publications, particularly with scholars like Jonathan Cubides and Daniel Gratzer. While no formal grants are listed, his sustained research output suggests active funding and academic support. He leads or contributes to research groups such as the Programming Theory group at UiB. He is involved in several research projects, including Algebraic Type Theory, Multisets and Sets in HoTT, Quoting Operations, and the Anti-Pattern Game. These initiatives reflect both serious theoretical inquiry and creative, interdisciplinary exploration.

• coalgebras
• computer science semantics
• universal algebra
• +۴ مورد دیگر

Dr. Stefan Milius is a Senior Lecturer (Akademischer Direktor) at the Chair for Theoretical Computer Science of Friedrich-Alexander University Erlangen-Nuremberg. His academic career spans theoretical computer science with a focus on categorical and algebraic methods applied to computational problems. Dr. Milius's research program centers on coalgebras and their applications in computer science, semantics of iteration and recursion, universal algebra and category theory, and logic and formal verification of systems. His work bridges abstract mathematical theory with practical computational applications, particularly in verification frameworks for software systems. His approach often combines category-theoretic perspectives with concrete computational problems. His publication record demonstrates consistent contributions to theoretical computer science, with recent work exploring stone duality, bialgebraic reasoning frameworks, automata theory with computational effects, and foundational aspects of programming language semantics. He has developed novel approaches to extending classical algebraic language theory to effectful settings and created new frameworks for reasoning about program equivalence in stateful and higher-order languages. Best Theory Paper at FM 2019 for "Generic Partition Refinement and Weighted Tree Automata" EATCS Best Paper Award at MFCS 2017 for "Eilenberg Theorems for Free" CALCO 2015 Best Paper Award for "Syntactic Monoids in a Category" Ackermann Award 2006 for PhD thesis Braunschweig Preis für hervorragende Leistungen im Studium, 2000 Dr. Milius has held significant editorial responsibilities including Editor-in-Chief of Logical Methods in Computer Science since 2020 and membership on the editorial boards of Applied Categorical Structures and TheoretiCS. He actively contributes to the theoretical computer science community through conference organization, serving as PC co-chair for FoSSaCS 2026 and MFPS 2025, and as a program committee member for numerous top-tier conferences including LICS, MFPS, and CALCO. Earlier in his career, he contributed to practical software development through projects like Alan, a Turing machine simulator developed during a 1997 software engineering practicum, and the VerSyKo project on verification of synchronous software components at TU Braunschweig (2011-2012).

Moa Johanssonمشاهده پروفایل

دانشیار

• Artificial Intelligence
• Automated Reasoning
• Neuro-Symbolic Methods
• +۴ مورد دیگر

Moa Johansson is an Associate Professor (Docent) at the Department of Computer Science and Engineering, Chalmers University, Sweden. She serves as Co-Director of Chalmers' Area of Advance in Information and Communication Technology, driving interdisciplinary AI research. PhD in Automated Theorem Proving (University of Edinburgh, 2009) Postdoc at University of Verona (2009-2011) Her research spans neuro-symbolic AI methods , combining neural networks with symbolic reasoning for applications in mathematics, sports science, and political science. Current projects include: NeSSy (2023-): Neuro-symbolic synthesis via reinforcement learning Neurodynamic Programming (2023-): Agent communication learning Countering Bias in AI (2023-): NLP applications in social sciences Bias in Political Analysis (2020-2025): WASP-HS funded Recent publications focus on theory exploration , neuro-symbolic methods , and AI applications across disciplines. Scientific achievements include a VINNMER Marie Curie Fellowship and Best Paper Award at CICM 2014. Led TRACKS project course on sports digitalization Developed HipSpec automated inductive prover

• Formal Methods
• Program Verification
• Term Rewriting Systems
• +۳ مورد دیگر

Ștefan Ciobâcă is a Professor at the Faculty of Computer Science , Alexandru Ioan Cuza University in Iași, Romania. He specializes in formal methods, program verification, and term rewriting systems, with a focus on tools like Dafny and K Framework. Current research: Interactive proof modes for Dafny (Amazon Research Award) Teaching: Verification Driven Program Development and Logic in Computer Science Research Interests include formal verification of programs, reachability logic, and static analysis of C/C++ code. His work bridges operational semantics with SMT solvers and applies coinductive methods to prove program properties. Scientific Awards include the Amazon Research Award Coq-mechanized soundness proofs DBLP publication citations Student Supervision covers Dafny/F*-based verification projects on algorithms like Boyer-Moore, DPLL, and greedy methods. He leads the RMT: Rewriting Modulo Theories tool development and contributes to K Tool framework.

Elsa L Gunterمشاهده پروفایل

استاد پژوهشی

• Formal Methods
• Programming Languages
• Software Engineering
• +۷ مورد دیگر

Elsa L Gunter is a Research Professor and Senior Lecturer at the University of Illinois at Urbana-Champaign's Department of Computer Science. Her academic background includes a Ph.D. in Mathematics from the University of Wisconsin, Madison. She leads research in formal methods, programming languages, and human-computer systems. Research Interests: Her work spans formal verification, programming language semantics, automated theorem proving, and security. She develops tools for compiler optimization verification, human-automation system safety, and concurrent program analysis. Key projects include the VeriF-OPT framework for parallel program transformations and Tutela for human-computer system protection analysis. Publications Focus: Her recent research emphasizes compiler verification, concurrency models, and human-system interaction. Work includes symbolic analysis for CSP, dependently-typed session systems, and robustness verification for safety-critical interfaces. Awards: Most Influential 10 Year Paper award at Requirements Engineering (RE 2010) EASST Best Software Science Paper at ETAPS 2001 Best Paper award at Fourth International Conference on Requirements Engineering (2000) Funding and Labs: Secured NSF grants for projects on parallel program verification ($450K) and human task analysis ($500K). Leads the Formal Methods and Verification Lab, collaborating with NASA on NextGen aviation systems. Student Advising: Mentored 7 PhD graduates and 12+ Master's students. Current PhD candidates work on secure distributed programming (Dennis Griffith) and formal methods for concurrent systems (Liyi Li, Susannah Johnson).

Ramyaaمشاهده پروفایل

استادیار

• Theory of Computation
• Computational Complexity
• Logic
• +۷ مورد دیگر

Ramyaa is an Assistant Professor in the Department of Computer Science & Engineering at New Mexico Tech. Her research focuses on the intersection of computation, logic, and emerging models of computation, including implicit complexity theory and biologically inspired neural networks. She also explores machine learning applications in real-world problems and interpretable AI. Education: Ph.D. in Computer Science, with a focus on theoretical foundations. Research Interests: Implicit complexity (relating logical complexity to computational resource constraints), formalization of computational models (e.g., biological neural networks), machine learning (including neural network training, adversarial robustness, and program synthesis), and applications in healthcare, security, and education. Her work emphasizes adaptable complexity measures for novel computational frameworks. Recent Trends in Publications: Recent work includes reinforcement learning for astrophysical data workflows, biologically inspired sleep algorithms for neural networks, and machine learning applications in nutritional epidemiology. She also explores educational technology, such as games for teaching logic and interactive programming tutorials. Grants & Advising: Advises research in machine learning, theoretical computer science, and interdisciplinary applications. Active in grant-seeking for projects at the intersection of theory and applications. No listed students, but collaborates widely with researchers globally. Affiliations: Fellow at the Simons Institute for the Theory of Computing (Berkeley), organizer of conferences like ICALT and CSR, and contributor to initiatives like WiCS at NMT. Teaches courses in formal languages, automata theory, and reinforcement learning.