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

Ken-etsu Fujitaمشاهده پروفایل

دانشیار

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

Ken-etsu Fujita is a Faculty Member at Tokyo Denki University and an Associate Professor at Gunma University's Department of Computer Science. His research focuses on theoretical computer science, particularly lambda calculus, type theory, and formal systems. With 62 publications that have received 2,052 reads and 238 citations, Fujita has established himself as a significant contributor to the foundations of computation and programming language theory. His research expertise spans Theoretical Computer Science, Abstract Algebra, Calculus, Semantics, and Lambda Calculus. Fujita's work consistently bridges mathematical logic with computational theory, exploring deep connections between proof systems and computation. His investigations into confluence properties, reduction systems, and type theories demonstrate sustained focus on foundational computational questions. Analysis of Fujita's publication timeline reveals consistent contributions from the 1990s through 2024, with recent work addressing undecidability in second-order propositional intuitionistic logic and properties of shuffling calculus. His research shows progression from foundational lambda calculus studies to more complex systems incorporating classical logic, existential types, and advanced reduction strategies, maintaining theoretical rigor while addressing increasingly sophisticated computational problems. Fujita has received recognition through citations of his work (238 citations), indicating his contributions are valued by the theoretical computer science community. His dual institutional affiliation provides a rich academic environment for research and collaboration, though specific awards aren't detailed in the available information. As a supervisor, Fujita appears to focus on theoretical computer science topics with emphasis on formal methods. His research group likely engages with fundamental questions about computation, programming language semantics, and logical foundations. Prospective students interested in these areas would find a supervisor with deep expertise and a strong publication record in core theoretical topics, offering opportunities to contribute to foundational research with potential implications for programming language design and formal verification.

Alexander Bolotovمشاهده پروفایل

استاد

• Automated Reasoning
• Graph-Based Reasoning
• Formal Methods
• +۱۳ مورد دیگر

Alexander Bolotov is a Professor at the University of Westminster's School of Computer Science and Engineering, where he serves as the Software Systems Engineering Research Group Leader and the Doctoral Researchers Development Programme Coordinator. He teaches Level 4 Mathematics for Computing and Level 5 Software Engineering Principles and Practice modules. His research spans Automated Reasoning, Graph-Based Reasoning, Specification and Verification of Complex Reactive, Concurrent and Distributed Systems, Formal Methods in Software Engineering, Logic, Temporal Logic, Proof Theory, On-Line Knowledge Repositories, and Ontologies. His expertise includes Formal Methods, Mathematical Modelling, Software Architecture, Program Reasoning and Logic Engineering. His recent publications demonstrate a strong focus on branching-time temporal logics, formal verification methods, ontology-based e-learning platforms, and applications in digital health evidence generation. His work bridges theoretical computer science with practical applications in healthcare, finance, and educational technology. Bolotov has successfully secured multiple research grants including Innovate UK projects RADIANT Implementation and RADIANT: Regulatory Science Empowering Innovation in Transformative Medical Software and AI, as well as funding from the Alan Turing Institute for developing frameworks for literature evaluation. He actively supervises doctoral students working on topics including ontology-driven frameworks for system integration, rich web applications, cloud computing load balancing, wireless sensor networks, and semantic selection of internet sources. His research group is involved with the Distributed and Intelligent Systems, Software Systems Engineering, and Centre for Parallel Computing.

Hiroshi Unnoمشاهده پروفایل

استاد

• Programming Languages
• Software Verification
• Artificial Intelligence
• +۳ مورد دیگر

Hiroshi Unno is a Professor at Tohoku University 's Research Institute of Electrical Communication and a Visiting Professor at the National Institute of Informatics. He has served on program committees for major conferences like POPL , PLDI , ICFP , and CAV . Dr. Unno's research focuses on Programming Languages Software Verification Artificial Intelligence Higher-Order Model Checking Refinement Type Systems Temporal Logic His recent work (2023-2025) includes advancements in algebraic effects , probabilistic program verification , and prophecy-based type systems . Key contributions appear in POPL , PLDI , and ICFP journals. Scientific awards include Distinguished Paper Award at POPL 2024 Distinguished Paper Award at POPL 2023 PPL 2014 Best Paper Award He leads development of tools like RCaml , Thrust , and EffCaml for refinement type checking. Current projects involve Kakenhi grants 20H04162 and 25H00446 . Dr. Unno actively contributes to academic communities through Program Committee roles at AAAI, CAV, and SAS Editorial work for IPSJ Transactions Organizing PPL Summer School (2022)

Jeremy G. Siekمشاهده پروفایل

استاد

• Programming Language Design
• Type Systems
• Mechanized Theorem Proving
• +۵ مورد دیگر

Jeremy G. Siek is a Professor at Indiana University Bloomington in the School of Informatics and Computing. His research spans programming language design, type systems, gradual typing, mechanized theorem proving, and optimizing compilers. Gradual typing integration in functional languages Co-inventor of the Boost Graph Library Former NSF CAREER award recipient Active in programming language foundations research Jeremy's research focuses on reconciling static and dynamic type checking through gradual typing, with current work on parametricity in polymorphic blame calculus, combining gradual typing with dependent types, and formal criteria for gradual type systems. He investigates high-performance implementations of gradual typing and its application to security enforcement. His recent publications examine verified nanopass compilers, gradual security guarantees, and parameterized cast calculi. He has received multiple distinguished visiting fellowships and maintains the Deduce proof assistant for educational use. NSF CAREER Award (2009) Distinguished Visiting Fellowships (2010, 2015) Jeremy leads the Center for Programming Systems at IU and advises Ph.D. students Tianyu Chen (gradual security) and Darshal Shetty (gradual dependent types). He teaches courses in compilers, data structures, and programming language foundations.

Alexandra Silvaمشاهده پروفایل

استاد

• Programming Languages
• Formal Verification
• Kleene Algebra with Tests
• +۶ مورد دیگر

Alexandra Silva is a Professor of Computer Science in the Department of Computer Science at Cornell University's College of Engineering. She joined Cornell as faculty in 2021 after previously serving as a Royal Society Wolfson Fellow and Professor of Algebra, Semantics, and Computation at University College London. Her research spans programming languages, formal verification, and theoretical computer science, with particular focus on Kleene Algebra with Tests (KAT), probabilistic programming, and automata theory. She has held numerous leadership roles in major programming languages conferences including POPL, PLDI, and ICFP. Dr. Silva completed her PhD at Centrum Wiskunde & Informatica (CWI) in Amsterdam under the supervision of Jan Rutten and Marcello Bonsangue, with her thesis entitled "Kleene coalgebra" defended in December 2010. Prior to her PhD, she was an undergraduate student at University of Minho in Portugal, where she completed a 5-year Mathematics and Computer Science degree in May 2006. Her research focuses on the modular development of specification languages and algorithms for models of computations, often from the unifying perspective offered by coalgebra. She has made significant contributions to Kleene Algebra with Tests, probabilistic programming semantics, network verification, and automata learning. Her work bridges theoretical foundations with practical verification tools, particularly in the domain of Software-Defined Networking where her NetKAT framework has gained significant attention. Analysis of her recent publications reveals a strong trend toward unifying frameworks for program verification, particularly through her development of Outcome Logic which provides foundations for both correctness and incorrectness reasoning. Her work increasingly integrates probabilistic and concurrent aspects of programming languages, with applications to network verification and security. The NetKAT ecosystem remains a central theme, with extensions to infinite state verification, symbolic execution, and learning-based approaches. Distinguished paper award for Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (POPL 2020) Dr. Silva advises a large research group with numerous PhD students, postdocs, and undergraduate researchers. Her group has produced significant work in programming languages theory, verification, and applications to networking. She has secured substantial research funding through various grants that support her work on formal methods for network verification and probabilistic programming. Her mentoring approach emphasizes both theoretical depth and practical impact, with many of her students moving to prestigious academic and industry positions. Her research group, spanning both Cornell University and University College London, focuses on developing theoretical foundations for programming languages with practical applications in network verification, probabilistic systems, and program analysis. The group maintains active collaborations with researchers at CWI, University of Oxford, and other leading institutions in programming languages and formal methods.

Alberto Momiglianoمشاهده پروفایل

دانشیار

• Logic in Computer Science
• Formal Methods
• Proof Theory
• +۶ مورد دیگر

Alberto Momigliano is an Associate Professor at the Department of Computer Science , University of Milan, Italy. His research focuses on formal methods, proof theory, and logical frameworks in programming languages. He has contributed extensively to property-based testing, coinductive proofs, and mechanized metatheory. Research Interests : Formal verification of programming languages Higher-order abstract syntax Logical frameworks (Hybrid, Beluga) Proof theory and type systems Property-based testing Coinductive methods Recent Articles explore substructural contexts, proof outlines for testing, and coinductive formalizations. His scientific awards include the Distinguished Paper Award at CPP 2025. Academic Activities : Program Committee Member at CPP 2024 and CPP 2025 Organized Logic Colloquium 2023 in Milan Steering Committee member of PPDP Involved in mechanizing metatheory with Coq automation

Assia Mahboubiمشاهده پروفایل

پژوهشگر

• Type Theory
• Formal Verification
• Automated Theorem Proving
• +۶ مورد دیگر

Assia Mahboubi is a tenured Researcher at Inria in France and an endowed professor at the Algebra and Number Theory section of the Vrije Universiteit Amsterdam . She works on formal verification, type theory, and computer-aided mathematics, using tools like the Rocq prover and Mathematical Components libraries. Research Focus : Foundations and formalization of mathematics in type theory, automated verification of mathematical proofs, interplay between computer algebra and formal proofs. Team : Supervises PhD candidates Vojtěch Štěpančík , Tomás Vallejos Parada , and Alain Chavarri Villarello , with former PhD students like Matthieu Piquerez and Enzo Crance . Grants & Awards : Holds an ERC Consolidator Grant for the FRESCO project. Active in academic service as a committee member for conferences like POPL, CPP, and ICFP, and organizer of workshops like CoqPL. Art & Science Outreach : Collaborates with Athenor national theater on C.H.A.T.S workshops and contributes to public engagement through talks and publications.

Aymeric Fromherzمشاهده پروفایل

پژوهشگر

• Formal Methods
• Secure Systems
• Rust Verification
• +۶ مورد دیگر

Aymeric Fromherz is a researcher at Inria Paris, focusing on formal methods for secure systems. He leads projects in Rust verification, high-assurance cryptography, and formalization of computational legal texts. Education includes a PhD from Carnegie Mellon University (co-advised by Bryan Parno and Corina Păsăreanu) and degrees from École Normale Supérieure. His research spans Rust verification (via Aeneas toolchain), verified cryptographic primitives , and computational law (through the Catala language). Recent publications address memory allocators, borrow-checking, and legal ambiguity detection. Major Scientific Awards : Distinguished Artifact Award (CAV 2025) Best Tool Paper Award (ESOP 2024) ACM SIGSAC Dissertation Award (2021) A.G. Milnes Dissertation Award (2021) He contributes to conferences like POPL, ICFP, and CPP, and participates in the Everest Project. The Prosecco Team at Inria Paris supports his research on formal methods and security.

Bernd Finkbeinerمشاهده پروفایل

استاد

• Synthesis
• Verification
• Monitoring of Reactive Systems
• +۹ مورد دیگر

Bernd Finkbeiner is a Professor of Computer Science at Saarland University and a faculty member at the CISPA Helmholtz Center for Information Security . He leads the Reactive Systems Group, which merged with CISPA in 2020, focusing on formal methods for ensuring system safety and security. University: Saarland University Research Institution: CISPA Helmholtz Center for Information Security His research spans synthesis, verification, and monitoring of reactive systems , with applications to program repair, static/dynamic analysis, and security guarantees . Recent work includes coinductive proofs for hyperliveness, asynchronous hyperproperty verification, and symbolic execution for bug detection. Key trends in his publications include: Hyperliveness and fairness in reactive systems Symbolic execution for hyperbug identification Integration of synthesis and verification techniques Formal guarantees for cybersecurity and software reliability He contributes to academic communities through committee roles at conferences like POPL, ICFP, SPLASH, and VMCAI.

Ranjit Jhalaمشاهده پروفایل

استاد

• Programming Languages
• Software Engineering
• Type Systems
• +۳ مورد دیگر

Ranjit Jhala is a Professor of Computer Science Engineering at UC San Diego's Jacobs School of Engineering, where he leads the Programming Systems Group. His research spans Programming Languages and Software Engineering, focusing on building reliable systems through Type Systems, Model Checking, Program Analysis, and Automated Deduction. His current projects include Flux for Rust verification, Liquid Haskell refinement types, and techniques for analyzing timing channels. Professor Jhala teaches courses on Programming Languages (CSE 130) and Graduate Programming Languages (CSE 230), with extensive experience teaching compilers and verification topics. Professor Jhala advises several students including Alexander Bakst, Ben Cosman, and Marc Andrysco. Notable former students include Niki Vazou (Postdoc at Maryland), Ravi Chugh (University of Chicago), and Patrick Rondon (Google).

• Competition Law
• Intellectual Property Law
• Digital Regulation
• +۶ مورد دیگر

Peter Georg Picht is Professor for Commercial Law at the University of Zurich's Institute of Law, where he conducts research at the intersection of competition law, digital regulation, and intellectual property. His work focuses on the rapidly evolving legal landscape governing digital markets, with particular expertise in Standard Essential Patents (SEPs), FRAND licensing, and the regulatory implications of artificial intelligence. Professor Picht's research interests span several interconnected domains: Digital market regulation under the Digital Markets Act (DMA), Digital Services Act (DSA), and Data Act Competition law implications of algorithms and artificial intelligence Standard Essential Patents and FRAND licensing frameworks Data governance and access requirements in competitive markets The intersection of intellectual property law with emerging AI technologies His recent publications reveal a consistent focus on the practical implementation challenges of EU digital regulations and the adaptation of competition law frameworks to address algorithmic markets. Professor Picht has published extensively on FRAND licensing disputes, contributing to the scholarly discourse on how courts should determine fair, reasonable, and non-discriminatory royalty rates for standard-essential patents. Professor Picht maintains active research collaborations with leading institutions including the Max Planck Institute for Innovation & Competition, ETH Zurich Center for Law and Economics, and the Swiss Federal Institute of Intellectual Property. His work bridges theoretical legal scholarship with practical regulatory challenges facing digital markets today, making significant contributions to both academic discourse and policy development in European competition law.

Umesh Virkumar Vaziraniمشاهده پروفایل

استاد

• Quantum Computing
• Quantum Complexity Theory
• Algorithms
• +۴ مورد دیگر

Umesh V. Vazirani is the Roger A. Strauch Professor of Electrical Engineering and Computer Science at the University of California, Berkeley, where he also serves as Director of the Berkeley Quantum Computation Center (BQIC). His academic journey began with a BS from MIT in 1981, followed by a PhD from UC Berkeley in 1986 under the supervision of Manuel Blum. With over three decades of contributions to theoretical computer science, Professor Vazirani has established himself as one of the founders of quantum computing. His research interests span multiple areas within theoretical computer science with a primary focus on quantum computing. Professor Vazirani's work encompasses quantum complexity theory, quantum algorithms, quantum information, computational complexity, and connections between quantum computation and other fields such as cryptography, game theory, and quantum gravity. His research has evolved from foundational work on quantum Turing machines and quantum complexity classes to contemporary investigations of quantum supremacy, verifiable quantum advantage, and certifiable randomness. Professor Vazirani has received numerous prestigious recognitions for his work, including: Election to the National Academy of Sciences (2018) Fulkerson Prize for outstanding papers in discrete mathematics (2012) ACM Fellow for contributions to theoretical computer science and quantum computation (2005) As an advisor, Professor Vazirani has mentored numerous successful students who have gone on to prominent positions in academia and industry. His current advisees include Jonah Sherman, Guoming Wang, Anupam Prakash, Urmila Mahadev, and Seung Woo Shin. His former students include notable researchers such as Scott Aaronson (MIT), Madhu Sudan (Harvard), Sanjeev Arora (Princeton), and Andris Ambainis (University of Latvia). His research has been consistently funded through various grants supporting quantum computing research, allowing him to maintain an active research group exploring fundamental questions in quantum information science. Professor Vazirani leads the Berkeley Quantum Computation Center, which serves as a hub for quantum information research at UC Berkeley, fostering collaboration between computer scientists, physicists, and engineers working on quantum technologies. The center supports research in quantum algorithms, quantum complexity, quantum error correction, and the theoretical foundations of quantum computing.

• formal methods for security
• programming languages
• design and verification of security-critical systems
• +۱۱ مورد دیگر

Cătălin Hrițcu is a tenured faculty member and head of the Formally Verified Security group at the Max Planck Institute for Security and Privacy (MPI-SP) in Bochum, Germany. He also serves as Adjunct Professor in the Faculty of Computer Science at Ruhr University Bochum (RUB), where he is affiliated with HGI and the CASA Cluster of Excellence. His educational background includes: PhD from Saarland University in Saarbrücken, Germany Habilitation from ENS Paris Hrițcu's research focuses on developing rigorous formal techniques for security. His primary interests span three interconnected areas: Formal methods for security: secure compilation, compartmentalization, memory safety, speculative execution defenses, information flow control, and security protocols Programming-languages techniques: program verification, machine-checked proofs, dependent types, formal semantics, and property-based testing Design and verification of security-critical systems: compilation chains, reference monitors, tagged hardware architectures, and high-assurance cryptography His recent publications reveal a strong trajectory toward addressing real-world security challenges through formal methods, with increasing emphasis on hardware security aspects like speculative execution vulnerabilities and memory safety. Hrițcu has received significant scientific recognition: ERC Starting Grant on formally secure compilation Distinguished Paper Award at CSF 2025 for FSLH: Flexible Mechanized Speculative Load Hardening Distinguished Paper Award at CSF 2021 for SSProve As an advisor, Hrițcu has mentored numerous PhD students and postdoctoral researchers who have gone on to successful academic careers. His group receives substantial funding through projects like ERC SECOMP. He has co-authored volumes of the Software Foundations textbook series and actively teaches courses at RUB. Hrițcu leads the Formally Verified Security research group at MPI-SP, which includes PhD students, postdocs, and research interns working on cutting-edge problems at the intersection of programming languages and security. The group has made significant contributions to verification tools including F* and Coq, with applications in secure compilation and cryptographic verification.

Yang Liuمشاهده پروفایل

استاد

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

Yang Liu is a Full Professor and University Leadership Forum Chair at the School of Computer Science and Engineering, Nanyang Technological University (NTU) in Singapore. He serves as Programme Director for HP-NTU Digital Manufacturing Corp Lab, Deputy Director of the National Satellite of Excellence of Singapore, and Cluster Director in Cybersecurity at Energy Research Institute @NTU. His research spans Cybersecurity , Software Engineering , and Artificial Intelligence . He leads research in malware modeling and detection, vulnerability analysis using machine learning and program analysis, formal verification of security systems, program specification learning, performance analysis, Android system security, and AI security, robustness, fairness, and explainability. His notable work includes the Process Analysis Toolkit (PAT) for model checking and the Deep-Series tools for deep learning testing. Professor Liu has published extensively in top-tier conferences including ASE, ICSE, FSE, ISSTA, and S&P. His research demonstrates strong trends toward integrating AI/ML techniques with traditional software engineering and security approaches, particularly focusing on large language models for code analysis, vulnerability detection, and program repair. Recent publications show a growing emphasis on blockchain security, smart contract analysis, and addressing security challenges in AI systems. NRF Investigatorship (Class 2020) ACM's Distinguished Speaker Nanyang Research Award (Young Investigator) Microsoft Asia Research Fellowship 20 Year ICFEM Most Influential System Award for PAT Multiple ACM SIGSOFT Distinguished Paper Awards Professor Liu actively advises students and has seen notable student achievements, including Singapore Data Science Consortium research award winners and AISG PhD Fellowship recipients. His research is supported by numerous grants including a $900,000 NTU-NAP grant for Formal Verification on Cloud and a $471,000 grant for Vulnerability Detection in Binary Code. He leads the HP-NTU Digital Manufacturing Corp Lab and contributes to RollsRoyce@NTU Corporate Lab research on complex business systems simulation.

Jooyong Yiمشاهده پروفایل

دانشیار

• Program Analysis
• Program Repair
• Software Testing
• +۳ مورد دیگر

Jooyong Yi is an Associate Professor in the Department of Computer Science and Engineering at UNIST (Ulsan National Institute of Science and Technology). He leads the LOFT (Lab of Software), focusing on autonomous techniques for software reliability in AI-generated code environments. Research Interests: His work spans program analysis, automated repair, testing/debugging, and verification. Core themes include developing scalable methods for bug detection (via static/dynamic analysis), AI-compatible repair systems, and verification frameworks for safety-critical systems. Recent emphasis integrates fuzzing techniques with repair validation. Publication Trends: His 15 most recent works (2015-2025) show progression from foundational program repair techniques (e.g., Angelix, DirectFix) toward AI-era innovations: greybox fuzzing for efficiency, memory-leak repair for web frameworks, and deep-learning library testing. Over 50% of publications focus on optimizing repair validation and scalability. Awards: ACM Distinguished Paper Award at ASE 2023 Students & Grants: Currently advises 5 PhD, 1 MS/PhD, and 2 MSc students. Secured ₩20B+ in funding for projects including: MSIT Binary Micro-Security Patch Technology (2024-2026) Patch Validation for Automated Repair (2023-2026) AI-Powered Low-Code Platform (2023-2025) Memory-Safe Language Integration (2024-2027) Lab: LOFT lab develops verified repair tools (e.g., LeakPair, Verifix) and benchmarks (BUGSC++), prioritizing human oversight in AI-generated software.