Find Academic Supervisors

Boris BarbourView profile

Researcher

• Neuroscience
• Computational Neuroscience
• Neurophysiology
• +4 more

Boris Barbour is a researcher at the École Normale Supérieure (IBENS) in Paris, France, where he leads the Neuronal Algorithms group. His work bridges cellular neuroscience , neural network modeling , and electrophysiology , with a focus on cerebellar function and synaptic plasticity. He teaches extensively in the Imalis master's program and contributes to international training courses in microelectrode techniques and optical imaging . Primary Affiliation: IBENS, École Normale Supérieure, Paris Teaching Roles: Organizes M1 course S10 (Synaptic Foundations of Network Function), contributes to M2 Neurophysiology practicals, and co-tutors interdisciplinary neuroscience projects His research explores ephaptic coupling in cerebellar Purkinje cells via the pinceau structure, combining in vitro , in vivo , and in silico approaches. Key themes include stochastic gradient descent algorithms in cerebellar learning, synaptic weight distributions , and non-synaptic inhibition mechanisms . He has developed open-source tools like a patch-clamp amplifier tutorial and optimized Arduino USB code for experimental setups. Barbour is a co-organizer of the Paris Spring School and actively contributes to PubPeer for post-publication peer review. His work is supported by the Agence Nationale de la Recherche (ANR) and has produced foundational studies on cerebellar network dynamics , ion channel distribution , and neuronal information processing . Collaborations span institutions in France, the UK, and Japan, with authorship on studies challenging paradigms in synaptic transmission and extracellular impedance research.

Eric CANCESView profile

Professor

• Quantum Chemistry
• Molecular Simulation
• Numerical Analysis
• +3 more

Eric CANCES is a Professor and Director of CERMICS (Applied Mathematics Laboratory) at École nationale des ponts et chaussées (ENPC). His research focuses on mathematical and numerical analysis of quantum and classical molecular simulation models, with applications in Chemistry and Materials Science. He leads the Matherials project team (ENPC-INRIA), specializing in multiscale modeling and computational chemistry. Education: PhD Thesis: Molecular Simulation and Environmental Effects (1998) Habilitation Thesis: Contributions to Molecular and Multiscale Simulations (2005) Research Interests: He investigates SCF algorithms, perturbation methods, diffusion Monte Carlo, time-dependent models, continuum solvation models (IEF-PCM), laser control of quantum processes, and multiscale modeling for complex fluids. His work bridges theoretical rigor with computational efficiency, addressing challenges in electronic structure calculations, solvation effects, and molecular dynamics. Teaching: He teaches at ENPC, École Polytechnique, University of Paris-Dauphine, and Université Pierre et Marie Curie, covering numerical analysis, quantum physics, and partial differential equations. Labs & Collaborations: CERMICS (ENPC) and Matherials (ENPC-INRIA) projects. Active collaborations include the development of reduced basis approaches, domain decomposition methods, and variational Monte Carlo algorithms.

Hadrien CourtecuisseView profile

Researcher

• Medical Robotics
• Real-Time Simulations
• Finite Element Methods
• +3 more

Dr. Hadrien Courtecuisse is a Researcher (Chargé de Recherche) at CNRS, affiliated with the AVR/ICube team in Strasbourg since 2013. He holds a Ph.D. in Computer Science from Inria (2011), specializing in parallel architectures for medical simulations. His postdoctoral work at Cardiff University (2012) focused on biomechanical modeling of soft tissues. He later contributed to the Institut Hospitalo-Universitaire (IHU) as a research engineer. His expertise spans sparse linear algebra, real-time simulations, GPU computing, and medical robotics, particularly in surgical training systems and robotic control using inverse finite element models. Education: Ph.D., SHAMAN Team, Inria (2011) Postdoctoral Research, IMAM, Cardiff University (2012) Research Interests: Courtecuisse’s work emphasizes real-time computational methods for medical applications, including deformable object simulation, haptic feedback, and robotic assistance. He develops algorithms for contact response, topological changes, and parallel computing to enhance surgical training and robotic precision. His contributions address challenges in needle insertion, soft tissue interaction, and real-time error control in surgical simulations. Awards & Recognition: No specific scientific awards mentioned. Key Projects: MIMESIS Project (Inria): Focuses on medical robotics and real-time simulation for therapy planning. SOFA-FrameWork: Contributed to open-source simulation software for deformable objects and haptics. Calipso: Image editing via physics-based CAD models. Labs & Teams: Active in the AVR/ICube team at CNRS, collaborating with Inria and international institutions like Cardiff University.

Ken Friis LarsenView profile

Associate Professor

• Programming Languages
• Security
• Privacy
• +7 more

Ken Friis Larsen is an Associate Professor at the Department of Computer Science (DIKU), University of Copenhagen, specializing in programming languages, security, privacy, and functional programming. He contributes to projects like HIPERFIT (high-performance financial computing) and WallViz (visualization tools). Research Focus : Language design, formal methods, functional programming (Standard ML, Haskell, OCaml, Scheme), secure compilation, and performance optimization. Technical Leadership : Maintains Moscow ML (Standard ML implementation) and mGTK (functional GUI library). Key Publications : 2020: Hermes (secure compilation without side-channels) 2019: F (music composition language) 2016: Redomap (GPGPU performance in Futhark) Additional Contributions : Co-developed PaML (parser combinators in SML) Active participant in ICFP Programming Contest (2005, 2008, 2017) Advocate for rigorous testing practices (QuickCheck, Criterion) and type-driven design

Manuel EberlView profile

Researcher

• Theorem Proving
• Formal Verification
• Analytic Number Theory
• +4 more

Dr. rer. nat. Manuel Eberl is a Postdoc at the Computational Logic Group of the University of Innsbruck since September 2021. His research focuses on the formalization of pure mathematics in Isabelle/HOL , particularly in areas like analytic number theory, asymptotics, and algorithm verification. He contributes to the Archive of Formal Proofs and the Annals of Formalized Mathematics . Education : PhD in Computer Science from the Technical University of Munich (2021). Research Interests : Manuel works on theorem proving , formalizing mathematical concepts, and verifying algorithms. His interests span complex analysis , analytic combinatorics , abstract algebra , and randomized algorithms . Current projects include semi-automatic real asymptotics, formalization of Tom Apostol's analytic number theory textbook, and continued fractions. Publication Trends : His 15 most recent works (2023-2024) emphasize formalizing number theory (Chebyshev polynomials, Kummer's congruence), algorithm verification (Parallel Shear Sort), and mathematical analysis (Theta functions, critical points of polynomials). These publications reflect a strong focus on Isabelle/HOL and bridging pure mathematics with formal methods.

Daniel R. LicataView profile

Associate Professor

• Type Theory
• Category Theory
• Logic
• +9 more

Daniel R. Licata is an Associate Professor at Wesleyan University and a leading researcher in type theory, category theory, and functional programming. He earned his PhD from Carnegie Mellon University in 2011 and completed a postdoctoral fellowship at the Institute for Advanced Study (2012–2013). Research Interests : Type theory, category theory, logic, functional programming, cost analysis, and education. Teaching : He frequently teaches Functional Programming and has organized programming language summer schools. Research Trends : His work bridges homotopy type theory, directed type systems, and formal verification. Key contributions include gradual type theory, mechanized proofs in synthetic homotopy, and frameworks for substructural and modal logics. He often explores connections between type theory and computational mathematics. Service : He has served on program committees for POPL, ICFP, and CPP. He co-organized NEPLS at Wesleyan and contributed to the Twelf Wiki and tutorial projects.

Toby MurrayView profile

Professor

• Security
• Program Verification
• Formal Methods
• +4 more

Professor Toby Murray is a faculty member at the University of Melbourne's School of Computing and Information Systems, where he serves as Director of the Defence Science Institute and Co-Lead of the Computer Science Research Group. He holds a D.Phil. in Computer Science from the University of Oxford (2011) and previously worked at NICTA/Data61 and UNSW. His research focuses on security verification , neural network robustness , and software security , with projects including Verisimilar (verified secure ML), EDEFuzz (API vulnerability detection), and COVERN (concurrent program security). His work bridges formal methods with practical cybersecurity challenges, particularly in adversarial environments. Publication trends show consistent contributions in formal verification (35% of recent papers), security testing (30%), concurrency models (20%), and neural network security (15%), with evolving focus toward AI safety and web API vulnerabilities. Distinguished Paper Award at ICSE 2024 He leads a research group with 7+ PhD students and postdocs, focusing on cybersecurity assurance and collaborative fuzzing techniques. His team develops tools like Legion (test case generation) and Underflow (vulnerability detection).

Elsa L GunterView profile

Research Professor

• Formal Methods
• Programming Languages
• Software Engineering
• +7 more

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).

Nikita KovalView profile

Researcher

• Concurrent Programming
• Kotlin Coroutines
• Concurrent Data Structures
• +6 more

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.

Oded PadonView profile

Assistant Professor

• Programming Languages
• Verification
• Formal Methods
• +4 more

Oded Padon is a Senior Scientist (≈Assistant Professor) at the Weizmann Institute of Science , affiliated with the Faculty of Mathematics and Computer Science . He joined Weizmann in September 2024 after prior roles as a researcher at VMware Research Group , a postdoc in Alex Aiken's group at Stanford University , and a PhD student at Tel Aviv University under Mooly Sagiv . Research Interests : Oded's work focuses on developing principled algorithms for automated verification of complex systems, particularly distributed protocols, storage systems, and cluster management. He emphasizes decidable logics, primal-dual methods, and decomposition techniques. His recent interests include verification of deep neural networks , quantum computing , and leveraging large language models for verification tasks. Key projects: Ivy (safety/liveness verification), mypyvy (invariant inference), Verus (Rust verification), TASO (deep learning optimization), Quartz (quantum circuit superoptimizer). Scientific Awards : Azrieli Early Career Faculty Fellowship 2020 ETAPS Doctoral Dissertation Award 2017 Google PhD Fellowship in Programming Languages Radhia Cousot Young Researcher Best Paper Award (SAS 2017) Publications span decidable verification, invariant inference, quantum optimization, and machine learning for verification. His work has received Jay Lepreau Best Paper Award at SOSP 2024 (Anvil) and Distinguished Paper Awards at POPL 2024 (An Infinite Needle) and OOPSLA 2023 (Leaf).

Peisen YaoView profile

Researcher

• Program Analysis and Verification
• Program Synthesis and Optimizations
• Logic and Automated Reasoning
• +2 more

Peisen Yao is an academic researcher affiliated with Zhejiang University in China. His work spans programming languages, software engineering, and cybersecurity, with a focus on developing techniques to enhance software security, usability, and performance. He actively contributes to premier conferences as a committee member (e.g., PLDI, ICSE, ASE, ISSTA, OOPSLA, SAS). Research Focus: Yao's research integrates program analysis, verification, synthesis, and optimization. Key areas include: Advanced static analysis for security vulnerabilities (e.g., buffer overflows, divide-by-zero errors) Efficient symbolic abstraction and SMT solver testing Context-sensitive program analysis using formal language theory Automated invariant generation and code synthesis Publication Trends: His 15 most recent articles (2021–2025) emphasize scalable program analysis techniques, security validation, and practical tools for industry applications. Common themes include static analysis optimizations, formal verification, and novel testing methodologies for complex systems.

Daniel W. BarowyView profile

Associate Professor

• Programming Languages
• End-User Programming
• Spreadsheet Debugging
• +5 more

Daniel W. Barowy is an Associate Professor in the Department of Computer Science at Williams College . His research focuses on programming languages , particularly end-user programming , crowdsourcing , and spreadsheet debugging . He integrates program analysis with statistical techniques to improve software usability and robustness. Current affiliations: Williams College (2017-present) Education: University of Massachusetts Amherst (PhD, 2017) His research explores language abstractions for human-computer integration , with notable projects like ExceLint (spreadsheet error detection), FlashRelate (spreadsheet data extraction), and Riker (incremental build systems). He emphasizes artifact verification , securing PLDI 2015 Distinguished Artifact Award and USENIX ATC 2022 Best Paper . Recent publications demonstrate trends in spreadsheet reliability , crowdsourcing frameworks , and scalable educational tools . He has received "Artifact Verified" badges for multiple projects and actively contributes to software tool development , including AutoMan , ExceLint , and CheckCell . USENIX ATC 2022 Best Paper PLDI 2015 Distinguished Artifact Award Multiple "Artifact Verified" badges As an educator, he teaches CSCI 334: Principles of Programming Languages and CSCI 331: Computer Security . His work bridges theoretical PL research with practical applications in spreadsheet programming and crowdsourcing platforms .

Michele ChiariView profile

Researcher

• Formal Methods
• Approximate Computing
• Temporal Logic
• +7 more

Michele Chiari is a researcher at TU Wien (Vienna University of Technology) specializing in formal methods, software verification, and approximate computing. With active contributions to academic conferences like SPLASH, ICFP, and ECOOP, they combine theoretical rigor with practical applications in programming language design and analysis. Research Focus Temporal logic and model checking Probabilistic program inference Floating-point verification techniques Parallel parsing algorithms Conference Involvement 2025: Member of OOPSLA Review Committee (SPLASH conference) 2025: Program Committee member for VORTEX-track 2024: Committee Member in VORTEX conference 2023: External Reviewer for ECOOP Research Papers-track Publications 2025: Boosting Parallel Parsing through Cyclic Operator Precedence Grammars (SLE track) 2025: Exact Inference for Nested Discrete Probabilistic Programs (LAFI track) 2021: Verification of Floating-Point C/C++ Programs with math.h/cmath Functions (ICSE Journal-First Papers)

Tiago CogumbreiroView profile

Assistant Professor

• Program Analysis
• GPU Programming
• Parallel Programming
• +5 more

Tiago Cogumbreiro is an Assistant Professor at the University of Massachusetts Boston, specializing in formal methods and high-performance computing. His research focuses on detecting concurrency errors like data-races and deadlocks in GPU programs, with a strong emphasis on static analysis and correctness proofs. PhD from University of Lisbon Postdoc at Georgia Tech and Rice University Research assistant at Imperial College London His work spans program analysis, GPU programming, and parallel computing, addressing challenges in concurrency verification and error localization. Key contributions include developing tools for static analysis of GPU kernels, formalizing automata theory in education, and creating frameworks for model checking hierarchical systems. Recent publications highlight trends in data-race detection via array projections, concurrency repair with resource cost analysis, and mechanized computational theory for educational purposes. His personal website details ongoing projects and affiliations with the Software Verification Lab .

Michel DE LARAView profile

Professor

• Control Theory
• Stochastic Optimization
• Sustainable Management of Natural Resources
• +3 more

Mitchel DE LARA is a Professor at École des Ponts ParisTech (part of Institut Polytechnique de Paris), specializing in Mathematical and Computer Engineering. His research focuses on control theory, stochastic optimization, and their applications in energy systems, environmental modeling, and sustainable resource management. He holds a PhD in Mathematics and Applied Computer Science (1991) and a Habilitation to Supervise Research (2000). Education: PhD in Mathematics and Applied Computer Science, 1991 Habilitation à Diriger des Recherches (HDR), 2000 Research Interests: Optimization under uncertainty, viability theory, energy management systems, smart grids, and applications to natural resource sustainability. Recent work includes stochastic multi-stage optimization for clean energy transition and robust viable control of ecosystems. Teaching & Outreach: Leads international courses on stochastic optimization, including winter schools at CIRM and IMCA. Authored books like Stochastic Multi-Stage Optimization and Control Theory for Engineers . Serves on scientific committees for PGMO, INERIS, and the Institute for Energy Transition EFFICACITY. Labs & Teams: Researcher at CERMICS (Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique), collaborating on projects like SESO (Smart Energy and Stochastic Optimization) and Optim'Planet.