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

Christian Urbanمشاهده پروفایل

مدرس

• Theorem provers
• Programming languages
• Compilers
• +۴ مورد دیگر

Dr. Christian Urban is a Lecturer in Computer Science at King's College London's Department of Informatics, part of the Faculty of Natural, Mathematical & Engineering Sciences. He is actively involved in the Security Hub and King's Cybersecurity Centre, an EPSRC-NCSC Academic Centre of Excellence in Cyber Security Research. His research focuses on theorem provers, programming languages, compilers, type systems, and functional programming. He has led and contributed to multiple research projects, including Formal Verification of Practical Nominal Unification Algorithms (Royal Society-funded) and Nominal Techniques for Verification Environments . Research Interests: Formal methods for program correctness Automated reasoning and theorem proving Programming language semantics and compilation Nominal logic and its applications His work bridges theoretical foundations with practical tools, emphasizing verified software systems and formal verification techniques. Recent Projects: Formal Verification of Practical Nominal Unification Algorithms (2025-2027) Nominal Techniques for Verification Environments (2021-2024) Efficient and provably correct schedulers for many-core CPUs (2013-2015) Awards: Skolem Award from CADE (2015) Grants & Collaborations: Dr. Urban has secured funding from the Royal Society, DFG, and other bodies. His collaborations include projects on XML query optimization, schedulers for parallel architectures, and verified parser implementations. Labs/Teams: As part of the Informatics Department and Security Hub, he contributes to interdisciplinary research on software systems security, formal methods, and verified programming tools.

Cody Dunneمشاهده پروفایل

دانشیار

• Data Visualization
• Graph and Network Data
• Multidimensional Data
• +۱۵ مورد دیگر

Cody Dunne is an Associate Professor at the Khoury College of Computer Sciences, Northeastern University, leading the Khoury Vis Lab. His research focuses on data visualization, particularly layered network visualizations and their application in domains like cybersecurity, healthcare, and digital humanities. He is renowned for contributions to algorithmic visualization techniques and human-centered evaluation methodologies. Research Interests: Data Visualization & Network Analysis Layered Graph Layout Algorithms Immersive Analytics (VR/XR) Differential Privacy Visualization Cybersecurity Visualization User-Centered Design Recent Work: Prioritizes reproducibility and open science practices, including benchmark dataset development and systematic reviews of visualization methods. Recent projects involve collaborative VR environments for group awareness and optimizing graph layout algorithms. Awards & Recognition: SIGMOD 2024 Best Paper Honorable Mention GD 2023 Best Poster Honorable Mention Advising & Collaborations: Supervises PhD students in visualization research (e.g., Sara Di Bartolomeo, David Saffo). Active in cross-disciplinary projects with Northeastern's CHI and IEEE VIS communities. Labs: Directs the Khoury Vis Lab, which develops tools like Indy Survey Tool for systematic literature reviews and visualization benchmarking.

• Computer Architecture
• Parallel Programming
• Compilers
• +۶ مورد دیگر

Martha Kim is an Associate Professor of Computer Science at Columbia University's Fu Foundation School of Engineering and Applied Science. She serves as a member of the Data Science Institute, co-chairs the Center for Computing Systems for Data-Driven Science, and chairs the Computer Engineering Program. Her academic appointments span multiple research centers and educational initiatives at Columbia. Dr. Kim earned her PhD in Computer Science and Engineering from the University of Washington and completed her undergraduate studies in Computer Science at Harvard University. Her educational background has provided a strong foundation for her research and teaching career in computer systems. Her research interests focus on the intersection of hardware and software systems, specializing in computer architecture, parallel programming, compilers, and low-power computing. Dr. Kim's work explores innovative approaches to hardware accelerator design, with particular emphasis on improving usability of accelerators and developing data-centric accelerator architectures. Her research has investigated low-cost chip manufacturing systems, reconfigurable communication networks, and fine-grained parallel application profiling techniques. The publication record reveals a consistent research trajectory focused on hardware-software co-design, with recent work emphasizing practical implementations of architectural concepts. Her articles demonstrate expertise across multiple subfields including thermal management, database acceleration, and energy-efficient computing, with publications appearing in top-tier conferences like ASPLOS, MICRO, and ISLPED. Rodriguez Family Award (2013) Edward and Carole Kim Faculty Involvement Award (2015) NSF CAREER award (2013) Anita Borg Early Career Award (2016) Dr. Kim actively mentors doctoral students through the ARCADE Lab, with current advisees including Martha Barker, Thomas Repetti, and Andrea Lottarini, and previously guiding Melanie Kambadur (PhD 2016) and Lisa Wu (PhD 2014). Her research has received substantial funding from major organizations including C-FAR, DARPA, Google, Intel, and the National Science Foundation, enabling significant contributions to computer architecture research. She leads the ARCADE Lab at Columbia University, which serves as the primary research hub for her team's work on computer architecture and systems. The lab environment fosters collaboration between faculty, graduate students, and industry partners to advance research in hardware acceleration and energy-efficient computing.

Nicole Aponte Santiagoمشاهده پروفایل

استاد مدعو

• Calcium Signaling
• Developmental Biology
• Neuroscience
• +۴ مورد دیگر

Nicole Aponte Santiago is an Adjunct Professor (part-time) at the University of San Francisco (USFCA). Her research focuses on calcium signaling pathways critical for embryonic development and their links to human developmental diseases. She employs zebrafish as a model organism and combines molecular biology with transcriptomic analysis to study synaptic diversity and neural circuit development. Education: PhD in Biology, Massachusetts Institute of Technology (MIT), 2020 BS in Cellular & Molecular Biology, University of Puerto Rico – Río Piedras (UPR-RP), 2013 Her work bridges genetics and neurobiology, investigating how calcium signaling regulates neuronal subtypes (e.g., tonic vs. phasic motoneurons) and their role in synaptic plasticity. She has pioneered techniques to study whole-embryo transcriptomics and synaptic competition in Drosophila. Her articles highlight themes like SNARE protein function, homeostatic plasticity mechanisms, and fluid dynamics in larval zebrafish brains. Recent work emphasizes molecular logic underlying synaptic diversity and therapeutic implications for developmental disorders. Awards: BRAIN Initiative Fellow (NRSA Postdoctoral Fellowship) NSF Graduate Research Fellowship UCSF IRACDA Associated Scholar She serves on the Annual BRAIN Meeting Program Committee and has prior experience as a postdoctoral researcher at UCSF under Dr. Dan Wagner. Her lab integrates classical molecular methods with cutting-edge transcriptomic tools to address developmental neurobiology challenges.

• Formal Verification
• Automated Reasoning
• SAT and SMT Solving
• +۷ مورد دیگر

Bernd Becker is a Professor in the Department of Computer Science at the Faculty of Engineering, University of Freiburg, Germany. He has been actively publishing in the fields of formal methods, hardware verification, and automated reasoning since the 1980s, with a sustained record of high-impact publications up to 2025. His research interests span formal verification, SAT and SMT solving, hardware testing, probabilistic systems, and embedded systems security. His work bridges theoretical advances in automated reasoning with practical applications in processor design, RISC-V verification, and safety-critical systems. The recent articles highlight a strong focus on applying formal methods to emerging challenges in hardware and AI, including POMDPs for robot planning, RISC-V security, GPU verification, and energy-efficient monitoring. There is a clear trend toward integrating symbolic computation with machine learning and probabilistic reasoning. Bernd Becker has collaborated extensively with researchers such as Ralf Wimmer, Ilia Polian, and Matthias Sauer, indicating leadership in a large, interdisciplinary research group. His work has been supported by numerous grants, though specific details are not listed in the source text. He has contributed to major conferences such as DATE, FMCAD, and SAT, and has mentored several students and researchers, though specific names are not provided. He is involved in projects related to secure scan networks, physical unclonable functions, and smart home systems.

• Programming Languages
• Program Synthesis
• Program Verification
• +۷ مورد دیگر

Jedidiah McClurg is an Assistant Professor in the Department of Computer Science at Colorado State University, with prior faculty appointments at Colorado School of Mines and the University of New Mexico. He received his Ph.D. in Computer Science from the University of Colorado Boulder in 2018, where he was a member of the CUPLV research group under the supervision of Pavol Cerny. His research focuses on programming languages, program synthesis, verification, and their applications in networking, compilers, and distributed systems. His educational background includes an M.S. in Computer Science from Northwestern University (2013) and a B.S. in Electrical Engineering from the University of Iowa (2009). He has completed internships at Microsoft Research (RiSE Group, 2014) and Rockwell Collins (2011, 2013, 2004). McClurg’s research interests include programming languages, formal verification, software synthesis, software-defined networking, compilers, and system security. His work aims to develop tools and techniques that help programmers write more secure, reliable, and efficient code, especially in safety-critical domains. He has led multiple NSF-funded projects, including FMitF and CRII grants, totaling over $1 million in funding. His recent publications span high-impact venues such as PLDI, CAV, DISC, and SOSR, with topics ranging from neural network optimization and regular expression synthesis to network program verification and FEC code generation. These works reflect a consistent trend toward automating correctness, improving performance, and enabling scalable solutions in systems and networking. NSF CRII: SHF: Foundations for Stateful Network Programming ($175,000) NSF FMitF: Game Theoretic Updates for Network & Cloud Functions ($355,000 for him) NSF FMitF: Robust Enforcement of Customizable Resource Constraints ($250,000 for him) NSF GRFP (awarded to student Lauren Baker) He has advised multiple graduate and undergraduate students, many of whom have secured positions at leading tech companies such as Google, Apple, and Amazon. He is actively involved in academic service, having served on program committees for PLDI, SOSR, CAV, and others, and as a reviewer for journals like IEEE/ACM Transactions on Networking (ToN) and ACM Transactions on Software Engineering (TSE). He also contributes to open-source research via GitHub and maintains a strong online academic presence.

• Computational Modeling
• Mathematics
• Education Systems
• +۲ مورد دیگر

Patricia Engrácia is an Assistant Professor in the Department of Social and Business Sciences at Iscte - University Institute of Lisbon, where she also serves as Deputy Director of the School of Applied Digital Technologies. She holds a PhD in Mathematics from the University of Lisbon (2005-2009) and additional qualifications in Applied Mathematics. Engrácia is an Associate Researcher at ISTAR-Iscte - Research Center in Information Sciences, Technologies and Architecture, specializing in Computational Modeling of Systems. Her research spans computational modeling, mathematical logic, and education systems analysis. Engrácia's work includes foundational studies in proof theory and functional interpretation, as well as extensive research on educational outcomes, equity metrics, and student progression in Portuguese education systems. Engrácia's publications demonstrate two primary research trajectories: (1) theoretical work in mathematical logic and proof theory, focusing on bounded functional interpretations and their applications; and (2) applied education research analyzing student pathways, academic success indicators, and equity metrics in basic, secondary, and higher education systems. Her recent work emphasizes longitudinal studies of student outcomes and educational equity assessments. As an active researcher, she contributes to multiple institutional reports on education metrics while maintaining her foundational work in computational logic. Her affiliations with both technical (Applied Digital Technologies) and social science (Social and Business Sciences) departments reflect her interdisciplinary approach to computational modeling applications.

Amal Ahmedمشاهده پروفایل

استاد

• correct and secure compilation
• linking types for multi-language software
• typed compilation of dependent types
• +۵ مورد دیگر

Amal Ahmed is a Professor in the Department of Computer Science at Northeastern University's College of Computer and Information Science. She is an active researcher and academic leader in programming languages, with significant contributions to type systems, compiler verification, and language interoperability. Her work bridges theoretical foundations with practical systems applications, particularly in the areas of gradual typing and secure compilation. Dr. Ahmed's research focuses on correct and secure compilation , linking types for multi-language software , typed compilation of dependent types , semantics and logical relations , gradual typing , and safe language interoperability . Her work explores how to formally verify compilers and ensure type safety across language boundaries, with applications to modern systems like WebAssembly. She has developed novel semantic approaches to application binary interfaces and language interoperability that provide strong security guarantees. Her recent publications show a consistent focus on formal methods for language design, with increasing attention to probabilistic programming and separation logic. She has made significant contributions to understanding how gradual typing systems can maintain parametricity and how borrowing concepts from Rust can be formally modeled. Her work on RichWasm demonstrates practical applications of her theoretical research to web technologies. Dr. Ahmed actively serves the programming languages community through leadership roles in major conferences. She has chaired program committees, organized workshops, and mentored students through the Programming Languages Mentoring Workshop (PLMW). Her involvement spans POPL, ICFP, PLDI, SPLASH, and related conferences, where she regularly presents research and participates in steering committees. As an educator and mentor, she has presented numerous talks on managing research, working with advisors, and navigating academic careers, particularly through the PLMW series. She has chaired doctoral symposia and served on review committees, demonstrating her commitment to developing the next generation of programming languages researchers.

Federico Olmedoمشاهده پروفایل

استادیار

• Program Verification
• Probabilistic Programming
• Language-Based Security
• +۵ مورد دیگر

Federico Olmedo is an Assistant Professor at the Computer Science Department of the University of Chile, where he teaches courses like Program Analysis and Verification ( CC4101 ) and Discrete Mathematics for Computer Science ( CC3101 ). His research focuses on the semantics and verification of probabilistic programs , with applications in language-based security , differential privacy , and formal verification of cryptographic systems . Previously, he was a postdoctoral researcher at RWTH Aachen University and earned his PhD from the Technical University of Madrid in 2014. Research Interests : Program Verification Probabilistic Programming Language-Based Security Theorem Provers Quantum Computing Cryptographic Proofs Publications span formal methods for probabilistic programs, including weakest precondition calculi , runtime analysis of quantum programs , and machine-checked proofs for cryptographic protocols . Notable works include the Best Theory Paper Award at ECOOP 2016 and foundational research on conditioning in probabilistic programming . He co-developed the CertiCrypt and CertiPriv frameworks for verifying cryptographic proofs and differential privacy in Coq. Scientific Awards : ECOOP 2016 Best Theory Paper Award

• Formal Methods
• Graph Databases
• Property Graph Schema
• +۵ مورد دیگر

Ştefania-Gabriela Dumbravă is an Associate Professor at Institut Polytechnique de Paris (ENSIIE/Samovar Laboratory). Her research focuses on formal methods for graph database algorithms , including schema design, query processing, and verification. She contributes to international standards through co-chairing VLDB 2026 Demonstration Track and organizing workshops like VLDB Summer School 2025 . Dumbravă serves on editorial boards (e.g., ACM Transactions on Database Systems ) and program committees for top-tier conferences ( SIGMOD , ICDE ). Research Interests include formal verification of graph databases , property graph schema constraints , certified inference engines , and distributed graph systems . She integrates proof assistants (Coq, Isabelle) with practical database development, emphasizing reliability and mechanical correctness . Her work spans theoretical foundations (e.g., category theory , type theory ) and real-world applications (e.g., transit accessibility analysis , SDN controllers ). Selected Scientific Awards : EASST Best Software Science Paper Award (ICGT 2025) SIGMOD Best Paper Award (2023) VLDB Best Regular Paper Runner-Up (2022) D4Gen Hackathon 3rd Prize Teaching includes Graph Databases , Functional Programming , and Formal Languages at ENSIIE, with additional roles at Université Paris-Saclay, ENS Lyon, and Université Rennes 1. She supervises research internships and participates in gender parity initiatives (e.g., Paris-Saclay Women & Science Mentorship Program).

Felipe Werndl Trevizanمشاهده پروفایل

مدرس ارشد

• Artificial Intelligence
• Automated Planning and Scheduling
• Reasoning under Uncertainty
• +۹ مورد دیگر

Felipe Werndl Trevizan is a Senior Lecturer in the School of Computing at the Australian National University (ANU), where he conducts research at the intersection of Artificial Intelligence, Operations Research, and Machine Learning. His work focuses on automated planning and scheduling, reasoning under uncertainty, heuristic search, and machine learning for planning. He is actively involved in research projects related to uncertainty-centric pilot assistance systems and probabilistic planning. His research interests include: Automated Planning and Scheduling Probabilistic and Multi-Objective Planning Heuristic Search and Admissible Heuristics Deep Learning for Generalized Planning Constraint-Based and Risk-Aware Planning Learning Heuristics from Data His recent publications demonstrate a strong trend toward integrating machine learning with classical planning techniques, particularly in learning reliable, domain-independent heuristics using both deep and classical machine learning methods. He has developed novel algorithms for constrained and stochastic shortest path problems, multi-objective probabilistic planning, and generalized planning using neural networks. His scientific awards include: Best Paper Award at ICAPS 2016 Best Paper Award at ICAPS 2017 2016 Kikuchi-Karlaftis Best Paper Award from the Transport Research Board Felipe Werndl Trevizan is registered to supervise research students and has advised several successful projects in AI planning. He has secured research grants for projects such as 'Integrated Planning for Uncertainty-Centric Pilot Assistance Systems' and 'Chance-Constrained POMDP for Pilot Assistance Systems' at ANU. He is also organizing key community events including the 'Reliability In Planning and Learning (RIPL)' workshop and a tutorial on 'Learning for Planning' at ICAPS 2025. He is affiliated with the School of Computing at ANU and previously worked as a Senior Research Scientist at NICTA and Data61/CSIRO. His research is supported by active collaborations with leading researchers such as Sylvie Thiébaux, Hanna Kurniawati, and others.

Ian Starkمشاهده پروفایل

مدرس ارشد

• Programming Languages
• Theoretical Computer Science
• Concurrency Theory
• +۱۵ مورد دیگر

Ian Stark is a Senior Lecturer in Computer Science at the School of Informatics , The University of Edinburgh , and a key member of the Laboratory for Foundations of Computer Science (LFCS) . His research centers on mathematical models of programming languages and concurrent systems, with a focus on reasoning about name generation and secure mobile code. Research Interests: Ian Stark's work lies at the intersection of theoretical computer science and programming language semantics. He investigates foundational models such as the π-calculus and nu-calculus, applying them to problems in security, resource management, and systems biology. His research in denotational and operational semantics provides rigorous frameworks for understanding program behavior, particularly in systems with dynamic name creation and local state. He has made significant contributions to proof-carrying code and resource guarantees for mobile and embedded systems, ensuring safety and security through formal methods. The trends in his publications over the last 15 years show a consistent focus on foundational models for concurrency and security. Early work established semantic models for the π-calculus, while later research applied these to practical domains like mobile code security and systems biology. His articles frequently appear in top venues like LICS, FOSSACS, and TCS, reflecting a strong theoretical grounding with applications in verification and language design. Scientific Recognition: Advising and Funding: Stark has supervised several PhD students, including Marek Kwiatkowski, Chris Banks, Uli Schöpp, Sam Lindley, and Tom Chothia. He has been involved in major collaborative research projects such as REMS (Rigorous Engineering for Mainstream Systems), App Guarden (Resilient Application Stores), CerCo (Certified Complexity), and Mobius (Proof-Carrying Code), funded by the EPSRC and the European Union. He actively recruits PhD students, particularly through the Centre for Doctoral Training in Pervasive Parallelism. Labs and Teams: He is a core member of the Laboratory for Foundations of Computer Science (LFCS) , a world-renowned research group at the University of Edinburgh focused on the mathematical foundations of computing. His work often involves collaboration with researchers across Europe in the areas of programming languages, semantics, and formal verification.

• Formal Verification
• Theorem Proving
• Hybrid Systems
• +۱۲ مورد دیگر

Paul Jackson is a Senior Lecturer in the School of Informatics at the University of Edinburgh and serves as Director of the Artificial Intelligence and its Applications Institute (AIAI). He is also affiliated with the Laboratory for Foundations of Computer Science (LFCS) and is an associate member of the Institute for Computing Systems Architecture (ICSA). His work bridges theoretical and applied aspects of formal methods in computer science. Education PhD and MS in Computer Science, Cornell University (1988–1995) MS in Physics, Cornell University (1986–1988) Undergraduate in Engineering, University of Cambridge (1981–1984) Paul Jackson's research focuses on formal verification, particularly the development and application of tools for verifying software, hardware, and hybrid systems. His primary interests include interactive theorem proving (using Lean, Isabelle, and KeYmaera), formal verification of hybrid and cyber-physical systems, non-linear arithmetic, and the integration of symbolic computation with deduction. He has worked extensively with the Nuprl theorem prover and contributed to tools like Victor for SPARK/Ada verification. His recent publications emphasize compositional verification, validated integration using Taylor models, invariant generation for polynomial systems, and dynamic proof presentation. He has been involved in multiple EPSRC and UKRI-funded projects, including work on trustworthy autonomous systems and cache coherence protocols. Scientific Awards and Recognition No specific awards are listed in the provided text. Paul Jackson has advised several PhD students, including Ramon Fernández Mir, Kristjan Liiva, Andrew Sogokon, and Grant Olney Passmore, many of whom have gone on to influential roles in academia and industry. He has held significant administrative roles, including Senior Tutor and Senior Director of Studies, and has contributed to major conferences such as CAV, CICM, and CADE as program committee member or chair. His teaching includes courses on formal verification, automated reasoning, and software engineering.

• Program Analysis
• Formal Methods
• Software Verification
• +۵ مورد دیگر

Maria Christakis is a Full Professor at the Faculty of Informatics, Vienna University of Technology, where she leads the Software Engineering Research Unit and the Rigorous Software Engineering Group at the Information Systems Engineering Institute. Her work bridges theoretical foundations with practical tools for reliable software development. Her research focuses on Program Analysis, Formal Methods, Software Verification, and Test Generation . She develops techniques for automatic test generation, program analysis, and software verification to enhance software robustness while improving developer experience. Key innovations include metamorphic testing frameworks, soundness testing for program analyzers, and verification tools for smart contracts and machine learning systems. Christakis' recent publications reveal strong trends in zero-knowledge circuit testing, smart contract security, machine learning verification, and action-policy testing . Her work combines formal methods with practical engineering solutions, particularly for blockchain systems, neural networks, and program analyzers. She emphasizes sustainability in testing through projects like GreenBench. Amazon Research Award (2023) for Testing Dafny for Unsoundness and Brittleness Bugs Facebook Faculty Research Award for Program Analysis Google Research Scholar Award for Metamorphic Specification and Testing Best Presentation Award at ESEC/FSE'20 Distinguished Paper Award at ICSE'16 She actively mentors PhD and Master's students through projects like Circuzz, Sherlock, and Nomos. Her group receives substantial funding from the Austrian Science Fund (FWF), European Commission, Amazon Research Awards, and Google Research Scholar program. Current major projects include the Structured Doctoral Program on Automated Reasoning (FWF-funded) and the Amazon Research Award project on Dafny testing. Christakis leads the AGI Labs team building AI agents and contributes to Amazon Nova foundation models. Her group maintains strong industry collaborations with Amazon (through Amazon Research Awards and Amazon Scholars program), MPI-SWS, and Microsoft Research.

• Formal Verification
• Virtualization
• Systems Security
• +۲ مورد دیگر

Jean Pichon-Pharabod serves as Tenure Track Assistant Professor in the Department of Computer Science at Aarhus University, Denmark. His research bridges formal methods and systems security with practical applications in cloud infrastructure and virtualization technologies. His primary research domains include Formal Verification , Virtualization Security , and Programming Language Semantics . He develops mechanized verification frameworks using Iris separation logic to prove critical safety properties in WebAssembly runtimes and virtual machine monitors, focusing on memory isolation and security invariants. Analysis of his 2023-2025 publications reveals strong thematic consistency in applying formal verification to cloud-native systems. Key trends include memory safety enforcement in WebAssembly (Iris-MSWasm), hypervisor security verification (VMSL), and cross-layer isolation guarantees - all addressing critical vulnerabilities in modern cloud infrastructure through machine-checked proofs. Scientific recognition includes: 2023 Amazon Research Award for “Validating Isolation of Virtual Machines in the Cloud” His research is supported by competitive industry grants including the Amazon Research Award, facilitating collaborations between Aarhus University and Amazon researchers. Current work focuses on extending formal verification techniques to emerging cloud-native execution environments while maintaining modular verification approaches.