معرفی
Roles and Affiliations: Assaf Kfoury is a Professor of Computer Science at Boston University's Computer Science Department. He holds a PhD from MIT and has been actively involved in research and teaching for decades.
Education: PhD in Computer Science from MIT.
Research Interests: Kfoury's work focuses on the intersection of Mathematical Logic and Computer Science, including formal methods, type theory, lambda calculus, static analysis, and algorithm design. He has contributed to areas like network verification, SDN-enabled applications, and graph theory. His research emphasizes practical applications of formal methods in distributed systems and cybersecurity.
Teaching: He teaches graduate courses on formal methods (CS 511 and CS 512) at BU, focusing on SAT/SMT solvers, temporal logics, and automated systems. Collaborated on courses like CS 591 (Dependently-Typed Systems) and CS 518 (Formal Tools for Cybersecurity).
Projects and Tools: Co-developed Verificare, a verification platform for SDN-enabled applications, and contributed to tools like Aartifact for integrating formal methods. Holds a patent on a Software Inspection System.
Awards and Recognition: While no personal awards are explicitly mentioned, his collaborations have received recognition, such as a Best Paper Award for junior researcher Mirai Ikebuchi's work.
Outreach and Advocacy: Supports organizations like Scientists for Palestine and the Union of Concerned Scientists, emphasizing ethical and societal impacts of scientific work.
