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

• Formal Verification
• Machine Learning
• Computer Architecture
• +۸ مورد دیگر

Ziyad Hanna is a Visiting Professor at the University of Oxford's Department of Computer Science and currently serves as Corporate Vice President and R&D General Manager at Cadence Design Systems, leading their Israel-based formal verification research and development. He holds a PhD in Computer Science from the University of Oxford and has over 30 years of industrial experience in Electronic Design Automation (EDA), with leadership roles at Intel, Jasper Design Automation, and Cadence. Ziyad holds a B.Sc. and M.S. in Mathematics and Computer Science from Tel-Aviv University, and a PhD (DPhil) in Computer Science from the University of Oxford. His doctoral thesis focused on A Symbolic Execution Framework for Algorithmic-Level Modelling and Verification of Computer Microarchitecture . His research interests span Formal Verification methodologies, Machine Learning applications in verification, Computer Architecture, Software Engineering, Hardware Design, and Quantum Computing. He has pioneered advancements in formal equivalence checking, verification IP for chip design, and the integration of AI-driven techniques for bug localization and root-cause analysis. Red Herring Top 100 North America Company (2013) for Jasper Design Automation Intel's highest achievement award (IAA) - received twice Cadence move-the-needle award Israeli presidential award for community volunteering Ranked 39 in TheMarker’s 100 most influential people in Israel (2019) Listed in 'People and Computers' magazine's 2020 influential Hi-Tech list Ziyad has mentored numerous academic research projects and served on program committees for conferences such as FMCAD, SAT, and DAC. He leads a multinational R&D network across 10 centers and has driven Cadence's research agenda in formal verification and machine learning for EDA. His work has been supported by industry collaborations and institutional funding, including a 5-year initiative endorsed by Israel to advance Hi-Tech in the Arab community. He oversees Cadence Israel's advanced formal verification research group, the largest of its kind globally, and chairs the annual Jasper User Group (JUG) conference, a key industry event in formal verification.

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

• Theorem Proving
• Runtime Verification
• Automated Reasoning
• +۳ مورد دیگر

Giles Reger is a Lecturer in the Formal Methods Group within the School of Computer Science at the University of Manchester. His primary roles include research and teaching in theorem proving, runtime verification, and formal methods. He has been actively involved in projects such as the Centre for Digital Trust and Society and the SCorCH project focusing on secure code verification. Educational background: Giles holds a BA in Computer Science from the University of Cambridge (2009), an MSc in Advanced Computer Science from the University of Manchester (2010) with the Highest Achiever of the Year Award, and a PhD from the University of Manchester (2014) titled Automata based monitoring and mining of execution traces . Research interests focus on two core areas: theorem proving (quantifier reasoning, first-order theories, collaborative proof search, and integration of SAT/SMT solvers) and runtime verification (temporal specifications, monitoring algorithms, violation explanation, and benchmarking). His work emphasizes practical applications in tool development and real-software analysis. Notable awards include the ACM SIGSOFT Distinguished Paper Award (2024) for his paper on LLM-generated invariants. His research contributions span over 50 publications, with active involvement in funded projects like SCorCH (Secure Code for Capability Hardware) and the Centre for Digital Trust and Society. Advising and grants: Reger welcomes PhD/MSc students in theorem proving, program verification, and related fields. He has supervised multiple research students and leads collaborative projects involving international researchers. His lab, the Formal Methods Group, develops tools like the Vampire theorem prover and contributes to runtime verification frameworks.

Arie Gurfinkelمشاهده پروفایل

استاد

• Automated Program Analysis
• Software Model Checking
• Automated Reasoning
• +۴ مورد دیگر

Arie Gurfinkel is a Professor at the University of Waterloo, holding a joint appointment in the Department of Electrical and Computer Engineering and the Cheriton School of Computer Science. His research focuses on automated program analysis, software model checking, automated reasoning, and abstract interpretation. He develops tools like SeaHorn, Avy, and others to enhance the verification and testing of complex computer systems. His work emphasizes formal methods, machine learning integration, and hardware/software verification. Recent publications highlight advancements in interpolation-based model checking, constrained Horn clauses, and algorithm selection for hardware verification. Gurfinkel's contributions include open-source tools and frameworks widely used in academic and industrial verification efforts. He actively seeks motivated graduate students interested in logic, automated reasoning, and formal methods. His research has been presented in top-tier conferences and journals, reflecting his expertise in formal verification and software engineering.

• Artificial Intelligence
• Theoretical Computer Science
• Automated Reasoning
• +۳ مورد دیگر

Martin Kronegger serves as a Senior Lecturer in the Department of Automation Systems at Vienna University of Technology (TU Wien), where he teaches courses including Fundamentals of Digital Systems, Computer Engineering Projects, and Scientific Projects in Computer Science for the 2025W and 2026S semesters. His academic profile demonstrates active engagement in both teaching and research within the Faculty of Electrical Engineering and Information Technology. Dr. Kronegger's research centers on theoretical foundations of artificial intelligence with emphasis on parameterized complexity, automated planning, and answer set programming. His work bridges theoretical computer science with practical applications in knowledge representation and reasoning, as evidenced by publications in premier venues like Artificial Intelligence journal and AAAI conferences. Key research themes include: Backdoor techniques for planning problems Parameterized complexity analysis of AI problems QBF solving for conformant planning SAT-based verification methods for software models His publication landscape reveals consistent contributions to parameterized complexity theory applied to planning and logic programming from 2011-2019, with significant work on multiparametric analysis of answer set programming and SAT-based approaches to planning problems. The research trajectory shows deepening theoretical contributions while maintaining connections to practical AI applications. Dr. Kronegger has supervised at least one diploma thesis on planning solvers and has participated in major research projects including FAIR (2013–2018), START (2014–2022), and X-TRACT (2014–2018). His project work demonstrates sustained collaboration with research groups at TU Wien focused on computational logic and automated reasoning. Based in the Automation Systems research group (E191-03) at TU Wien's Treitlstraße campus, he maintains active research collaborations through projects like the START program and contributes to the international answer set programming community as evidenced by involvement in the Fourth Answer Set Programming Competition.

• Automated Reasoning
• Knowledge Representation and Reasoning
• Computational Logic
• +۵ مورد دیگر

Uwe Egly is an Associate Professor at the Department of Knowledge-Based Systems, Faculty of Informatics, Technische Universität Wien (TU Wien). His research focuses on automated reasoning, proof theory, knowledge representation, and computational logic, with a strong emphasis on quantified Boolean formulas (QBFs), argumentation frameworks, and applications of AI in engineering. He leads projects funded by the Austrian Science Fund (FWF) and the Vienna Science and Technology Fund (WWTF), including the Boolean project (2011–2019) and FAME (2011–2014). Egly is known for developing QBF solvers like DepQBF and contributing to SAT-solving techniques. He teaches courses such as Abstract Argumentation , Formal Methods in Computer Science , and Quantum Computing . His research interests span proof complexity, satisfiability checking, and AI-driven algorithms for path planning. He has advised numerous students on theses involving quantum algorithms, QBF solver optimizations, and argumentation frameworks. Egly’s work bridges theoretical computer science with practical applications, including contributions to deformation monitoring systems and circuit synthesis using SAT-based methods. He is involved in international workshops and conferences, such as SAT, FMCAD, and Dagstuhl Seminars, and has edited proceedings for events like SAT 2014 . His collaborations include projects on scenario-based testing of UML diagrams and semantics-aware model versioning. Egly’s interdisciplinary approach integrates logic, artificial intelligence, and computational methods to solve complex theoretical and applied problems.

• Formal Verification
• Model Checking
• SAT/SMT Methods
• +۴ مورد دیگر

Natasha Sharygina is a Full Professor of Informatics at the University of Lugano (USI) in Switzerland. She leads the USI Formal Verification and Security group, focusing on improving software and hardware verification through formal methods like model checking and SAT/SMT techniques. Her research emphasizes applying these methods to computer security, electronic design, and program analysis. Education: PhD in Informatics from The University of Texas at Austin (2002). Research Interests: Her work spans formal verification, model checking, SMT-based solvers, and security analysis. She develops theoretical frameworks and practical tools for verifying large-scale systems, with applications in safety-critical and distributed computing environments. Funding & Awards: Her research has been supported by grants from the Swiss National Science Foundation, EU STReP/COST projects, Hasler Foundation, and TASSO Career Award. She has been recognized with the ACM Recognition of Service Award and CMU Technical Excellence Awards. Grants & Projects: Key initiatives include 'Beyond Symbolic Model Checking through Deep Modelling' (2019–2023), EU-funded 'Rich-Model Toolkit', and Swiss TASSO Career Award (2005–2010). She has led efforts in parallel SMT solving and runtime verification. Labs & Teams: Director of the USI Formal Verification and Security Lab, which develops tools like Golem (CHC solver) and OpenSMT (SMT solver). Collaborates globally on projects like SAFARI and FunFrog for program verification.

• Software engineering for decentralized systems
• Multi-agent systems
• Autonomic computing
• +۳ مورد دیگر

Tom Holvoet is a Full Professor at the Department of Computer Science , KU Leuven , affiliated with the Faculty of Engineering Science and the research groups Distributed and Secure Software (DistriNet) and Leuven.AI . Research focuses on decentralized systems , multi-agent systems , and autonomic computing . Currently supervising PhD and master's projects on blockchain vulnerabilities , autonomous decision-making , and embedded systems resilience . Teaching courses: Software Design , Programming Principles , and Distributed Systems . His work involves collaborations with international institutions and grants from the FWO (Fonds Wetenschappelijk Onderzoek) .

Stefan Grunerمشاهده پروفایل

استاد

• Formal Methods
• Software Engineering
• Model Checking
• +۹ مورد دیگر

Stefan Gruner is a Professor in the Department of Computer Science, Faculty of Engineering, Built Environment and Information Technology, at the University of Pretoria, South Africa. He holds advanced degrees in Informatics (PhD, MSc) and Philosophy (MA), reflecting his interdisciplinary research that bridges formal software engineering, digital forensics, and the philosophy of technology. His work is widely published in international journals and conferences, and he is deeply involved in academic service, including supervision, examination, and program committees. Education: MA in Philosophy, Germany, 2010 PhD in Informatics, RWTH Aachen, Germany, 1999 MSc (Dipl.-Inform.) in Informatics, Germany, 1996 His research interests center on Formal Methods , Software Engineering , and the Philosophy of Computer Science . He has made significant contributions to parameterized and three-valued model checking, formal methods for railway systems, and the scientific foundations of digital forensics. His recent work explores historical semantics in software architecture and the philosophical underpinnings of informatics. His publications from the last few years reveal a strong trend towards formal verification, safety-critical systems, and the epistemological aspects of digital investigation and software engineering. Scientific Recognition: Biographic entry in Who's Who in the World (2010 edition) Member of the selection committee for the Annual Best Dissertation Award (EAPLS) Stefan Gruner is an active advisor and supervisor, having guided numerous MSc and PhD students to completion. He has secured research funding from the South African National Research Foundation (NRF) and international partners for projects on model-driven development, CSP protocol verification, and visualization of distributed algorithms. His academic service is extensive, including roles as program chair for workshops like FM+AM and SEFM, editor for conference proceedings, and external examiner for multiple universities. He has also been a visiting researcher at institutions in Bordeaux and Swansea. He was a central organizer of the Distributed Systems Research Group at the University of Pretoria and has fostered international collaborations, particularly within the formal methods and software engineering communities.

• Formal Methods
• Model-Driven Engineering
• SAT/QBF Solving
• +۴ مورد دیگر

Martina Seidl is a researcher and principle investigator at TU Wien's Institut für Softwaretechnik und Interaktive Systeme (E188). Her main affiliation is within the Faculty of Informatics. She leads the FAME Project (Formalizing and Managing Evolution in Model-Driven Engineering), focusing on advancing formal methods in software engineering. Her research interests include formal verification techniques, SAT/QBF solving algorithms, model-driven engineering, and automated reasoning. She has contributed to advancements in quantified Boolean formula (QBF) solving, parallel computing methodologies for logical problems, and formal methods in software model analysis. Her work spans theoretical computer science and practical applications in automated theorem proving and model checking. Notable contributions include expansion-based QBF solving approaches, parallel solving frameworks, and feature-based classifications of formal verification techniques. Seidl co-organized the QBF Gallery initiative, which curates benchmark suites for quantified Boolean formula competitions. She has also published extensively on clause redundancy optimization, blocked clause analysis, and the integration of formal methods in educational contexts like UML@Classroom.

Timos Antonopoulosمشاهده پروفایل

مدرس

• Logic
• Verification
• Formal Languages
• +۳ مورد دیگر

Timos Antonopoulos is a Research Scientist and Lecturer in the Department of Computer Science at Yale University. He is a member of the Rigorous Software Engineering (ROSE) group, led by Ruzica Piskac. His office is located in Dunham Laboratory (Room 404) at 10 Hillhouse Avenue, New Haven, CT. Antonopoulos's research focuses on formal methods and their applications in security and reliability. Key areas include: Logic and Verification : Developing tools and algebras for relational verification, termination analysis, and program correctness. Cryptography & Privacy : Designing zero-knowledge protocols (e.g., ZKSMT, ppSAT) and privacy-preserving techniques for automated decision-making and model checking. Automated Reasoning : Creating frameworks for intentional behavior analysis, SMT-based oracles, and invariant inference to handle uncertainty and complexity. His recent publications (2020–2024) reflect a strong emphasis on cryptographic code security, zero-knowledge proofs, and formal accountability tools. Trends include scalable privacy protocols (e.g., parallelization of zero-knowledge systems), legal/ethical AI verification (e.g., soid for automated decisions), and novel graph/algebraic methods for secure computation. Antonopoulos collaborates extensively within the ROSE group, contributing to projects involving oblivious algorithms, timing-attack mitigation, and secure multi-party SAT solving. His work bridges theoretical foundations (e.g., automata theory, relational algebra) with practical systems security challenges.

Nikolaj Bjørnerمشاهده پروفایل

پژوهشگر

• Symbolic Solving Techniques
• SMT Solvers
• Program Verification
• +۱۰ مورد دیگر

Nikolaj Bjørner is a Partner Researcher at Microsoft Research , affiliated with the Research in Software Engineering (RiSE) group. His work centers on symbolic solving techniques, particularly through the development of the Z3 SMT solver , which underpins program verification, test case generation, and cloud network management. He has also contributed to distributed file systems and network verification . Academic Rank : Researcher Key Collaborations : Leonardo de Moura (Z3), George Varghese (network verification), Mooly Sagiv (controller verification) Research Interests : Bjørner’s work spans SMT solvers (Z3, muZ, SPACER), network verification (SecGuru, NoD, ddNF), and distributed systems (DFSR, RDC). His methods bridge logical reasoning, optimization, and network reliability. Article Trends : His publications focus on SMT solving (e.g., Z3, muZ, SPACER), network verification (ddNF, TeaVar), and quantifier instantiation (MBQI). These works integrate model-based reasoning and theory combination to address scalability in software and networking. Awards : 2021 ACM Fellow 2021 CAV Award (pioneering SMT contributions) 2019 Herbrand Award (Z3) 2017 Skolem Award (E-matching) 2016 Best Paper (HVC, ddNF) 2015 ACM SIGPLAN Software System Award (Z3) Collaborations & Students : Bjørner has mentored interns and collaborators like Daniel Selsam (neural networks for SAT), Nuno P. Lopes (Alive, NoD), and Rachee Singh (Shoofly, traffic engineering). He co-organized the 2022 Shonan workshop on SAT and served as program chair for conferences like PSI and FMCAD.

Nicolas Amatمشاهده پروفایل

پژوهشگر

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

Nicolas Amat is a postdoctoral researcher at the IMDEA Software Institute , specializing in theoretical computer science with a focus on model checking, Presburger arithmetic, and Petri net analysis. PhD in Model Checking from INSA Toulouse / LAAS-CNRS (2020-2023) MSc in MoSIG - HECS from Univ. Grenoble Alpes (2019-2020) Engineering Degree in Computer Science from ENSIMAG - Grenoble (2017-2020) His research explores polyhedral abstraction techniques combined with SMT-based verification to solve reachability problems in Petri nets. He develops tools like SMPT, Reductron, and Octant that implement these methods. Awarded Bronze Medals in the Model Checking Contest (2023, 2022) with 100% confidence recognition in 2022, and received the Persyval-lab Excellence Scholarship (2019). His work has been published in journals like Fundamenta Informaticae , and conferences including VMCAI , Petri Nets , and TACAS .

Victor Lagerkvistمشاهده پروفایل

دانشیار

• Computational Complexity
• Constraint Satisfaction Problems (CSP)
• Theoretical Computer Science
• +۳ مورد دیگر

Victor Lagerkvist is an Associate Professor at the Department of Computer Science (IDA) , Linköping University, Sweden. He is affiliated with the Theoretical Computer Science Laboratory (TCSLAB) and the Artificial Intelligence and Integrated Computing Systems (AIICS) division. His research focuses on the algebraic method for analyzing computational complexity , particularly in constraint satisfaction problems (CSPs), SAT, and graph homomorphism problems. PhD in Computer Science (2016, Linköping University) Habilitation (2020, Linköping University) His recent work investigates fine-grained complexity , twin-width , and universal algebra to improve algorithms for NP-hard problems. Publications span topics like propositional abduction, Allen's interval algebra, and semiring-based dynamic programming. His scientific awards include the Swedish Research Council Starting Grant (2020) and the 2017 Young Researcher Prize from the Ruth and Nils-Erik Stenbäck Foundation. He supervises PhD students such as Leif Eriksson and serves as a secondary supervisor for others at Linköping University and Université de Lorraine.

• Automated Reasoning
• Formal Verification
• Deep Neural Network Verification
• +۲ مورد دیگر

Aleksandar Zeljić is a Researcher at Stanford University's Center for Automated Reasoning and Center for AI Safety . He holds a PhD from Uppsala University's Department of Information Technology, supervised by Philipp Ruemmer, Christoph M. Wintersteiger, and Wang Yi. Research Focus: Automated reasoning (SAT/SMT solvers), formal verification of deep neural networks, and machine arithmetic analysis. Projects: Marabou (neural network verification), UppSAT (SMT approximation framework), mcBV (bit-vector SMT solver), and SmallFloats (Z3-based floating-point approximation). His recent publications focus on bit-vector interpolation, neural network optimization, and parallel verification techniques. Articles reveal expertise in formal methods , symbolic computation , and AI safety . Notable recognition includes the IJCAR Best Paper Award (2014) . Contributions to theoretical computer science include: Developing approximation frameworks for SMT solvers Advancing bit-vector and floating-point arithmetic verification Creating parallelization strategies for neural network analysis He has served as PC member for conferences like VSSTE, PAAR, and FOMLAS, and reviewed for journals including TCS and JAR.