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

Christoph Weidenbachمشاهده پروفایل

استاد مدعو

• Automated Deduction
• Decision Procedures
• Theorem Proving
• +۵ مورد دیگر

Christoph Weidenbach is an Adjunct Professor in the Computer Science department at Saarland University, Germany, and the head of the research group Automation of Logic at the Max-Planck-Institute for Informatics. His work focuses on automated deduction, decision procedures, and theorem proving, particularly in the context of first-order logic and decidable fragments. He has been actively involved in the development of automated verification tools and techniques, including SAT solvers and SMT frameworks. Education: Diplom (1989), PhD (1996), Habilitation (2000), all in Computer Science at Saarland University. Current Roles: Research Leader (Automation of Logic group, MPI) since 2005; Adjunct Professor (Saarland University) since 2007. Past Roles: Research Coordinator (MPI, 1999-2005); IT Manager (GM Powertrain Europe, 1991-1999). His recent publications highlight trends in automated deduction, formal verification, and constraint solving, with applications in linear arithmetic, network protocols, and semantic web reasoning. He has also contributed to the theoretical foundations of superposition calculi and SCL(FOL) extensions.

• Automated Reasoning
• Constraint Programming
• Answer-Set Programming
• +۷ مورد دیگر

Ilkka Niemelä is a Professor of Computer Science at Aalto University's School of Science. He has held leadership roles including Head of the Laboratory for Theoretical Computer Science at Helsinki University of Technology, Chair of the Degree Program in Computer Science and Engineering, and Dean of Aalto University's School of Science. His research focuses on automated reasoning and constraint programming for solving computational problems. His work spans key areas in computational logic, including answer-set programming, non-monotonic reasoning, bounded model checking, and parity reasoning. He has explored applications in formal verification, optimization, and system design, with publications reflecting interdisciplinary contributions to artificial intelligence and theoretical computer science. Scientific awards and honors include: Superior of the year at Helsinki University of Technology (2007) Annual dissertation award from the Finnish Society for Computer Science (1993) Knight, First Class, of the Order of the White Rose of Finland (2015) 20 Year Test of Time Paper Award (2016) EurAI Fellow (2013) His research group has pioneered methods in answer-set programming and bounded model checking, with recent publications addressing program transformations, timed automata, and parity games. Niemelä has also served in administrative roles such as Vice President and Provost at Aalto University, contributing to academic governance and education.

• SMT Solving
• Formal Verification
• Logical Frameworks
• +۷ مورد دیگر

Hans-Jörg Schurr is a postdoctoral researcher in Computer Science at the University of Iowa's College of Engineering, focusing on SMT solving and formal verification. He contributes to the cvc5 SMT solver and leads development of the SMT-LIB benchmark library alongside Clark Barrett, Mathias Preiner, and Pascal Fontaine. Research Focus: Proof certificates, logical frameworks, and expressive type systems for SMT solvers Tools: Eunoia language (combining LFSC and Alethe), veriT SMT solver Collaborations: Active with the Alethe proof format specification team and SMT competition organizers Scientific Awards: Best Paper by a Junior Researcher (PxTP 2021) Teaching: Provided lectures at University of Iowa (Programming Language Concepts, Logic in Computer Science, Algorithms) and Polytech Nancy (Software Engineering, Distributed Programming). Recognized by graduating class of 2023 and received Thank-a-Teacher Letter.

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

Cayden Codelمشاهده پروفایل

پژوهشگر

• Programming Languages
• Formal Verification
• Satisfiability (SAT) Solvers
• +۳ مورد دیگر

Cayden Codel is a Researcher at Carnegie Mellon University's Computer Science Department , focusing on programming languages and formal verification. His work bridges theoretical logic with practical applications in automated reasoning and constraint solving. Research Interests: Programming Languages, Formal Verification, Satisfiability (SAT) Solvers, Satisfiability Modulo Theories (SMT), Automated Theorem Proving, Machine Learning Institution: Carnegie Mellon University (CMU) His publications emphasize formal verification for logical systems, SMT/SAT solvers , and reinforcement learning applications. Articles from 2024-2019 reveal a trajectory from foundational logic to real-world dataset design (e.g., Minecraft-based AI research). Thesis Advisors: Marijn Heule, Jeremy Avigad Contact: ccodel@andrew.cmu.edu

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.

• Automated Reasoning
• Automated Verification
• Formal Methods
• +۱۲ مورد دیگر

Dr Martin Nyx Brain is a researcher at City St George's, University of London, affiliated with the Department of Computing within the College of Engineering, Science and Technology. His work focuses on advancing automated reasoning and formal verification techniques for ensuring software safety and security, particularly in critical low-level and embedded systems. His research spans core areas in formal methods, including the development and application of SAT and SMT solvers. He is a co-author of the SMT-LIB standard for floating-point arithmetic and has contributed to the CVC4 solver's floating-point theory, demonstrating deep expertise in logical foundations and solver technology. He applies abstract interpretation, symbolic execution, and deductive verification to analyze systems written in C, C++, and Ada, using tools such as SPARK and CBMC/CPROVER. Dr Brain’s work bridges theoretical logic and practical software verification, with strong relevance to cybersecurity and safety-critical systems. His research interests include formal verification, static analysis, programming language semantics, and automated theorem proving. While no specific publications or awards are listed in the provided text, his technical contributions suggest an active research trajectory in the intersection of programming languages, logic, and software reliability. He is involved in tool development and standardization efforts that are influential in the formal methods community. There is no mention of student supervision, grants, or educational background in the available information. However, his role implies engagement with research teams or labs focused on software verification and automated reasoning, potentially contributing to collaborative projects in formal methods and secure systems engineering.

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.

Paul Attieمشاهده پروفایل

استاد

• Software Engineering
• Formal Methods
• Distributed Computing
• +۳ مورد دیگر

Paul Attie is a Professor of Computer and Cybersciences Sciences at Augusta University's School of Computer and Cyber Sciences, Department of Computer Science. He holds a PhD in Computer Science from the University of Texas at Austin (1995). His research focuses on software engineering, formal methods, distributed computing, algorithms, and theory of computation. Education: PhD in Computer Science from University of Texas at Austin (1995). Research Interests : - Software Engineering: Focuses on program repair, formal verification, and correctness. - Formal Methods: Develops frameworks for specification construction and automated reasoning using SMT solvers. - Distributed Computing: Explores deadlock-free systems, choreographies, and scalable implementations. - Algorithms: Investigates succinct representation of concurrent programs and SAT-based repair techniques. Teaching : Recently taught courses like CSCI 8940 (Dissertation Research), CSCI 4100 (Algorithms), and CSCI 8320 (Verification of Software). Service & Leadership : - Committee Member: Tenure and Promotion Committee (2021–Present) - Chair: Pamplin Dean Search Committee (2020–Present) - Reviewer: ACM Symposium on Principles of Distributed Computing (2022–Present) His work bridges theoretical foundations with practical applications in distributed systems and formal verification.

Jacob Howeمشاهده پروفایل

مدرس ارشد

• Machine Learning
• Mathematical Logic
• Declarative Programming
• +۵ مورد دیگر

Dr. Jacob Howe is a Senior Lecturer in the Department of Computer Science at City, University of London. He holds a PhD in Computer Science (University of St Andrews, 1998), an MSc in Philosophy & History of Science (University of London, 1995), and a BSc in Mathematics (University of Warwick, 1994). His research focuses on static program analysis, formal methods, and their applications in software verification and security. Specific interests include abstract interpretation, constraint solving, and computational geometry. Dr. Howe has led research projects such as the EPSRC-funded VIP project on Verification with Integer Polyhedra. His work bridges theoretical foundations and practical applications, emphasizing geometrical and logical techniques in program analysis. Recent contributions include advancements in widening for polyhedral analysis, neural network interpretability, and cybersecurity applications. He has served on program committees for conferences like LOPSTR, WLPE, and PPDP, reflecting his academic leadership. Dr. Howe is also a Course Director for BSc and MSci Computer Science programs, underscoring his commitment to education and curriculum development.

• Theorem Proving
• Decision Procedures
• SAT/SMT Solving
• +۱۳ مورد دیگر

Philipp Ruemmer is a Professor of Theoretical Computer Science at the University of Regensburg since 2022, and a Senior Lecturer at the Department of Information Technology, Uppsala University, since 2018. He previously held roles as Associate Professor (2018-2022), Researcher (Assistant Professor, 2011-2018), and other academic positions. His research interests span theorem proving, decision procedures, SAT/SMT solving, program analysis for Java/C/C++/Simulink, verification of timed/parameterised/concurrent systems, model checking, automatic test case generation, and integrating machine learning with formal verification methods. Scientific awards include the Oscarspris (2013) for program correctness, the SAP Award for best Computer Science degree (2005), and an award by Bosch Telecom (1998). He has led and participated in numerous research grants , such as the UPDATE project (2020-2024) and several Swedish Research Council (VR) and Microsoft grants. He is the author of tools like iPrincess (interpolating theorem prover), Princess (Presburger arithmetic solver), Seneschal (ranking function generator), and KeYmaera (hybrid systems verification). His work is integral to projects such as WebSec and CERTAINTY in embedded systems and security.

Katalin Fazekasمشاهده پروفایل

استادیار

• Formal Verification
• SAT Solving
• SMT Solving
• +۳ مورد دیگر

Katalin Fazekas is an Assistant Professor in the Formal Methods in Systems Engineering group at TU Wien. Her research focuses on improving incremental reasoning methods for SAT/SMT solvers and advancing formal verification techniques. She holds a PhD from the Johannes Kepler University Linz, supervised by Armin Biere. Education: PhD in Logical Methods in Computer Science (LogiCS), JKU Linz (2016–2021) Research Interests: Incremental SAT/SMT solving Formal verification of distributed systems Algorithm optimization for constraint solving Automated reasoning and proof generation Key Projects: INCR (2021–2024) : Austrian Science Fund (FWF) project on scalable verification via incremental reasoning REVEAL-AI and SLIM : Collaborative projects on AI-driven formal methods Awards: Hertha Firnberg Fellowship (FWF), 2021–2024 Tools Developed: CaDiCaL 2.0: Advanced SAT solver QSM: Quantified symmetric minimization framework for distributed protocols Lab/Affiliations: FORSYTE research group, TU Wien.

• Formal methods
• Formal verification
• Model checking
• +۸ مورد دیگر

Summary Alan J. Hu is a Professor in the Department of Computer Science at the University of British Columbia (UBC), affiliated with the Faculty of Science. His primary research interests include formal methods, formal verification, model checking, and software/hardware co-design. He leads research in areas such as post-silicon validation, cloud resource scheduling, and concurrency verification. Hu teaches courses like CPSC 513 (Formal Verification) and CPSC 320 (Algorithm Design). Education & Roles: Ph.D. in Computer Science (Stanford University), current roles include supervision of graduate students (e.g., Malte Schwerin, Stuart Hoad) and leadership in research groups like ICICS and CAIDA. Research Contributions: Key projects include BackSpace (post-silicon debug framework), MonoSAT (SMT solver), and contributions to formal verification of embedded systems. His work on cloud resource scheduling (e.g., Gridiron, Cospot) addresses network bandwidth guarantees in datacenters. Awards & Recognition: Recipient of the IEEE Outstanding Service Award, IBM Faculty Award, and UBC CS Teaching Award. His research is supported by industry (Intel, Microsoft) and grants (NSERC, SRC). Labs & Collaborations: Active in UBC's Institute for Computing, Information and Cognitive Systems (ICICS) and the CAIDA lab for AI-driven decision-making.

Holger H. Hoosمشاهده پروفایل

استاد

• Algorithmics
• Bioinformatics
• Computational Intelligence
• +۹ مورد دیگر

Holger H. Hoos is a Professor at the University of British Columbia's Computer Science Department, affiliated with the Institute for Computational Intelligence and Cognitive Systems (ICICS) and the Peter-Wall Institute for Advanced Studies. As of 2017, his primary affiliation shifted to Leiden University (Netherlands), though he remains connected to UBC. His research focuses on algorithmics, bioinformatics, computational intelligence, and computer music, with significant contributions to stochastic local search, empirical algorithmics, and SAT solving. Education: Ph.D. (Dr.rer.nat) in Computer Science from TU Darmstadt (1998), postdoctoral fellow at UBC. He has led the BETA Lab and SALIERI Project, exploring biomolecular structure prediction and music algorithms. Research interests span stochastic algorithms, RNA structure prediction, automated algorithm configuration, and interdisciplinary applications like flow cytometry analysis. His work bridges theoretical foundations with empirical methods, emphasizing practical problem-solving. Awards include the AAAI Fellowship, multiple best paper awards (GECCO 2020, IJCAI-JAIR 2010), and leadership roles in conferences like AAAI and LION. He has advised over 30 students, contributing to impactful projects in bioinformatics and AI. Labs/Teams: Founder of the BETA Lab (Bioinformatics, Theoretical and Empirical Algorithms), member of the Laboratory for Computational Intelligence (LCI), and collaborator on SALIERI (Computer Music).

Joan Espasa Arxerمشاهده پروفایل

مدرس

• Automated Planning
• Artificial Intelligence
• Constraint Programming
• +۵ مورد دیگر

Dr Joan Espasa Arxer is a Lecturer in the School of Computer Science at the University of St Andrews, specializing in the AI group. His research focuses on Automated Planning, Constraint Programming, and applications of logic in computer science. He holds a position in the Department of Computer Science and teaches courses such as CS4402 - Constraint Programming and CS4303 - Videogames, while supervising projects across various academic levels. Research interests include Classical and Numeric AI Planning, Boolean Satisfiability (SAT), Satisfiability Modulo Theories (SMT), Planning as Satisfiability, Constraint Programming, and Automated reformulation of models. His work addresses challenges in planning domain modeling, benchmark instance generation, and cross-paradigm problem solving. Recent publications explore lifted planning with constraints, international planning competitions, and modeling pipelines in AI. He collaborates on tools like the 2023 International Planning Competition dataset and frameworks for generating benchmark instances. Advises PhD students Mustafa Abdelwahed and Carla Davesa Sureda. Engages in community outreach through events like 'Doors Open @ Computer Science' and contributes to open-source tools for planning and constraint satisfaction.