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

• Computer Science
• Formal Methods
• Programming Languages
• +۱ مورد دیگر

André de Matos Pedro is an Assistant Professor in the Department of Computer Science at the University of Beira Interior. He teaches courses including Teoria da Computação (Theory of Computation), Programação Funcional (Functional Programming), and Segurança e Fiabilidade de Software (Software Security and Reliability). His research focuses on formal methods, runtime verification, and programming language theory. His publication record shows consistent focus on formal verification methods applied to real-time and embedded systems. Recent work emphasizes runtime monitoring frameworks, SAT/SMT-based verification techniques, and applications in safety-critical domains like autopilot systems. The research trajectory demonstrates increasing emphasis on practical applications of temporal logic and co-simulation testing platforms.

Stephanie Kemperمشاهده پروفایل

پژوهشگر

• Real-time Systems
• Verification
• Model Checking
• +۵ مورد دیگر

Dr. Stephanie Kemper is a Researcher in the Correct System Design Group at the Department of Computing Science, University of Oldenburg, Germany. Her career spans roles including Research Assistant at Centrum Wiskunde & Informatica (2006-2011), OFFIS (2012-2015), and continuous contributions to the University of Oldenburg since 2011. Education Diploma in Computer Science with distinction (University of Oldenburg, 2006) PhD in Computer Science (Leiden Institute of Advanced Computer Science, 2011) Research Interests Specializing in formal methods for real-time systems, her work emphasizes: Timed Automata and Timed Constraint Automata SAT-based Model Checking for verification Component-based Software Engineering Abstraction Refinement with Craig Interpolation Concurrency and True Concurrency in systems Scalable verification techniques overcoming state explosion Publication Trends Her publications (2007-2013) focus on real-time coordination patterns, SAT-based verification, and compositional analysis of timed systems. Key areas include formal modeling of traffic scenarios, constraint automata for component connectors, and counterexample-guided abstraction refinement. Affiliations University of Oldenburg (2011-present) Centrum Wiskunde & Informatica (2006-2011) OFFIS Group SAV-RSM (2012-2015)

Carsten Fuhsمشاهده پروفایل

مدرس ارشد

• Program Analysis
• Termination
• Complexity Bounds
• +۵ مورد دیگر

Carsten Fuhs is a Senior Lecturer at the School of Computing and Mathematical Sciences at Birkbeck, University of London . His research focuses on Program Analysis , Termination , Complexity Bounds , and Term Rewriting , with applications in Verification and SAT Encodings . Research Group Lead of the Logical Methods research group (2023–present) Member of the Board of Trustees for CADE (2023–present) Chair of the Bill McCune PhD Award Expert Committee (2024, 2025) Active in conference organization and program committees (FSCD, IJCAR, LOPSTR, etc.) Research Interests : Carsten Fuhs specializes in automated termination and complexity analysis for term rewriting and programming languages. His work leverages SAT solving and constraint-based methods to develop tools like AProVE for program verification. Key areas include parallel term rewriting , higher-order dependency pairs , and memory safety proofs . Selected Publications Trends : Recent articles emphasize higher-order rewriting (2025), parallel complexity analysis (2024), and modular termination proofs (2022–2024). Earlier work (2014–2017) explores pointer arithmetic verification , separation logic , and integer program complexity . Scientific Awards : Best Paper Award, LOPSTR 2022 Teaching and Mentoring : Carsten Fuhs has lectured on Java programming , compilers , and term rewriting at Birkbeck and international summer schools. He contributes to SAT competitions as a benchmark submitter and organizes regional programming language seminars like S-REPLS 10 (2018).

Nian-Ze Leeمشاهده پروفایل

استادیار

• Formal Methods
• Hardware Verification
• Software Verification
• +۳ مورد دیگر

Nian-Ze Lee is an Assistant Professor at the Department of Electrical Engineering of National Taiwan University, leading the Formal Methods and Analysis for Computing and Engineering Laboratory (ForMACE Lab). He is also a Guest Professor affiliated with the Software and Computational Systems Lab (SoSy-Lab) at Ludwig-Maximilians-Universität München (LMU Munich), Germany. He holds a Ph.D. in Electronics Engineering from National Taiwan University (2021). His research focuses on formal methods, hardware and software verification, and circuit-based analysis. Education: Ph.D. in Electronics Engineering, National Taiwan University (2021) Research Interests: Formal methods for hardware and software systems Model checking and verification frameworks Circuit-based program verification (e.g., Btor2C translator) Algorithm selection for verification tools Awards: ACM SIGSOFT Distinguished Paper Award (2025) Best Artifact Award (2024) DFG Grant for Bridging Hardware and Software Analysis (2024) Advising & Grants: Supervises Ph.D./Master’s students on topics like algorithm selection and verification frameworks Recipient of DFG grant enabling collaboration between NTU and LMU Munich Labs/Teams: ForMACE Lab (NTU) – Focuses on formal methods and system analysis SoSy-Lab (LMU) – Collaborations on verification tools and frameworks

Orna Grumbergمشاهده پروفایل

استاد

• Model checking
• Automated verification
• Abstraction and refinement
• +۷ مورد دیگر

Orna Grumberg is a Leumi Chair Professor in the Computer Science Department at the Technion - Israel Institute of Technology. She has held this professorship since 2005 and was awarded the Leumi Chair in Science in 2011. Professor Grumberg serves on the Steering Committee of the Computer-Aided Verification (CAV) conference and has been actively involved in the academic community through editorial boards and conference committees. Her educational background is deeply rooted at the Technion, where she received her B.Sc., M.Sc., and Ph.D. in Computer Science. Professor Grumberg's research spans several critical areas in computer science, with a primary focus on formal verification methods. Her work has significantly advanced the field of model checking and automated verification systems. She has made substantial contributions to abstraction techniques, refinement methods, and counterexample analysis in verification processes. Her research extends to compositional model checking, SAT-based approaches, distributed verification systems, and applications to security vulnerability detection. Her theoretical work on temporal logics and automata on infinite objects provides the mathematical foundation for many practical verification tools. The publication record of Professor Grumberg demonstrates a consistent research trajectory focused on improving model checking techniques. Her work shows evolution from foundational model checking approaches to more specialized techniques like abstraction-refinement, SAT-based solving, and security applications. The research spans theoretical computer science, practical software engineering applications, and hardware verification, reflecting the interdisciplinary nature of formal methods. Professor Grumberg has received recognition through her leadership roles in the field, including serving on the Steering Committee of the CAV conference and editorial boards of prestigious journals like "Information and Computation" and "Formal Methods in System Design". Her book "Model Checking" co-authored with E.M. Clarke and D. Peled has become the standard reference in the field. As an educator and mentor, Professor Grumberg has shaped the verification landscape in Israel. She served as Associate Dean for Graduate Studies at the Technion and established the software engineering track with a strong verification component. Her introductory model checking course attracts approximately 100 students annually. Her students now hold prominent positions in academia (Hebrew University, Tel-Aviv University) and industry (particularly at IBM). She maintains strong industry collaborations, with ongoing projects with IBM on UML Verification and with Rafael on Finding Security Vulnerabilities in Network Protocols. Professor Grumberg leads research groups that form the foundation for verification teams in major Israeli technology companies like IBM and Intel, demonstrating the practical impact of her academic work.

• Formal verification
• Model checking
• Binary decision diagrams
• +۷ مورد دیگر

Gianpiero Cabodi is an Associate Professor in the Department of Control and Computer Science (DAUIN) at the Polytechnic of Turin, where he is also a member of the University Internship Commission. He is actively involved in teaching and research within the College of Computer, Film and Mechatronics Engineering. Research Interests: His research spans formal verification, model checking, binary decision diagrams, SAT solvers, embedded system design, and cybersecurity. His work emphasizes formal methods for ensuring correctness and security in hardware and software systems, particularly in safety-critical and automotive applications. Recent Publications: His 2024 publications demonstrate a strong focus on optimizing formal verification techniques. He explores interpolation-based improvements in bounded model checking, hardware model checking algorithms, and the use of binary decision diagrams in interpretable machine learning—highlighting a convergence of formal methods with modern AI interpretability and hardware verification. Teaching and Leadership: He has served as a course instructor for advanced data structures in Python, systems programming, and algorithms. He has also directed several doctoral programs in Computer and Systems Engineering. His leadership extends to research projects such as REBECCA and OSMOSIS, and he has chaired international workshops including FMCAD and DIFTS. Research Projects: REBECCA (2023–2026): Scientific Head of Structure, focusing on reconfigurable platforms for secure AI. OSMOSIS (2008–2010): Scientific Responsible for EU-funded codesign of embedded systems. Multiple commercial research projects on embedded systems in automotive, RFID traceability, cybersecurity, and HMI design (2008–2025). Advising and Grants: While no formal students are listed, he has supervised numerous research projects, often as Scientific Manager or Responsible, funded by both EU programs and industry contracts. His work bridges academic research and industrial applications, particularly in automotive and embedded domains. Labs and Teams: He is a key member of the FM - Formal Methods (DAUIN) research group, which focuses on formal verification techniques for digital systems.

Yohan BOICHUTمشاهده پروفایل

استادیار

• Formal Methods
• Term Rewriting Systems
• Tree Automata
• +۵ مورد دیگر

Yohan BOICHUT is an Assistant Professor at the University of Orleans, Faculty of Science, Department of Computer Science. He is a member of the LMV research team at LIFO (Laboratoire d'Informatique Fondamentale d'Orléans), where he leads significant research in formal methods and security protocol verification. His teaching portfolio spans multiple degree levels including Algorithms and Programming (License 1), Data Bases (License 3 MIAGE), and advanced topics like Security and Specification and Verification at the Master level. Dr. BOICHUT's research focuses on formal verification techniques, particularly term rewriting systems and tree automata for security protocol analysis. His work has produced significant contributions to reachability analysis, model checking, and the development of the TA4SP tool within the European AVISPA project. He has also contributed to projects like PROUVE and ACI SATIN, focusing on automated verification of cryptographic protocols. His publication record shows consistent contributions to the field since 2004, with recent work (2024-2025) advancing SAT-based automated completion and equivalence class analysis in term rewriting systems. The trajectory of his research demonstrates a progression from foundational work on tree automata completion toward increasingly sophisticated approximation techniques for security protocol verification. A'Doc 2006: First award of the SPIM graduate school of the Franche-Comté University As Head of MASTER MIAGE 1, Dr. BOICHUT oversees curriculum development and academic guidance. His research has been supported through multiple European projects including AVISPA (Automated Validation of Internet Security Protocols and Applications), where he contributed to the development of the TA4SP verification tool that handles algebraic properties of operators like exponentiation and exclusive or. Within LIFO, he collaborates with the LMV team on theoretical computer science research, particularly in the areas of rewriting approximations and formal verification techniques applicable to both finite and infinite state systems.

• Software Model Checking
• Formal Methods
• Software Verification
• +۶ مورد دیگر

Dirk Beyer is a Full Professor and Head of Research Chair at the Department of Computer Science, Ludwig-Maximilians-Universität München (LMU Munich), where he leads the Software and Computational Systems Lab. His research focuses on developing models, algorithms, and tools for constructing and analyzing reliable software systems, with emphasis on software verification, model checking, and static analysis. Professor Beyer's research spans multiple critical areas in software engineering and formal methods. He has made significant contributions to software model checking through tools like CPAchecker and BLAST, structure analysis of large systems using CrocoPat and CCVisu, and formal verification of real-time systems with Rabbit. His work on interfaces for component-based design (Chic) has advanced modular software development approaches. Beyer has pioneered methodologies in benchmarking and reliable experimental evaluation through BenchExec, which has become a standard in tool competitions. Analysis of his recent publications reveals a strong focus on advancing software verification techniques, particularly in transferring knowledge between hardware and software verification domains, decomposing verification tasks for parallel processing, and improving the effectiveness of verification witnesses. His work consistently bridges theoretical foundations with practical tool implementations, with a growing emphasis on comparative evaluation and competition frameworks that drive the field forward. ACM SIGSOFT Distinguished Paper Award (FSE 2024) ACM SIGSOFT Best Artifact Award (FSE 2024) As a principal investigator of the DFG Research Training Group ConVeY, Beyer has secured significant funding for advancing verification techniques. He has played leadership roles in numerous software verification competitions including SV-COMP and Test-Comp, serving as PC Chair for major conferences like TACAS 2018 and VMCAI 2020. His service contributions extend to chairing ETAPS 2022 and organizing multiple workshops on CPAchecker. Professor Beyer leads the Software and Computational Systems Lab at LMU Munich, which has developed numerous influential verification tools including CPAchecker (configurable software verification), BenchExec (reliable benchmarking), and CCVisu (software structure visualization). The lab maintains active collaborations with research groups worldwide and contributes significantly to the international verification community through competitions, benchmarks, and open-source tool development.

Allison Sullivanمشاهده پروفایل

استادیار

• Software Engineering
• Formal Methods
• Computer Science
• +۳ مورد دیگر

Allison Sullivan is an Assistant Professor of Computer Science at The University of Texas at Arlington (UTA), affiliated with the Software Engineering Research Center (SERC) and the College of Engineering. She holds a PhD in Software Engineering from The University of Texas at Austin (2017) and previously served as an Assistant Professor at North Carolina A&T State University (2018-2020). Her research focuses on software reliability through automated engineering techniques and formal methods, supported by NSF and DoD grants. Education: PhD in Software Engineering (UT Austin, 2017), MS (UT Austin, 2014), BS (UT Dallas, 2012). Research interests include automated test generation, mutation testing, program synthesis, and formal verification of autonomous systems. Key areas span Model-Based Testing, First-Order Logic, and SAT/SMT solvers. Publications reflect her work in Alloy-based tools (e.g., AUnit, MuAlloy), mutation testing frameworks, and educational outreach. Notable awards include NSF CAREER (2024), UTA Rising Star (2024), and Outstanding Early Career Faculty (2025). She advises multiple graduate and undergraduate students, teaches courses in algorithms, software testing, and formal methods, and serves on program committees for conferences like ASE, MODELS, and ISSRE. Her broader impacts include K-12 outreach, curriculum development, and mentoring through initiatives like Google Faculty In Residence and AMIE Design Challenge. Labs/Teams: Leads the SCOPE lab at UTA, focusing on program correctness verification.

Yu-Fang Chenمشاهده پروفایل

استاد پژوهشی

• Program verification
• Automata theory
• String constraint solving
• +۳ مورد دیگر

Yu-Fang Chen is a research professor at Academia Sinica, Taiwan, active across premier programming-languages venues such as PLDI, POPL, OOPSLA, SAS, APLAS and VMCAI. His work sits at the intersection of program verification , automata theory and constraint solving , with recent emphasis on quantum-circuit verification and string-number constraint solving . Research interests revolve around rigorous methods to ensure software reliability: developing novel automata models (level-synchronized tree automata, position-constrained string automata), building practical solvers that blend length, substring and numeric constraints, and extending automated reasoning to the quantum domain. His papers consistently introduce new decision procedures, learning algorithms and tool-chains that improve the scalability of static analysis and formal verification. Between 2017 and 2025 he (co-)authored more than a dozen peer-reviewed papers and served on over thirty program committees, including steering and organization chair roles for VMCAI 2026 and SAS 2023 . No doctoral students or funded-grant details are disclosed in the supplied sources.

• Asynchronous Circuits
• Formal Verification
• Computer-Aided Design (CAD)
• +۱۰ مورد دیگر

Michael Theobald is a researcher at D. E. Shaw Research, focusing on the design and verification of specialized supercomputers for protein simulations. He has previously held postdoctoral and academic positions at Carnegie Mellon University (CMU) and Columbia University. Education: Ph.D. in Computer Science from Columbia University (2002), Postdoctoral Fellow at CMU (2002-2004), and Diplom in Computer Science from Johann Wolfgang Goethe-Universitaet (1994). His research interests span formal verification of software and hardware systems, asynchronous (“clock-less”) circuits, and efficient algorithms for combinatorial optimization. He has contributed to advancements in BDD and SAT techniques, logic synthesis, and hybrid systems verification, with applications in systems biology and robotics. Michael's publications emphasize formal methods, including model checking, abstraction refinement, and SAT-based algorithms applied to hybrid and asynchronous systems. These works align with his broader expertise in embedded systems and computer-aided design.

Rolf Drechslerمشاهده پروفایل

استاد

• Computer Science
• Formal Verification
• Circuit Design
• +۳ مورد دیگر

Rolf Drechsler is a Full Professor and Head of the Group of Computer Architecture at the University of Bremen since 2001, with additional role as Director of the Cyber-Physical Systems Group at DFKI Bremen since 2011. He holds a Dr. phil. nat. in computer science from Johann Wolfgang Goethe University Frankfurt and has held academic positions at Albert-Ludwigs University Freiburg and Siemens AG. Education: Diploma and Dr. phil. nat. in Computer Science (Johann Wolfgang Goethe University Frankfurt, 1992-1995) Previous Roles: Albert-Ludwigs University Freiburg (1995-2000), Siemens AG Munich (2000-2001) His research focuses on formal verification , circuit/system design , and data structures for hardware validation . He has pioneered work on polynomial verification methods, BDD-based synthesis, and quantum computing verification frameworks. Recent publications analyze memristor-based in-memory computing, RISC-V security, and LLM-assisted hardware validation. Key awards include ACM Fellow IEEE Fellow Berninghausen Teaching Award (2018) Multiple best paper awards at ICCAD, DATE, DAC, and DDECS He serves as Associate Editor in journals like IEEE Transactions on CAD and ACM Journal on Emerging Technologies. He co-founded the Graduate School of Embedded Systems and Data Science Center at University of Bremen.

Jip Dekkerمشاهده پروفایل

پژوهشگر ارشد

• Constraint Programming
• Optimization
• Programming Languages
• +۵ مورد دیگر

Jip Dekker is a Research Fellow at the Department of Data Science & AI, Monash University. His expertise lies in constraint programming, optimization, and neuro-symbolic AI. He holds a PhD from Monash University (2021), an MSc from Uppsala University (2017), and a BSc from Radboud University (2014). Research interests include constraint-based modeling languages, SAT solving techniques, hybrid optimization solvers, and applications in transportation scheduling. He has contributed to projects such as the Next-Gen Lazy Clause Generation (NLCG) and sports scheduling optimization frameworks. Recent work spans neuro-symbolic AI explainability, circadian rhythm protocols, and rail dispatch algorithms. His articles demonstrate cross-disciplinary impact across computer science, operations research, and biomedical research. Received the OPTIMA Education Award (2022) and recognition for SETU results (2020) Contributed to 6 peer-reviewed publications since 2017, with 15+ citations Advising roles include collaborative projects on sports fixtures and constraint solver development. Active in organizing international conferences like CPAIOR and AAAI, and maintains visiting researcher ties with Uppsala University.

Anton J. Wijsمشاهده پروفایل

دانشیار

• Parallel Software Development
• Formal Verification
• Model Checking
• +۴ مورد دیگر

Anton J. Wijs is an Associate Professor at the Eindhoven University of Technology (TU/e) , affiliated with the Model-Driven Software Engineering group within the Department of Software Engineering and Technology . His research focuses on parallel software development and leveraging parallelism to enhance formal verification techniques. He holds leadership roles as a Board Member of the European Association for Programming Languages and Systems (EAPLS) and a member of the Steering Committee of ETAPS. Academic Background: Wijs earned his PhD in Computer Science from VU Amsterdam (2007), followed by postdoc positions at INRIA (France), TU/e, and RWTH Aachen University (Germany). He transitioned to an Assistant Professor role at TU/e in 2015 and became an Associate Professor in 2023. Research Interests: His work emphasizes scalable verification methodologies using GPUs, formal analysis of concurrent systems, and tools like mCRL2 . He collaborates with industry partners such as ASML and Codeplay Software to bridge academic research with practical applications. Awards & Grants: Notable achievements include the Best Student Paper Award (FACS 2017) , the Amazon Research Award (2022) , and an NWO grant for GPU-accelerated state space analysis. He co-led the GEARS project (2017–2022) , focusing on efficient parallel model checking. Teaching: Wijs teaches courses on Programming , Program Verification Techniques , and Digital Twins of Medical Devices . He actively supervises students and contributes to international conferences as a program chair and reviewer.

• Formal Methods
• Model-Based Testing
• Cyber-Physical Systems
• +۵ مورد دیگر

Paolo Arcaini is a Project Associate Professor at the National Institute of Informatics (2019–present) and previously held academic positions at Charles University (Assistant Professor, 2015–2018) and the University of Bergamo (Postdoctoral Fellow). His research spans formal methods, model-based testing, and quantum software engineering, with a focus on cyber-physical systems, autonomous vehicles, and machine learning validation. He has received multiple best paper awards, including at SSBSE (2021), AITest (2020), and Mutation (2017). Educational Background: PhD in Computer Science, University of Milan (2010–2012, advisor: Elvinia Riccobene) Postdoctoral Fellow, CNR-IDPA (2013, advisor: Gloria Bordogna) Research Interests: Dr. Arcaini's work bridges abstract state machine modeling, hybrid system falsification, and quantum program testing. His recent projects address robustness in neural networks, search-based scenario generation for autonomous systems, and quantum annealing applications to test case optimization. Article Trends: His publications demonstrate expertise in hybrid system falsification using Monte Carlo tree search mutation analysis for regular expressions and neural networks quantum software testing via combinatorial and search-based methods tool development for NuSMV/Yices integration and quantum noise mitigation multi-objective optimization for autonomous delivery systems formal methods in medical software validation Scientific Recognition: Distinguished Paper Award, SSBSE 2021 Best Paper Award, AITest 2020 Best Paper Award, Mutation 2017 Teaching: He has taught courses on Formal Methods for Cyber-Physical Systems (NII 2019) Model-Based Testing (Charles University 2015–2018) Java programming labs and advanced topics Tool Development: Dr. Arcaini has created several tools including MutRex/TearRex for regular expression testing NuSeen (Eclipse-based NuSMV environment) ATGT Boolean for SAT-based testing CRAG for combinatorial road geometry generation QUIET for quantum noise mitigation BQTmizer for quantum test case optimization