جستجوی استاد راهنمای دانشگاهی

Cezary Kaliszykمشاهده پروفایل

استاد

• Automated Reasoning
• Formal Methods
• Formalized Mathematics
• +۷ مورد دیگر

Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.

• Programming Languages
• Formal Methods
• Software Engineering
• +۴ مورد دیگر

Alexander Summers is an Associate Professor at the Department of Computer Science , University of British Columbia . He joined UBC in March 2020 after serving as a Senior Researcher (Oberassistent) at ETH Zurich from 2014-2020. His research bridges Programming Languages , Formal Methods , and Software Engineering , with a focus on automated verification tools for heap-based and concurrent programs. MSc Joint Mathematics and Computer Science, Imperial College London (2004) PhD Computer Science, Imperial College London (2009) Postdoc, ETH Zurich (2009-2014) Summers leads the Prusti Project , developing deductive verification tools for Rust, and contributes to the Viper Project for intermediate verification languages. His work addresses challenges in: Memory safety and concurrency verification Ownership models and aliasing control Automated reasoning with SMT solvers Resource-oriented programming specifications Debugging verification condition quantifiers Formal validation of verification infrastructure His research has been recognized with a Amazon Research Award and ACM SIGPLAN Distinguished Paper Awards . He teaches courses like Advanced Software Engineering and Program Verifiers and Program Verification , and supervises graduate students in formal verification and Rust-related research.

Pavel Panchekhaمشاهده پروفایل

استادیار

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

Pavel Panchekha is an Assistant Professor in the School of Computing at the University of Utah, where he holds the Warnock Chair for Junior Faculty. His research spans programming languages, web browsers, and numerical analysis, with a focus on developing programming language techniques to address challenges across computer science. Dr. Panchekha received his educational training at prestigious institutions: PhD in Computer Science from the Paul G. Allen School for Computer Science and Engineering at the University of Washington, advised by Michael D. Ernst and Zachary Tatlock BS in Mathematics from MIT Panchekha's research program has two major thrusts. First, he works on web browser internals , with projects including fuzzing layout invalidation, multi-tenant garbage collection, and optimizing 2D graphics. He is also authoring a textbook on web browsers that informs much of this research. Second, he focuses on automatic numerical analysis , with projects such as automatic accuracy improvement, synthesis via term rewriting, scalable static accuracy analysis, and math library implementation. He leads the FPBench and Herbie projects, which are major deployments of his research. His scholarly output demonstrates consistent contributions across programming languages, verification, and numerical methods. Recent work shows a growing emphasis on bidirectional typing systems, layout invalidation in browsers, and robust floating-point error analysis. His publications reveal a trajectory from foundational work on floating-point accuracy (notably the Herbie tool that won a Distinguished Paper Award at PLDI 2015) toward more comprehensive systems for program synthesis, verification, and browser optimization. Panchekha has received significant recognition for his research contributions: NSF Fellowship ARCS Foundation Fellowship Adobe Research Fellowship Wissner-Slivka Foundation Fellowship 2015 PLDI Distinguished Paper Award for work on the Herbie numerical analysis and repair tool As an advisor, Panchekha mentors a substantial group of students across multiple levels. He currently advises six students: Marisa Kirisame (PhD), Bhargav Kulkarni (PhD), Yumeng He (PhD), Artem Yadrov (MS), Jesus Ponce (BS), and Jonas Regehr (BS). Previously, he has advised over twenty students including PhD candidates like Ian Briggs and numerous MS and BS students. His advising spans theoretical topics in programming languages and practical applications in web browsers and numerical computing. Panchekha leads research groups focused on programming languages applications to web browsers and numerical analysis. His work on the Herbie tool for floating-point accuracy improvement has become influential in the programming languages community, and his more recent work on browser internals is shaping how researchers understand and optimize modern web rendering engines. He is currently developing a textbook on web browsers that aims to synthesize knowledge about browser architecture and implementation.

Riyadh Baghdadiمشاهده پروفایل

استادیار

• Compilers
• Programming Languages
• Deep Learning
• +۹ مورد دیگر

Riyadh Baghdadi is an Assistant Professor of Computer Science at New York University Abu Dhabi and a Global Network Assistant Professor at the Tandon School of Engineering, NYU. He is also a Research Affiliate at MIT, where he previously completed a postdoctoral fellowship. His academic journey includes a PhD and Master’s from Sorbonne University (INRIA/UPMC) and an engineering degree from Ecole Supérieure d’Informatique in Algiers. Assistant Professor, NYU Abu Dhabi Global Network Assistant Professor, Tandon School of Engineering, NYU Research Affiliate, MIT His research lies at the intersection of compilers, programming languages, and applied machine learning, with a focus on developing advanced compiler techniques for deep learning, high-performance computing, and data-parallel algorithms. He is the lead developer of the Tiramisu compiler , a polyhedral compiler designed to optimize dense and sparse deep learning workloads across diverse architectures including CPUs, GPUs, and FPGAs. Riyadh’s recent publications demonstrate a strong trend toward integrating machine learning into compiler optimization—particularly in cost modeling, loop scheduling, and automatic code generation. His work addresses critical challenges in optimizing sparse neural networks and enabling efficient execution on resource-constrained platforms like smartphones and autonomous vehicles. Outstanding Paper Award, MLSys 2021 He has mentored 18 students and taught core courses such as Computer Systems Organization and Machine Learning at NYUAD. His service to the academic community includes program committee roles at MLSys, IPDPS, ECOOP, and PACT, as well as organizing workshops on polyhedral compilation and machine learning for hardware-software co-design. Riyadh actively contributes to open-source projects and collaborates with industry leaders including Google, Facebook, NVIDIA, and Intel. He leads the development of Tiramisu and collaborates on DSLs like GraphIt and Halide, focusing on performance portability and automation in compiler design.

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

Martin Henzمشاهده پروفایل

دانشیار

• Programming Languages
• Software Engineering
• Artificial Intelligence
• +۸ مورد دیگر

Martin Henz is an Associate Professor at the National University of Singapore , affiliated with the School of Computing and its Department of Computer Science . His academic journey includes an M.Sc. in Computer Science from Stony Brook University (1993) and a Dr.rer.nat. in Computer Science from Saarland University (1997). He has also worked as a Research Scientist at the German Research Centre for Artificial Intelligence. Research Focus : Scalable Experiential Learning, Systems for Teaching/Learning, AI in Education, Programming Languages, Algorithms, and Constraint Programming. Key Projects : Source Academy (immersive programming environment), Deep Teaching (LMS enhancements), and NUS Seafarers (maritime experiential learning). Publications span education technology, programming languages, and sustainable engineering, with recent works focusing on JavaScript-based pedagogy, automated question generation, and electric vehicle conversions. He supervised Rahul Singhal 's PhD, leading to the educational startup Cerebry, and co-founded Workforce Optimizer Pte Ltd with Alan Sevugan. Awards : NUS Annual Digital Education Award (2021) NUS Annual Teaching Excellence Award (2016/17) Fulbright Scholarship (1990) Startup @ Singapore Champion (2001)

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.

Carlo Angiuliمشاهده پروفایل

استادیار

• Programming Languages
• Type Theory
• Homotopy Type Theory
• +۵ مورد دیگر

Carlo Angiuli is an Assistant Professor of Computer Science at the Department of Computer Science in the Luddy School of Informatics, Computing, and Engineering at Indiana University. His research focuses on programming languages and logic through the lens of type theory, particularly dependent types, proof assistants, and homotopy type theory. He is currently coauthoring a book on dependent type theory with Daniel Gratzer. Ph.D. in Computer Science from Carnegie Mellon University (CMU) Develops programming language foundations and computational interpretations of type theory Active in the HoTTEST Summer School organization and PL Wonks seminar group Recipient of multiple prestigious awards for type theory research His recent publications explore universe polymorphism, cubical type theory, and the intersection of category theory with programming language design. As a community builder, he organizes international research seminars and maintains experimental proof assistants like RedPRL. His teaching includes advanced courses on modern dependent types and foundational computer science topics. Scientific Awards : Best Paper Award (FSCD 2019) CMU School of Computer Science Distinguished Dissertation Award He contributes to proof assistant development and hosts the PL Wonks research group at Indiana University.

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 .

Jaco van de Polمشاهده پروفایل

استاد

• Model Checking
• Formal Methods
• Computer Science
• +۳ مورد دیگر

Jaco van de Pol is a Full Professor of Computer Science at Aarhus University, holding dual roles in the Digital Society Institute and Formal Methods and Tools. He earned his PhD from Utrecht University in 1996, specializing in Termination of Higher-order Rewrite Systems, and a Master's in Computer Science (Term Rewriting) in 1992. His research focuses on model checking, formal methods, algorithms, and automated verification, contributing to UN Sustainable Development Goals related to innovation and education. Education: PhD, Termination of Higher-order Rewrite Systems, Utrecht University (1996) Master's in Computer Science (Term Rewriting), Utrecht University (1992) Research Interests: His work spans model checking, formal verification, parallel algorithms, and their applications in software engineering and bioengineering. He emphasizes practical formal methods, such as SCC algorithms and timed automata analysis, to solve complex computational challenges. Awards: Best Paper Award SPIN 2017 (2017) Best Student Paper Award (2018) Advising & Grants: Supervised 12 students and contributed to collaborative projects in formal methods and computational biology. His research has been applied to areas like cartilage phenotype modeling and parallel algorithm design. Labs/Teams: Engages with interdisciplinary teams, including computational biology and distributed systems groups, to advance formal methods in practical contexts.

Jaakko Timo Henrik Järviمشاهده پروفایل

استاد

• Generic Programming
• Programming Language Design
• Graphical User Interfaces (GUI)
• +۷ مورد دیگر

Jaakko Timo Henrik Järvi is a Professor in the Department of Informatics at the University of Bergen, Norway, with additional affiliations at the University of Turku, Finland. His research focuses on programming language design, generic programming, and human-computer interaction, particularly in GUI frameworks and software reuse. His research interests include generic programming, programming language design (especially the Magnolia language), high-performance computing, array programming, and GUI engineering. He emphasizes formal methods and algebraic specifications to build reusable and efficient software systems. His work bridges theoretical foundations with practical applications in software development and education. The recent publications highlight a strong trend in declarative GUI frameworks, multi-selection models, and generic programming. His work explores domain-specific languages for GUI structure manipulation, reusable selection semantics across platforms, and optimizing array computations using the Mathematics of Arrays. These efforts reflect a consistent focus on software abstraction, correctness, and reusability. Jaakko Järvi has supervised doctoral students, including Tetiana Yarygina, whose dissertation explored microservice security. While no specific grants are detailed, his work on VisAST was supported by the Research Council of Norway (Project 250683), indicating active external funding. He frequently collaborates with researchers like Magne Haveraaen, Knut Anders Stokke, and Sean Parent. He contributes to tools and frameworks such as the MultiselectJS library and the VisAST educational tool. These are outcomes of collaborative research teams focused on improving software development practices and computer science education.

Roel Blooمشاهده پروفایل

مدرس

• Computer Science
• Theoretical Computer Science
• Formal Methods
• +۲ مورد دیگر

Roel Bloo is a University Lecturer in the Department of Mathematics and Computer Science at Eindhoven University of Technology. His research group focuses on Algorithms and Logics for Verification. His research spans theoretical computer science with emphasis on: Formal methods and verification techniques Lambda calculus and type systems Computational logic and term rewriting Explicit substitution models Publications (2001-2012) demonstrate consistent specialization in foundational aspects of computer science, particularly formal semantics of programming languages, type theory implementations, and equivalence proofs in computational systems. Teaching responsibilities include courses in Discrete Mathematics, Logic and Set Theory, and Automata Theory.

Jürgen Gieslمشاهده پروفایل

استاد

• Program Verification
• Automated Deduction
• Termination Analysis
• +۱۲ مورد دیگر

Jürgen Giesl is a Professor at the Teaching and Research Area Computer Science 2 within the Department of Computer Science at RWTH Aachen University , Germany. He leads research in programming languages, formal verification, automated deduction, and term rewriting systems. Research Interests: Automated Termination and Complexity Analysis of Programs Dependency Pairs and Term Rewriting Systems Verification of Probabilistic and Integer Programs Static Analysis and Symbolic Execution Model Checking and Constrained Horn Clauses Development of Automated Tools (AProVE, LoAT) His recent research, reflected in the latest publications, focuses on termination and complexity analysis for probabilistic programs, polynomial loops, and integer programs, using advanced techniques such as dependency pairs, loop acceleration, and semiring semantics. He also contributes to SMT solving and transitive relation learning for infinite-state model checking. Scientific Awards: Best Tool Paper Award at iFM 2017 Silver Medal (Second Best Paper) at SEFM '16 Best Paper Honourable Mention at IJCAR 2024 Best Student Paper Honourable Mention at IJCAR 2024 Advising and Grants: Giesl has supervised numerous PhD and Master’s students, including prominent researchers such as Fabian Frohn, Jens Hensel, Nils Lommen, and Marcel Hark. He leads a large research group focused on automated verification and has contributed extensively to international verification competitions. His work is supported by ongoing research grants and collaborations with leading institutions in formal methods. Labs and Teams: He leads the Programming Languages and Verification research group at RWTH Aachen, which develops and maintains the AProVE and LoAT tools. These tools are central to automated termination and complexity analysis and are regularly submitted to international competitions such as TERMCOMP and VBS.

• Formal Methods in Systems Biology
• Process Algebras
• Simulation of Biological Systems
• +۳ مورد دیگر

Roberto Barbuti is a Full Professor at the Department of Computer Science, University of Pisa. He has held this position since 2000, following roles as Assistant Professor (1982–1989) and Associate Professor (1989–2000). His research focuses on Formal Methods in Systems Biology, Process Algebras, and computational models of biological systems. He leads the research group on Modelling, Simulation and Verification of Biological Systems. Education: Born in San Giuliano Terme (Pisa), Italy, on August 10, 1953, he earned a Master's in Computer Science from the University of Pisa in 1977. He was a Research Fellow at the Istituto per l'Elaborazione dell'Informazione, CNR, Pisa (1977–1982). Teaching: He teaches Programming 1 and Laboratory courses, with detailed exam regulations requiring written and laboratory components. His teaching materials include lecture notes on recursion theory, functional programming in Caml Light, and formal semantics of the C language. Awards and Grants: No specific scientific awards or grants mentioned in the text. Labs/Teams: Leads the research group on biological systems modelling and simulation.

Cezary Kaliszykمشاهده پروفایل

استاد

• Theoretical Computer Science
• Automated Reasoning
• Formal Methods
• +۱۳ مورد دیگر

Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne. His research focuses on automated reasoning, formal methods, and learning for reasoning, particularly in the context of interactive theorem proving and formalized mathematics. He leads the ERC project 'FormalWeb3' and has been involved in several other significant research initiatives. Theoretical Computer Science Automated Reasoning Formal Methods Interactive Theorem Proving Machine Learning for Theorem Proving Formalized Mathematics Proof Guidance Learning for Reasoning His research explores the integration of machine learning techniques with formal reasoning systems to enhance automation in theorem proving. This includes developing systems like CoqHammer and Tactician, advancing premise selection, proof guidance, and learning-based proof search strategies. His work bridges logical foundations with practical AI-driven tools for formal verification. The recent publications demonstrate a consistent focus on advancing automated and interactive theorem proving through learning techniques, formalization of mathematical concepts (like surreal numbers), and improving reasoning systems (e.g., Prover9, tableaux methods). There is a strong emphasis on practical system development, formalization projects, and learning-based enhancements to reasoning. ERC project 'FormalWeb3' - Principal Investigator Cost Action EuroProofNet - WG5 Leader until 2024 FWF project P26201 - developing HOL(y)Hammer Other projects: JSPS P10044, NWO MathWiki, SURF WebDed, ProofWeb He has advised several PhD students to completion, including Michael Färber, Thibault Gauthier, Yutaka Nagashima, Stanisław Purgał, and Liao Zhang, and is currently supervising Daniel Ranalter and Neil Vyas. He has not received any explicitly mentioned scientific awards in the provided text. His work involves leadership in collaborative systems such as ProofWeb and HOL Import, and participation in major formalization efforts including the Mizar library integration with Isabelle. He is actively involved in the development of tool ecosystems for formal mathematics and automated reasoning.