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

Mark Aagaardمشاهده پروفایل

دانشیار

• Formal Verification
• Digital Hardware Systems Design
• Computer Architecture
• +۱۰ مورد دیگر

Mark Aagaard is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. His research focuses on formal methods for digital-hardware system design and verification, including pipeline hazards and tool development. He also explores cybersecurity, IoT, and computer architecture. Doctorate in Electrical Engineering, Cornell University (1994) Master of Science in Electrical Engineering, Cornell University (1991) Bachelor of Science in Electrical Engineering, Harvey Mudd College (1988) Research interests include formal verification, hardware design, and cybersecurity applications. Recent work involves pipeline hazard analysis, verification tools like Microbox, and cryptographic hardware implementations. Selected publications span topics like image processing software optimization, pseudorandom number generation, and hardware description languages. No scientific awards explicitly noted. Teaches courses such as Discrete Mathematics and Logic (ECE 108/208) and Digital Hardware Systems (ECE 327). Currently accepting graduate students for research in his areas of expertise.

Zhong Shaoمشاهده پروفایل

استاد

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

Zhong Shao is the Thomas L. Kempner Professor of Computer Science at Yale University, leading the FLINT research group. His work focuses on certified software systems, formal methods, and secure system design. He is known for pioneering research in certified assembly programming (CAP) and the development of the CertiKOS verified operating system kernel. Research Interests: Formal semantics, concurrency and coordination, certified compilation, language-based security, and verified system software. Recent Contributions: Pioneered deep specifications for layered system software, developed the VeriML proof automation framework, and advanced formal verification for distributed systems and smart contracts. Current efforts include verified blockchain systems and compositional verification techniques for concurrent programs. Teaching: Currently teaches CS430 Formal Semantics in Spring 2025 and has previously taught courses on compilers, operating systems, and programming languages. Labs/Teams: Director of the FLINT Group, collaborating with researchers from Princeton, UPenn, and MIT on NSF Expedition projects in deep specifications. Involved in systems seminars like APLAR and SPAM.

Simão Melo de Sousaمشاهده پروفایل

دانشیار

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

Simão Melo de Sousa is an Associate Professor at the Computer Science Department of the Engineering Faculty at the University of Beira Interior (UBI) , where he leads the RELEASE (RELiablE And SEcure Computation) research group under Nova-Lincs. He holds a Habilitation ( Agregação ) in Computer Science from UBI, a PhD from Nice-Sophia Antipolis University (France), and advanced degrees from Orléans University (France). Research Focus: Formal methods, software reliability/security, blockchain, computational logic, programming language design, deductive verification Teaching: Courses: Proof and Programming Theory , Certified Programming , Formal Methods , Functional Programming Projects include GreenStamp , HORUS , and COPES (PI roles), alongside contributions to LEAF , FRESCO , and European COST Networks . His work bridges theory and practice through co-developed tools like Why3 , ARMY , and LISSOM , targeting safety-critical systems (avionics, railways, medical) and cloud/ubiquitous security. He actively contributes to educational platforms like Learn-OCaml and co-authored books such as Rigorous Software Development (Springer, 2011). Scientific Collaborations : Key partnerships with Tezos Foundation , OCaml Foundation , Nova-Lincs , and institutions including Critical Software , EFACEC , and INRIA . His publications span journals ( Science of Computer Programming , Journal of Automated Reasoning ) and conferences ( LICS , ISoLA , ACISP ).

Gilles Bartheمشاهده پروفایل

استاد پژوهشی

• Formal Methods
• Programming Languages
• Cryptography
• +۳ مورد دیگر

Gilles Barthe is Research Professor (part-time) at IMDEA Software Institute and Director at Max Planck Institute for Security and Privacy. His research develops programming language techniques and verification methods for security applications, particularly cryptographic implementations and differentially private computations. Research focuses on formal methods for security proofs, including relational program verification, cryptographic protocol analysis, and privacy-enhancing technologies. Key areas include automated proofs for lattice-based cryptography, secure compilation techniques, and verifying constant-time properties against side-channel vulnerabilities. Barthe leads projects on formal verification of cryptographic standards including AES-GCM and SHA-3, and develops tools like EasyCrypt for computer-aided cryptographic proofs. Recent work addresses Spectre vulnerability mitigations and quantum program verification.

Aleksandar Kuzmanovicمشاهده پروفایل

استاد

• Computer Networking
• Internet Protocols
• Network Security
• +۴ مورد دیگر

Aleksandar Kuzmanovic is a Professor in the Department of Computer Science at Northwestern University, leading the Northwestern Networks Group. He holds a Ph.D. from Rice University (2005) and B.S./M.S. degrees from the University of Belgrade (1996/1999). His research focuses on computer networking, including denial-of-service resiliency, protocol design, and Internet-scale systems. Notable contributions include the TCP-LP protocol adopted in Linux, Explicit Congestion Notification (ECN) as an Internet standard, and denial-of-service defenses for Akamai’s CDN. He has over 60 publications in top venues such as SIGCOMM, NSDI, and IMC. Education: Ph.D., Electrical and Computer Engineering, Rice University (2005) M.S., Electrical Engineering, University of Belgrade (1999) B.S., Electrical Engineering, University of Belgrade (1996) Research Interests: Network protocols and congestion control Security and resiliency in distributed systems CDN optimization and edge computing Privacy-preserving network architectures Internet measurement and standardization Professional Activities: Visiting Professor at University of Electronic Science and Technology of China Steering Committee Member of Measurement Lab (Measurement Lab) Co-founder of bloXroute Labs, Inc. Awards: NSF CAREER Award (2008) Microsoft Trustworthy Computing Award (2006) Searle Junior Fellowship (2006) Rice Presidential Fellowship (1999) Teaching: EECS 110: Introduction to Computer Programming EECS 397/497: IoT Networks Seminar

• Programming Languages
• Type Theory
• Category Theory
• +۴ مورد دیگر

Vikraman Choudhury is a Marie Skłodowska-Curie Fellow at the Department of Computer Science and Engineering, University of Bologna, and affiliated with the INRIA OLAS Team. He holds a Chancellor's Fellowship in Mathematically Structured Programming at the University of Strathclyde. Previously, he was a Research Associate at the University of Glasgow and a Visiting Research Fellow at the University of Cambridge under a Paul Purdom Fellowship. His research focuses on foundational aspects of computation through algebraic lenses, encompassing programming languages, type theory, category theory, logic, and formalization. He holds a PhD in Computer Science from Indiana University (2022), where his thesis explored mathematical models of resource-conscious computation. His prior work includes contributions to distributed issue tracking systems using patch theory and formal methods in concurrency. Vikraman has taught courses in semantics, logic, and programming languages at the University of Cambridge and Indiana University. Research Interests : Foundations of Programming Languages Type Theory and Homotopy Type Theory Category Theory in Computer Science Reversible and Quantum Programming Formal Methods and Verification Algebraic Semantics and Constructive Mathematics Grants & Projects : Marie Skłodowska-Curie Actions Grant (€172k) for ReGraDe-CS project Chancellor's Fellowship at University of Strathclyde Paul Purdom Fellowship at University of Cambridge Awards : Marie Skłodowska-Curie Fellowship Chancellor's Fellow in Mathematically Structured Programming His research includes pioneering work on reversible debugging of concurrent systems (ReGraDe-CS project), quantum session types, and semantic foundations of directional logic programming. He actively contributes to open-source initiatives including GenoCoRe and formalization efforts in Cubical Agda.

Francesco Giorgio-Serchiمشاهده پروفایل

مدرس ارشد

• Soft Robotics
• Aquatic Propulsion
• Computational Fluid Dynamics
• +۴ مورد دیگر

Dr. Francesco Giorgio-Serchi is a Senior Lecturer at the School of Engineering (University of Edinburgh), affiliated with the Scottish Microelectronics Centre and the Soft Systems Group . His research focuses on soft-bodied underwater robotics , aquatic propulsion , and model-predictive control systems for challenging marine environments. He leads the Biomimetic-joint-thrust system for underwater propulsion project and collaborates with institutions across Japan, Italy, and the UK. PhD in Computational Fluid Dynamics (University of Leeds, 2011) Laurea in Marine Science & Technology (University of Pisa, 2006) Research interests span soft robotics , bioinspired propulsion , and marine energy harvesting , with recent work on tactile sensing via electrical impedance tomography and dielectric elastomer sensors . His publications address topics like continuum manipulators , disturbance rejection algorithms , and spider-inspired actuators for extraterrestrial applications. Scientific Awards Marie-Curie Early Stage Training (EST) Fellowship Marie-Curie European Reintegration Grant (ERG) NERC 'technology proof-of-concept' grant Lloyd's Register Foundation sponsorship He supervises PhD students in areas like marine renewable energy and autonomous underwater vehicle design , with projects sponsored by the Edinburgh Centre for Robotics . His collaborations include the Endorobotics Lab (Tokyo Tech), Flexible Robotics Lab (Tsukuba), and Human-Robot Informatics Lab (Tohoku University).

• Machine Learning
• Inference Acceleration
• World Models
• +۴ مورد دیگر

Hongyang Zhang is a tenure-track Assistant Professor at the University of Waterloo's David R. Cheriton School of Computer Science and Faculty of Mathematics, affiliated with the Vector Institute for AI. His research bridges theoretical and applied aspects of machine learning, including world modeling, AI inference acceleration, and security. He leads the SafeAI Lab and holds memberships in the AI Institute and Cybersecurity and Privacy Institute. Dr. Zhang completed his Ph.D. at Carnegie Mellon University's Machine Learning Department and conducted postdoctoral research at Toyota Technological Institute at Chicago. His educational background includes a degree from Peking University. Research interests focus on: Developing generative world models for robotics and autonomous systems Creating efficient algorithms for accelerating LLM inference Building System-2 LLMs for enhanced reasoning Advancing AI security against adversarial threats Publications demonstrate strong focus on efficient AI systems and security, with recent work on EAGLE series acceleration techniques and The Matrix world generation framework dominating top conferences like ICML, NeurIPS, and CVPR. Awards and honors: 1st place in CVPR 2021 Security AI Challenger Multiple NeurIPS challenge wins in adversarial vision AAAI New Faculty Highlights awardee IEEE Senior Member Leads SafeAI Lab focusing on trustworthy AI systems and regularly serves as area chair for top machine learning conferences including NeurIPS, ICML, and ICLR.

Magnus Myreenمشاهده پروفایل

پژوهشگر

• Formal Verification
• Programming Languages
• Compiler Design
• +۴ مورد دیگر

Dr. Magnus Myreen is an affiliate researcher at the Department of Computer Science and Technology, University of Cambridge. His work focuses on formal verification, compiler correctness, and verified systems programming, with a particular emphasis on the CakeML project. He contributes to developing verified compilers, ensuring their reliability through rigorous mathematical proofs. His research integrates formal methods with practical systems programming challenges, addressing topics like SAT solver validation, hardware-software co-verification, and certified approximation algorithms. Myreen’s research interests span formal methods, programming languages, and compiler design. He explores techniques for verifying complex software systems, including device drivers, operating systems, and cryptographic functions. His projects emphasize end-to-end verification, ensuring that every component—from high-level specifications to machine code—is formally validated. Recent work includes advancements in verified propagation redundancy checking and the development of tools like Pancake for systems programming. He collaborates on initiatives such as the SAT Competition, contributing verified tools like VeriPB. His publications highlight trends in verified compilation, formalized mathematics, and the integration of interactive theorem provers with practical applications. Myreen’s efforts aim to bridge the gap between theoretical formal methods and real-world software engineering challenges.

Adam Chlipalaمشاهده پروفایل

استاد

• Programming Languages
• Formal Verification
• Compiler Verification
• +۲ مورد دیگر

Adam Chlipala is the Arthur J. Conner Professor of Computer Science at MIT, with appointments in the Computer Science and Artificial Intelligence Laboratory (CSAIL) and the Department of Electrical Engineering and Computer Science. His research integrates programming languages and formal methods to develop verified computer systems. Education: PhD in Computer Science, University of California, Berkeley MS in Computer Science, University of California, Berkeley BS in Computer Science, Carnegie Mellon University Research Focus: Dr. Chlipala's work spans: Verified compilers and programming tools Cryptographic protocol implementation Hardware description languages Proof automation in theorem provers High-performance parallel computing His current projects focus on rethinking abstractions for parallel systems with end-to-end formal verification. Teaching: He has created and teaches courses on verified software engineering (6.S057), programming fundamentals (6.1010), and formal reasoning about programs (6.5120). His educational materials include textbooks on Certified Programming with Dependent Types and Formal Reasoning About Programs. Awards and Honors: His research has been recognized with the German IT Security Award, Humies Gold Award for evolutionary computation, and multiple teaching prizes including the Jamieson Prize. He is an ACM Distinguished Member and NSF CAREER awardee. Research Teams: Dr. Chlipala leads the Programming Languages & Verification Group at MIT CSAIL. His startup Nectry develops no-code enterprise software based on the Ur/Web language and UPO proof system.

Jean-Baptiste Jeanninمشاهده پروفایل

استادیار

• Verification of cyber-physical systems
• Logics and semantics of programming languages
• Programming with coinductive types
• +۳ مورد دیگر

Jean-Baptiste Jeannin is an Assistant Professor in the Department of Aerospace Engineering at the University of Michigan — Ann Arbor, leading the MARVL group. He is also affiliated with the departments of Computer Science and Engineering and Robotics. His research focuses on formal verification of cyber-physical systems, logics and semantics of programming languages, and coinductive programming types. He holds a Ph.D. in Computer Science from Cornell University (2013) and a Diplôme d'Ingénieur from École polytechnique (2007), with prior roles at Samsung Research America and Carnegie Mellon University. His research interests include verification of aerospace applications, program logics, and formal methods applied to robotics and distributed systems. Notable work includes formally verified algorithms for collision avoidance, network consensus protocols, and numerical methods. He teaches courses such as AERO 552 (Aerospace Information Systems) and EECS 590 (Advanced Programming Languages). Jeannin's recent publications emphasize formal verification in hybrid systems, rounding error analysis, and hardware-software co-design. His work bridges theoretical foundations with practical applications in autonomous systems, cybersecurity, and computational physics. Collaborations include projects on certified approximations of mathematical functions and verified distributed system protocols.

• Boolean Satisfiability (SAT) Solvers
• Formal Verification
• Distributed Protocols
• +۷ مورد دیگر

Karem Sakallah is a Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan, College of Engineering. His research focuses on formal verification, SAT solvers, and distributed protocols, with a strong emphasis on symmetry breaking and scalable verification techniques. He mentors Ph.D. students by fostering curiosity, collaborative problem-solving, and clear technical communication. Research highlights: Quantified symmetric minimization, SAT-based verification of distributed systems, symmetry detection in graphs, and automated inductive invariant inference. Teaching philosophy: Encourages students to view research as an adventure, prioritizes teaching them to identify gaps in literature, write effectively, and present solutions elegantly. Conference attendance: Supports participation in top-tier venues like FMCAD, SAT, CAV, and VMCAI, covering associated costs through research funding.

Yatin Manerkarمشاهده پروفایل

استادیار

• Formal Methods
• Computer Architecture
• Hardware Security
• +۴ مورد دیگر

Yatin Manerkar is an Assistant Professor in the Department of Computer Science and Engineering at the University of Michigan. His research focuses on formal methods for ensuring correctness in computing systems, particularly in hardware and software verification. He holds a PhD from Princeton University and has conducted postdoctoral research at UC Berkeley. His work has led to significant contributions in verifying memory consistency models, hardware security, and cache coherence protocols. **Education:** PhD in Computer Science, Princeton University (Advisor: Margaret Martonosi) M.S. in Computer Science and Engineering, University of Michigan BASc in Computer Engineering, University of Waterloo **Research Interests:** Manerkar's research bridges computer architecture and formal methods. He develops automated techniques for verifying and synthesizing computing systems, targeting emerging hardware like heterogeneous processors. Key areas include memory consistency models, security vulnerabilities (e.g., Meltdown/Spectre variants), and ethical AI implications of hardware design. **Awards & Recognition:** ACM SIGARCH/IEEE CS TCCA Outstanding Dissertation Award Honorable Mention (2021) Best Paper Nomination (FMCAD 2022) IEEE Micro Top Picks Honorable Mentions (2023, 2021, 2018) Heidelberg Laureate Forum Participant (2019) **Advising & Teaching:** Manerkar advises PhD and undergraduate students on formal verification and hardware-software co-design. He has taught courses on parallel computer architecture and formal verification at the University of Michigan.

Michael Fourmanمشاهده پروفایل

استاد

• Logic in Computer Science
• Artificial Intelligence
• Cognitive Science
• +۳ مورد دیگر

Michael Fourman is a Professor of Computer Systems at the School of Informatics, University of Edinburgh, within the College of Science and Engineering. His research focuses on applications of logic in Computer Science, Artificial Intelligence, and Cognitive Science, with contributions to formal methods, programming language semantics, and hardware specification. He has advised numerous PhD students and collaborated on EPSRC-funded projects, including work on probabilistic reasoning and program development tools like PropPlan. His research interests bridge mathematical logic, computer science, and cognitive science, emphasizing formal representations and their practical applications. He has explored categorical semantics for programming languages, hardware design tools, and AI planning systems. Recent work includes integrating logical and probabilistic reasoning frameworks. Key tools developed include PropPlan (BDD-based planner) and PropSat , alongside contributions to formal verification and categorical logic. His publications span over four decades, addressing topics from intuitionistic logic to modern informatics challenges.

• Artificial Intelligence
• Cybersecurity
• Formal Methods
• +۴ مورد دیگر

Matteo Cristani is an Associate Professor at the University of Verona 's Department of Computer Science , where he teaches courses in Artificial Intelligence , Semantic Web , and Programming across multiple degree programs including Bioinformatics, Computer Science, and Artificial Intelligence. His research focuses on Knowledge Representation , NLP , and Formal Security Analysis , with applications spanning from blockchain technology to geospatial systems. Research Focus Intelligent agents and multi-agent systems Distributed artificial intelligence Formal methods in security theory Network security and cybersecurity NLP and large language models Ontology engineering Projects Active in third-mission activities, Cristani leads projects such as SHIELD (Securing Decentralized Finance and Healthcare Systems), SLOTS (Smart Legal Order in Digital Society), and NOMEN (Next-Gen Cyber Ranges). He has participated in 30+ research initiatives since 2001, including PRIN grants and industrial collaborations in semantic web applications.