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

Xujie Siمشاهده پروفایل

استادیار

• Artificial Intelligence
• Machine Learning
• Software Engineering
• +۵ مورد دیگر

Xujie Si is an Assistant Professor in the Department of Computer Science at the University of Toronto. He is also a faculty affiliate at the Vector Institute and an affiliate member at Mila - Quebec AI Institute, holding a Canada CIFAR AI Chair. Previously, he served as an Assistant Professor at McGill University's School of Computer Science. Education: Ph.D., Computer and Information Science, University of Pennsylvania (advised by Mayur Naik) M.S., Computer Science, Vanderbilt University B.E. (with Honors), Nankai University Research Focus: His work bridges AI and program reasoning, emphasizing the integration of statistical and logical methods. Key areas include: Static analysis and verification using deep learning/reinforcement learning Neuro-symbolic systems for urban simulation (e.g., LogiCity) Automated theorem proving via LLMs and symbolic reasoning Program repair and compiler fuzzing Recent Article Trends: Recent work focuses on synergizing LLMs with symbolic reasoning (e.g., Olympiad inequality proving), advancing SAT solving with graph neural networks, and applying neuro-symbolic methods to Euclidean geometry formalization. Awards: Canada CIFAR AI Chair (2023) Lab/Teams: Leads research teams exploring program analysis, neuro-symbolic AI, and formal verification at the University of Toronto and Vector Institute.

• Artificial Intelligence
• Machine Learning
• Fairness in AI
• +۵ مورد دیگر

Sanmi Koyejo is an Assistant Professor of Computer Science at Stanford University and holds an adjunct position as Associate Professor at the University of Illinois at Urbana-Champaign. He leads the Stanford Trustworthy AI Research (STAIR) group, focusing on fairness, robustness, and healthcare applications in machine learning. His work bridges theoretical foundations with practical systems, emphasizing ethical AI and clinical informatics. Affiliations: SAIL, HAI, CRFM, AIMI, AI Safety, and the Machine Learning Group. Research Interests: His expertise spans trustworthy AI, federated learning, and neuroimaging. He actively addresses challenges in algorithmic fairness, particularly in healthcare, where he collaborates with institutions like OSF Healthcare on projects like federated learning for clinical data. Key Contributions: Co-developed frameworks for unlearning in large language models, evaluated AI systems' societal impacts, and advanced benchmarks for medical applications. His work has been featured in venues like NeurIPS, ICML, and AAAI. Awards: NSF CAREER Award, Alfred P. Sloan Fellowship, and Terman Faculty Fellowship. Grants & Teams: Leads NSF-funded projects on domain adaptation and fairness in breast cancer risk scoring. Collaborates with interdisciplinary teams on NIH's MIDRC and NSF's AIFARMS initiative for agricultural sustainability. Labs/Teams: STAIR lab drives interdisciplinary research in ethical AI, with emphasis on real-world deployment and policy implications.

Shuvendu K. Lahiriمشاهده پروفایل

پژوهشگر

• Formal Verification
• Smart Contracts
• Program Synthesis
• +۵ مورد دیگر

Shuvendu K. Lahiri is a researcher at Microsoft Research, focusing on formal verification, program synthesis, and software testing. His work bridges artificial intelligence with formal methods, particularly in blockchain security and automated code generation. 2025 : Published LLM-Vectorizer (verified loop vectorizer) and neural synthesis for SMT-assisted proof-oriented programming 2024 : Explored LLM-based test-driven code generation and natural precondition inference 2023 : Developed resource management specifications and contributed to test generation with pre-trained models 2022 : Advanced Solidity type systems and merge conflict resolution using language models His research combines large language models with formal verification tools to improve software correctness. He actively contributes to conferences like ICSE, PLDI, and ISSTA as author and committee member.

David A. Plaistedمشاهده پروفایل

استاد پژوهشی

• Mechanical theorem proving
• Term rewriting systems
• Logic programming
• +۳ مورد دیگر

David A. Plaisted is a Research Professor in the Department of Computer Science at the University of North Carolina at Chapel Hill. He joined UNC-Chapel Hill as a full professor after serving on the faculty of the Computer Science Department at the University of Illinois at Urbana-Champaign until 1984. His academic career spans several decades with significant contributions to automated reasoning and computational logic. Bachelor's degree in Mathematics from the University of Chicago (1970) Ph.D. in Computer Science from Stanford University (1976) Professor Plaisted's research focuses on mechanical theorem proving, term rewriting systems, logic programming, and algorithms. His work in term-rewriting systems investigates methods of combining them with first-order theorem provers, including techniques for applying efficient permutation group algorithms to equational theorem proving. In mechanical theorem proving, he has developed a sequence of methods including clause linking with semantics and ordered semantic hyper-linking. His research in logic programming includes developing tests to eliminate the occurrence check in Prolog while maintaining semantics. His work spans theoretical foundations to practical applications in program verification and generation. His recent publications demonstrate continued innovation in automated reasoning, particularly in semantic guidance for theorem proving. His work shows a consistent focus on improving the efficiency and effectiveness of automated deduction systems, with recent contributions to SGGS (Semantically-Guided Goal-Sensitive) theorem proving and analysis of the relationship between semantics and unification in proof systems. Professor Plaisted has served on numerous program committees and editorial boards including the Journal of Symbolic Computation, Information Processing Letters, Mathematical Systems Theory, and Fundamenta Informaticae. He is currently on the editorial board of ACM Transactions on Computational Logic and the electronic Journal of Functional and Logic Programming. He has organized significant conferences including serving as co-chair of the Second International Conference on Rewriting Techniques and Applications in 1987. He has spent several sabbaticals at prestigious institutions including SRI in Menlo Park (1982-1983), the Max-Planck Institute and University of Kaiserslautern in Germany (1993-1994), and research visits to groups in Grenoble and Nancy, France (1998).

Farzaneh Derakhshanمشاهده پروفایل

استادیار

• Type Theory
• Proof Theory
• Programming Languages
• +۷ مورد دیگر

Dr. Farzaneh Derakhshan is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology (Illinois Tech), where she explores logical foundations of concurrency and develops formal methods for program verification. She earned her Ph.D. in Pure and Applied Logic from Carnegie Mellon University in 2021 under Frank Pfenning, followed by a postdoctoral fellowship at CMU with Limin Jia and Stephanie Balzer. Current affiliation: Illinois Tech (since ~2021) Previous affiliation: Carnegie Mellon University (Ph.D. and postdoc) Research focus: Type theory, logical verification, and security for concurrent systems Teaching: Courses on programming languages, type systems, and security Her research addresses fundamental challenges in concurrent programming, including: Developing modal logic frameworks for system verification Designing type systems for intermittent computing Creating behavioral type systems for security guarantees Applying relational logic to GPU security and secure compilation Investigating logical foundations of session-typed processes Formal verification of cyclic process networks Current research trends include: Hybrid dynamic verification for parallel systems Logical approaches to side-channel security Formal methods for cyber-physical systems Crash-resilient computing models Security verification in decentralized applications Noninterference proofs in session-typed concurrency Scientific recognition: NSF SaTC CORE Collaborative Award #2350217 Organizing committee member at Dagstuhl Seminar 26071 Professional leadership: Program committee co-chair for PLACES 2025 Committee roles at LICS 2026, ESOP 2026, ICFP 2025, and ECOOP 2025 Regular reviewer for ACM Transactions journals Laboratory involvement: Co-director of behavioral types research at Illinois Tech Collaboration with Carnegie Mellon's formal verification group Key participant in the FACCT workshop

Steve Zdancewicمشاهده پروفایل

استاد

• Programming Languages
• Type Theory
• Logic
• +۷ مورد دیگر

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He is a leading researcher in programming languages, formal methods, and computer security with over two decades of impactful contributions to the field. His research interests span programming languages, type theory, logic, computer security, quantum programming, and formal verification. Zdancewic has made significant contributions to information-flow security, memory safety, program synthesis, and the verification of low-level systems. His work often bridges theoretical foundations with practical applications, particularly through the development of verified systems using Coq and other proof assistants. Analysis of his recent publications reveals a strong focus on formal verification techniques, particularly using Interaction Trees and the Coq proof assistant. His research trajectory shows consistent evolution from foundational work on information-flow security toward increasingly sophisticated verification of complex systems including LLVM, quantum computing, and distributed systems. His work demonstrates a commitment to building practically useful verification tools while maintaining rigorous theoretical foundations. Distinguished Paper Award for Semantics for Noninterference with Interaction Trees (ECOOP 2023) Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award for Interaction Trees (POPL 2020) Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO top picks (2013) Alfred P. Sloan Fellow (2009-2010) NSF CAREER award (2004) Zdancewic has advised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by significant grants from NSF, including the NSF Expedition on the Science of Deep Specification. He is actively involved in multiple major research projects including Vellvm (verified LLVM), DeepSpec, and quantum programming verification. Zdancewic also co-organizes Penn's PL Club programming languages research group with Benjamin Pierce and Stephanie Weirich.

Daniel Fremontمشاهده پروفایل

دانشیار

• Formal Methods
• Automated Reasoning
• Cyber-Physical Systems
• +۶ مورد دیگر

Daniel Fremont is an Associate Professor of Computer Science and Engineering at the University of California, Santa Cruz, where he conducts research at the intersection of formal methods and autonomous systems. His work focuses on developing mathematical techniques to improve the reliability of software, hardware, and cyber-physical systems through precise specification, formal verification, automatic synthesis, and principled testing approaches. Dr. Fremont's research interests center on applications of logic in computer science, particularly using automated reasoning to enhance system reliability. His work spans formal methods for cyber-physical systems (CPS), especially autonomous systems that incorporate machine learning. Key research areas include algorithmic improvisation for creating systems with controlled randomness, probabilistic programming through the Scenic language for environment modeling, and formal verification techniques applicable to safety-critical autonomous systems. His group has successfully applied these methods to autonomous vehicles, aircraft systems, and robotics, with significant contributions to both theoretical foundations and practical implementations. The publication record reveals a strong trajectory from theoretical foundations of control improvisation toward practical applications in autonomous systems verification. Early work established the theoretical framework of control improvisation, while recent publications focus on applying these techniques to real-world challenges in autonomous driving, aircraft systems, and AI-based autonomy. A consistent theme across his research is the integration of formal methods with machine learning to address the verification challenges posed by complex, learning-based systems operating in uncertain environments. Best Paper Award at IoTDI 2016 for 'Control Improvisation with Probabilistic Temporal Specifications' Dr. Fremont leads a research group focused on formal methods for autonomous systems, with significant contributions to the development of tools like Scenic (a probabilistic programming language for scenario specification) and VerifAI (a toolkit for formal design and analysis of AI-based systems). His work bridges theoretical computer science with practical engineering challenges in safety-critical autonomous systems, receiving funding from various sources supporting research at the intersection of formal methods and artificial intelligence. The group's approach combines theoretical algorithm development with practical implementation and testing, often collaborating with industry partners working on autonomous vehicle technology. The research group maintains active development of several open-source tools, including the Scenic language for scenario specification and VerifAI for formal analysis of AI systems. They have demonstrated applications across multiple domains including autonomous vehicles, aircraft systems, and robotics, with particular emphasis on simulation-based testing and verification approaches that can provide formal guarantees about system behavior.

Christoph Benzmüllerمشاهده پروفایل

استاد

• Automated Theorem Proving
• Computational Metaphysics
• Artificial Intelligence
• +۵ مورد دیگر

Prof. Christoph Benzmüller is a Full Professor at the University of Bamberg (Chair for AI Systems Engineering) and an adjunct professor at Freie Universität Berlin's Department of Mathematics and Computer Science. He is a leading researcher in automated reasoning, computational metaphysics, and formal logic systems. His work focuses on integrating higher-order logic into AI to achieve transparent and ethically grounded systems. Research Interests: His research spans automated theorem proving, formal ontologies, and normative reasoning in AI. Notably, he has formalized Gödel's ontological argument using computational methods and developed the Leo theorem provers for higher-order logic. He emphasizes the use of symbolic reasoning for ethical and legal AI frameworks. Grants & Projects: He leads projects like PetraKIP (AI portfolios for teacher education) and NFDIxCS (National Research Data Infrastructure). His work is funded by DFG, EPSRC, and the Volkswagen Foundation. He also collaborates with institutions globally, including Stanford and Cambridge. Awards: Recipient of the Central Teaching Award (FU Berlin) for his Computational Metaphysics course and a DFG Heisenberg Fellowship. His research on Gödel's argument gained international media attention. Education: Studied at Saarland University, where he earned his PhD (1999) and habilitation (2006).曾是专业长跑运动员，后转向学术研究。

Todd Millsteinمشاهده پروفایل

استاد

• Network Verification
• Programming Languages
• Probabilistic Programming
• +۳ مورد دیگر

Todd Millstein is a Professor in the Computer Science Department at the University of California, Los Angeles (UCLA). He served as the Computer Science Department Chair from 2022-2025 and is also an Amazon Scholar. His research focuses on making software systems more reliable through programming languages techniques, with significant contributions to network verification and probabilistic programming. Millstein received his Ph.D. from the University of Washington Department of Computer Science, where he was a member of the Cecil group led by Craig Chambers. Prior to that, he completed his undergraduate studies at Brown University under the guidance of Paris Kanellakis and Pascal Van Hentenryck. Millstein's research spans several areas of programming languages and systems with a focus on reliability. He has made significant contributions to network verification, developing the Batfish network configuration analyzer which is now managed by Amazon Web Services and forms the basis of Oracle Cloud's Network Path Analyzer. His work has been recognized with the ACM SIGCOMM Networking Systems Award in 2025. He also works on interactive program verification through lemma synthesis and scalable reasoning methods for probabilistic programming languages. His research bridges programming languages theory with practical systems challenges, as highlighted in his SPLASH/OOPSLA 2024 keynote "Everything is a Program (even if it's not)". Millstein's recent publications demonstrate a consistent focus on verification and reliability across multiple domains. His work shows a progression from foundational programming language techniques to practical applications in networking and probabilistic systems. Key themes include data-driven approaches to program analysis, synthesis of verification artifacts, and applying programming languages techniques to non-traditional domains like network configuration. Millstein's scientific achievements have been recognized with numerous prestigious awards including an NSF CAREER Award, an ACM SIGPLAN Most Influential PLDI Paper Award, an ACM SIGCOMM Networking Systems Award, IEEE Micro Top Picks selection, best-paper awards from PLDI, OOPSLA, and SIGCOMM, a Microsoft Research Outstanding Collaborator Award, an Okawa Foundation Research Grant, an IBM Faculty Award, and a Facebook Research Award. He has also received both the Northrop Grumman Excellence in Teaching Award (for junior faculty) and the Eon Instrumentation Inc. Excellence in Teaching Award (for senior faculty) from UCLA Engineering. Millstein advises several Ph.D. students including Ana Brendel, Poorva Garg (co-advised with Guy Van den Broeck), Rajdeep Mondal (co-advised with George Varghese), and Rathin Singha (co-advised with George Varghese). His research has been supported by various grants including an NSF CAREER Award, Okawa Foundation Research Grant, IBM Faculty Award, and Facebook Research Award. He has also been a Co-Founder and Chief Scientist of Intentionet, which was later acquired by Amazon Web Services. Millstein is actively involved in the Batfish project, an open-source network configuration analyzer that has had significant practical impact. Batfish is now managed by AWS, powers Oracle Cloud's Network Path Analyzer, and is used by dozens of companies. His research group continues to work on network reliability, developing techniques for scalable BGP policy verification and behavioral testing of protocol implementations.

Tej Chajedمشاهده پروفایل

استادیار

• Formal verification of systems software
• Concurrent systems verification
• Crash-safe file systems
• +۵ مورد دیگر

Tej Chajed is an Assistant Professor in the Department of Computer Science at the University of Wisconsin-Madison, where he conducts research in formal verification of systems software. His work focuses on building and proving the correctness of critical systems, particularly file systems and concurrent software. Dr. Chajed earned his PhD from MIT in the PDOS group, followed by a one-year postdoc at VMware Research before joining UW-Madison. His academic journey reflects a strong commitment to bridging theoretical formal methods with practical systems implementation. Chajed's research centers on formal verification techniques for systems software, with particular emphasis on concurrent and crash-safe systems . His work aims to eliminate bugs in critical software through mathematical proofs of correctness. Key contributions include DaisyNFS (a verified concurrent file system), the Perennial framework for reasoning about crash safety, and Goose for connecting proofs to Go code. His research spans the intersection of programming languages, operating systems, and formal methods, developing practical tools that bring verification to real-world systems. His recent publications demonstrate a consistent trajectory toward more practical and scalable verification techniques for increasingly complex systems. The research shows progression from foundational verification frameworks to applied work on specific systems like file systems, journaling, and distributed protocols. A notable trend is the focus on making verification more accessible and practical for systems developers, bridging the gap between theoretical formal methods and real-world software engineering. Dr. Chajed serves on numerous program committees including OSDI 2025 PC, PLDI 2024 PC, SySDW 2023 PC, ECOOP 2023 ERC, CPP 2023 PC, POPL 2023 PC, PLDI 2022 PC, POPL 2022 AEC, EuroDW 2021 PC, POPL 2021 AEC, PLDI 2020 AEC, POPL 2020 AEC, and SOSP 2019 AEC, reflecting his standing in the systems and programming languages research community. In teaching, Chajed has developed and instructed courses on systems verification, operating systems, and protocol verification. He previously helped create MIT's 6.826 (Principles of Computer Systems) during his PhD. His passion for technical communication was cultivated during his time as a Communication Fellow in the EECS Communication Lab at MIT, where he continues to offer guidance to students on writing and presentation skills. His research group at UW-Madison focuses on advancing the state of the art in systems verification, with current projects centered around practical verification frameworks for concurrent and crash-safe systems.

• Computational Logic
• Declarative Logic Programming
• Answer-Set Programming
• +۵ مورد دیگر

Hans Tompits is an Associate Professor in the Department of Knowledge-Based Systems at Technische Universität Wien (Vienna University of Technology). His research focuses on computational logic, declarative logic programming, and formal methods, with a particular emphasis on Answer-Set Programming (ASP). He coordinates the Master's program in Logic and Computation and leads projects in areas such as formal methods for optimization, fault-tolerant autonomous systems, and algorithmic composition. His work bridges theoretical advancements with practical applications, including tools like SeaLion (an ASP IDE with debugging support) and dlvhex (an ASP-based semantic web reasoner). He has contributed to foundational topics like program equivalence, debugging techniques, and integration of ASP with external systems. His recent projects address challenges in autonomous vehicle architectures, music composition algorithms, and safety-critical system design. Tompits has published extensively on topics ranging from nonmonotonic reasoning and modal logics to the development of declarative programming tools. His interdisciplinary approach spans computer science, mathematics, and AI, with applications in both academic and industrial contexts.

Wilfried Siegمشاهده پروفایل

استاد

• Foundations of Mathematics
• Proof Theory
• History of Logic
• +۳ مورد دیگر

Wilfried Sieg serves as the Patrick Suppes Professor of Philosophy at Carnegie Mellon University within the Dietrich College of Humanities and Social Sciences, where he has been a core faculty member since 1985. He previously held appointments at Columbia University (1977-1985) and co-founded CMU's interdisciplinary Pure and Applied Logic program. His educational background includes: Ph.D. in Philosophy, Mathematical Logic, and Foundations of Mathematics from Stanford University (1977) M.S. in Mathematics and Logic from Westfälische-Wilhelms-Universität, Münster (1971) B.S. in Mathematics and Physics from Freie Universität, Berlin (1969) Sieg's research fundamentally explores the Foundations of Mathematics through proof theory, with significant contributions to the History of Modern Logic and Philosophy of Mathematics. His work critically examines Hilbert's Program, Gödel's incompleteness theorems, and the historical development of computability concepts. He emphasizes the dialectic between mathematical practice and philosophical reflection, revealing how foundational positions shape and are shaped by mathematical developments. Analysis of his recent publications shows a sustained trajectory from historical-philosophical investigations toward computational implementations, particularly through the AProS project. This evolution reflects growing integration of proof-theoretic insights with automated reasoning systems, focusing on heuristic search algorithms and cognitive modeling of mathematical reasoning. Sieg directs the Laboratory for Symbolic & Educational Computing (LSEC), which develops pedagogical tools like the AProS proof tutor. His grant-funded projects include editorial work on Hilbert, Gödel, and Bernays supported by the German National Science Foundation, Sloan Foundation, and National Endowment for the Humanities, alongside NSF-funded development of web-based logic education. He has advised numerous graduate students through research seminars while maintaining active collaboration with computer science and mathematics departments.

Tobias Nipkowمشاهده پروفایل

استاد

• Formal Methods
• Interactive Theorem Proving
• Program Verification
• +۹ مورد دیگر

Professor Tobias Nipkow is a leading researcher in formal methods and interactive theorem proving at the Technical University of Munich (TUM), affiliated with the School of Computation, Information and Technology and the Department of Computer Science. He is a core developer of the Isabelle proof assistant and leads the Theorem Proving Group. His work has profoundly influenced program verification, semantics, and formalized mathematics. University: Technical University of Munich School: School of Computation, Information and Technology Department: Department of Computer Science Research Group: Theorem Proving Group Key Projects: Isabelle, Archive of Formal Proofs, Concrete Semantics His research focuses on formal verification, higher-order logic, semantics of programming languages, and verified algorithms. He has pioneered the formalization of textbook algorithms, data structures like B+-trees and quadtrees, and logical systems. His work bridges theoretical foundations with practical tools for software correctness. The most recent publications show a strong trend in verifying classical algorithms (e.g., Gale-Shapley, Earley parser), data structures (B+-trees, deques), and decision procedures, primarily using Isabelle/HOL. His contributions span foundational logic, program analysis, and educational approaches to formal methods. Best Paper Award at CADE 28 (2021) Tobias Nipkow has made extensive contributions to advising and collaborative research, co-authoring with numerous researchers and students. He has secured support for large-scale formalization efforts and contributed to major projects like the Flyspeck proof of the Kepler conjecture. His work is supported by ongoing development of the Isabelle framework and the Archive of Formal Proofs. He leads the Theorem Proving Group at TUM, which is central to the development and application of Isabelle. The group fosters international collaboration, contributes to the Archive of Formal Proofs, and advances research in automated reasoning, semantics, and verified systems.

• Model Checking
• Symbolic Execution
• Compositional Verification
• +۷ مورد دیگر

Corina Pasareanu is an ACM Fellow and IEEE ASE Fellow serving as a Principal Scientist at Carnegie Mellon University's CyLab Security and Privacy Institute and Technical Professional Leader for Data Science at NASA Ames Research Center through KBR. Her work bridges formal methods, software verification, and artificial intelligence to ensure the safety and security of complex systems, particularly autonomous systems and machine learning applications. Dr. Pasareanu received her academic training at: Ph.D. in Computer Science, Kansas State University (2001) M.S. in Computer Science, University Politehcnica of Bucharest (1995) B.S. in Computer Science, University Politehcnica of Bucharest (1994) Her research focuses on developing formal verification techniques that can provide mathematical guarantees about the behavior of complex software systems. She specializes in applying model checking, symbolic execution, and compositional verification methods to challenges in autonomy, security, and AI safety. Her recent work addresses the verification of systems incorporating machine learning components, particularly neural networks used in safety-critical applications like autonomous vehicles. She investigates how to ensure these systems behave correctly even when their perception components have uncertainties or are subject to adversarial attacks. Analysis of her recent publications shows a strong trend toward verifying AI and machine learning systems, particularly focusing on neural networks in autonomous systems. Her work increasingly addresses the challenges of Large Language Models, examining both their vulnerabilities to attacks and methods to defend against them. She also continues to advance traditional software verification techniques while adapting them to modern programming languages and paradigms. Dr. Pasareanu has received numerous prestigious awards recognizing her contributions to the field: ACM Fellow IEEE ASE Fellow ETAPS Test of Time Award (2021) ASE Most Influential Paper Award (2018) ESEC/FSE Test of Time Award (2018) ISSTA Retrospective Impact Paper Award (2018) ACM Impact Paper Award (2010) ICSE 2010 Most Influential Paper Award (2010) As an advisor, Dr. Pasareanu mentors several PhD students and postdoctoral researchers, often in collaboration with other faculty members at CMU. Her students focus on cutting-edge research at the intersection of formal methods and AI safety. Her research is supported by substantial funding from diverse sources including NSF, DARPA, NASA, AWS, and industry partnerships. She leads multiple projects focused on AI security, formal verification of neural networks, and software analysis techniques. Dr. Pasareanu also plays a significant role in the broader research community, serving as Program/General Chair for major conferences including ICSE 2025, and as an associate editor for IEEE TSE and STTT. Dr. Pasareanu leads research teams working on projects like "Trinity: Neurosymbolic Learning and Reasoning" (DARPA) and "HUGS: Human-Guided Software Testing and Analysis" (NSF). Her work often involves interdisciplinary collaboration between computer scientists, formal methods experts, and domain specialists to address complex safety challenges in autonomous systems.

Jieh Hsiangمشاهده پروفایل

استاد

• Automated Reasoning
• Programming Language Logic
• Artificial Intelligence
• +۵ مورد دیگر

Jieh Hsiang is a Distinguished Professor at National Taiwan University , with affiliations in the Department of Computer Science and Information Engineering, the Digital Archives and Automatic Inference Laboratory, and the Digital Humanities Research Center. He holds concurrent roles at the Institute of Information Science, Academia Sinica, and the Higher Education Research & Development Office, National Taiwan University. Education PhD in Computer Science, University of Illinois at Urbana-Champaign (1979–1982) BS in Mathematics, National Taiwan University (1972–1976) Research Interests Hsiang's work spans automated reasoning , digital libraries , digital humanities , and information retrieval . His research focuses on integrating computational methods with cultural heritage preservation , particularly through tools like DocuSky and databases such as the Taiwan Historical Digital Library . He explores AI applications in patent analysis , historical text mining , and semantic relationships in legal documents . Recent Trends in Publications His recent articles highlight advancements in BERT and GPT-2 fine-tuning for patent classification , LARGE language models for legal automation , and GIS-based analysis of historical archives . Themes include digital preservation , AI-driven legal text analysis , and cross-disciplinary computational tools for humanities scholars. Scientific Awards 2019 Ministry of Science and Technology Distinguished Research Fellow 2009 National Taiwan University Outstanding In-House Service Award 2008 Chinese Library Association Special Contribution Award 2006 IEEE Test-of-Time Award 1997 & 1999 National Science Council Outstanding Research Award 1997 Ministry of Education Outstanding Industrial-Academic Collaboration Award 1998–2001 Founder and First Chair of IFIP WG1.6 Labs and Collaborations Hsiang leads the Digital Archive and Automatic Inference Laboratory , developing platforms like DocuSky for digital humanities, Taiwan Historical Digital Library , and QGIS Cloud Maps for spatial analysis. His team collaborates internationally on projects involving historical document digitization , patent automation , and cross-domain knowledge integration .