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

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

Sylwia Stachowiakمشاهده پروفایل

استادیار

• Cryptography
• Cryptanalysis
• Network Security
• +۳ مورد دیگر

Sylwia Stachowiak serves as an Assistant Professor at SWPS University within the Faculty of Design in Warsaw and the Department of Mathematics and Logic. Holding a Doctor of Engineering degree in information and communication technology, she bridges theoretical computer science with practical security applications through her research and teaching. Her research specializes in formal methods for analyzing computer network security systems, with particular focus on cryptanalysis of symmetric ciphers using computational techniques for solving Boolean satisfiability problems (SAT). This work represents a critical intersection of theoretical mathematics and real-world security solutions, emphasizing rigorous mathematical approaches to vulnerability assessment. Dr. Stachowiak contributed to a significant 2020 National Centre for Research and Development project (POIR.01.01.01-00-0829/18-00) conducted with the Institute of Computer Science of the Polish Academy of Sciences, developing secure communication protocols for the Warsaw Stock Exchange. Her teaching portfolio comprehensively covers foundational computer science subjects including cryptography and number theory, logic and set theory, discrete mathematics, and algorithms and data structures, reflecting her dual expertise in mathematics and computer science.

Javier Esparzaمشاهده پروفایل

استاد

• Theoretical Computer Science
• Software Verification
• Model Checking
• +۹ مورد دیگر

Javier Esparza is a Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich (TUM), Germany. He has held academic positions at several prestigious institutions including the University of Stuttgart, University of Edinburgh, and Technische Universität München since 1990. His work focuses on theoretical computer science with applications in software verification and formal methods. His educational background includes: M.S. in (Theoretical) Physics from the University of Zaragoza (Spain, 1987) Ph.D. in Computer Science from the University of Zaragoza (Spain, 1990) Habilitation in Computer Science from the University of Hildesheim (Germany, 1994) Professor Esparza's research interests span multiple areas of theoretical computer science and formal methods. He has made significant contributions to the fields of software verification, model checking, and Petri nets. His work on algorithms for the design and verification of reactive and distributed systems has been particularly influential. He has developed theoretical foundations and practical tools for analyzing systems with infinitely many states, pushing the boundaries of what can be formally verified. His research on formal models for distributed systems, particularly Petri nets and process algebras, has provided new insights into concurrency theory. Additionally, his work on the analysis of probabilistic systems and applications of linear and constraint programming to verification problems has opened new avenues for research. His recent publications demonstrate a continued focus on fundamental problems in verification and theoretical computer science, with particular emphasis on population protocols, model checking techniques, and theoretical foundations of distributed computing. His work bridges the gap between theoretical insights and practical applications in software reliability. His scientific achievements have been recognized with several prestigious awards: Doctor honoris causa in Informatics, Masaryk University (2009) Dissertation prize, University of Zaragoza (1990) TeachInf Award for best Bachelor course at TU München (2009) TeachInf Award for best Master course at TU München (2010) Diploma for excellent Teaching, TU München (2011) Member of Academia Europaea (2011) Professor Esparza has successfully advised numerous PhD students who have gone on to make their own significant contributions to computer science. His research has been consistently supported by competitive grants from major funding bodies including the German Research Council (DFG), the British Engineering and Physical Sciences Research Council, and the European Union. His research projects have often involved international collaborations, reflecting the global recognition of his work. He leads a vibrant research group at TUM focused on theoretical computer science and verification. The group has developed several influential software tools including Rabinizer, Peregrine, Owl, and Strix, which are widely used in both academia and industry for verification tasks. His group maintains strong collaborations with research institutions worldwide, particularly in Europe.

Danny Bøgsted Poulsenمشاهده پروفایل

دانشیار

• Formal Methods
• Model Checking
• Cyber-Physical Systems
• +۳ مورد دیگر

Danny Bøgsted Poulsen is an Associate Professor at the Department of Computer Science, Aalborg University, affiliated with The Technical Faculty of IT and Design. His research focuses on formal methods, model checking, and cyber-physical systems with applications in security analysis and programming languages. He contributes to projects like BEO-COVID (2020–2020) and IDEA4CPS (2011–2015), which explore decision support tools and foundational cyber-physical systems. His academic background includes advanced work in formal verification and statistical model checking. Key research interests include: Formal methods for string constraints and SMT solvers Statistical analysis of security-critical systems Modelling protocols like DTLS and attack-defense scenarios Applications of formal methods in education and public health Recent work highlights include developing SMTQuery for benchmark analysis, statistical evaluation of bit-flip vulnerabilities, and leveraging large language models for educational feedback. His research outputs span over 36 publications across journals and conferences, with active contributions to UPPAAL tool development and open datasets for reproducibility. Poulsen collaborates internationally on projects involving formal verification of embedded systems and cybersecurity protocols. His work bridges theoretical computer science with practical applications in safety-critical systems.

David G. Mitchellمشاهده پروفایل

دانشیار

• Propositional Satisfiability
• Constraint Satisfaction Problems (CSP)
• Formal Verification
• +۳ مورد دیگر

David G. Mitchell is an Associate Professor in the Department of Computing Science at Simon Fraser University (SFU). He is part of the School of Computing Science and affiliated with the Computational Logic Laboratory. His research focuses on propositional satisfiability (SAT) and finite domain constraint satisfaction (CSP), exploring their complexity and practical algorithm design for applications in formal verification and related tasks. Education : Ph.D., Computer Science, University of Toronto, 2002 M.Sc., Computing Science, Simon Fraser University, 1993 B.Sc., Cognitive Science and Artificial Intelligence, University of Toronto, 1989 Research Interests : Mitchell's work bridges mathematical logic and computer science, emphasizing SAT-based problem solving, constraint modeling languages, and automated reasoning. His contributions include advancements in clause learning, resolution complexity, and declarative programming frameworks for solving NP problems. He has developed tools like MXC and Enfragmo, which apply SAT techniques to real-world applications. Students : Mitchell has advised numerous graduate students, including current PhD candidates Mona Mehdizadeh and Sima Jamali, and past advisees such as Sahba Etezad, Heng Liu, and Faraz Hach. His students' work spans algorithm optimization, constraint satisfaction, and formal verification. Labs/Teams : He is a member of the Computational Logic Laboratory at SFU, contributing to research in logic-based problem-solving and algorithm development.

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.

Yadi Zhongمشاهده پروفایل

استادیار

• Applied Cryptography
• Cryptology
• Algebraic Cryptanalysis
• +۷ مورد دیگر

Yadi Zhong is an Assistant Professor in the Department of Electrical and Computer Engineering at Auburn University, part of the College of Engineering. He holds both a Ph.D. and a Bachelor of Engineering from the same institution, reflecting a strong academic foundation in electrical and computer engineering disciplines. His research focuses on critical areas in modern cybersecurity and computational logic, including: Applied Cryptography and Cryptology Algebraic Cryptanalysis Privacy-Enhancing Cryptography Boolean Satisfiability (SAT) Solving VLSI Testing and Design for Testability These interests position his work at the intersection of hardware security, formal methods, and cryptographic protocol analysis, contributing to secure and reliable computing systems. While no recent publications are listed in the provided text, the research areas suggest a focus on both theoretical underpinnings and practical applications in secure integrated circuits and privacy-preserving technologies. There are no scientific awards mentioned in the available information. Dr. Zhong advises students within the Electrical and Computer Engineering graduate program, though specific advisees are not listed. There is no mention of externally funded grants or sponsored research projects in the current profile. He is likely involved in research labs related to cybersecurity, hardware security, or VLSI design, though specific lab affiliations are not stated.

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

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

Ashutosh Raiمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Parameterized Algorithms
• Fixed-Parameter Tractability
• +۷ مورد دیگر

Ashutosh Rai is an Assistant Professor in the Department of Mathematics at the Indian Institute of Technology Delhi (IIT Delhi). He previously served as an Assistant Professor in the Computer Science Department at IIIT Delhi. His academic journey includes postdoctoral research at Charles University in Prague and the Hong Kong Polytechnic University. He completed his PhD and Master’s at the Institute of Mathematical Sciences (IMSc), Chennai, under the supervision of Prof. Saket Saurabh and Prof. Venkatesh Raman. His research focuses on Theoretical Computer Science, especially parameterized algorithms, fixed-parameter tractability, kernelization, and the complexity of NP-complete problems. His work bridges classical and parameterized complexity, exploring hardness and algorithmic solutions. The 15 most recent publications highlight consistent contributions to parameterized complexity, graph editing, coloring, and optimization problems. His research spans journals like Algorithmica , SIAM Journal on Discrete Mathematics , and Theoretical Computer Science , and top conferences including ICALP, IPEC, ESA, and MFCS. Key themes include kernelization, approximation in parameterized settings, and structural graph problems. He has taught courses such as Analysis and Design of Algorithms, Theory of Computation, Parameterized Algorithms, Operating Systems, and Combinatorics at IIT Delhi, IIIT Delhi, and Charles University. He has also mentored students and collaborated extensively with leading researchers in the field. Email: ashutosh.rai@maths.iitd.ac.in

Sharon Shohamمشاهده پروفایل

استاد

• formal verification
• program analysis
• model checking
• +۴ مورد دیگر

Sharon Shoham is a Professor at the School of Computer Science, Tel Aviv University, specializing in formal verification and program analysis. She leads research under a 5-year ERC grant on supervised verification of infinite-state systems and mentors PhD students, postdocs, and visiting scholars. Research Interests : Her work focuses on formal verification, program analysis, model checking, and verification of distributed systems. She explores inductive invariants, quantifier instantiation, and abstract interpretation. Recent Publications (2023-2025) highlight advancements in liveness properties , hyperproperty verification , quantifier elimination , and distributed protocol verification , often leveraging first-order logic and constraint-solving techniques. Scientific Awards : Distinguished paper awards at POPL 2025 and POPL 2024 Best paper and best student paper awards at DISC 2024, CAV 2019, and DISC 2018 Best paper awards at VMCAI 2016, ATVA 2009, SPIN'08, SAS'07, and FMCAD'07 Advising & Grants : Actively recruits strong PhD students and postdocs under an ERC grant. Collaborates with institutions like Technion and Tel Aviv University on verification frameworks and tools such as Ivy and mypyvy.

• Theoretical Computer Science
• Computational Complexity
• Approximation Algorithms
• +۶ مورد دیگر

Per Austrin is a Lecturer at the Royal Institute of Technology (KTH) in the Department of Theoretical Computer Science. He has been actively involved in teaching courses such as Algorithms and Complexity (DD2352) , Advanced Algorithms (DD2440) , and Problem Solving and Programming Under Pressure (DD2458) , serving as examiner and course coordinator for several programs. His research focuses on the foundations of computational complexity, approximation algorithms, and cryptographic barriers. Key areas include hardness of approximation for constraint satisfaction problems (CSPs), combinatorial optimization, and theoretical limits in cryptography and coding theory. His work often intersects with probabilistic methods and quantum computing challenges. Recent publications highlight his contributions to understanding lower bounds in optimization problems, inapproximability thresholds, and complexity in structured combinatorial problems. Detailed information about his work can be found on his personal website: Per Austrin's Website .

Jussi Rintanenمشاهده پروفایل

دانشیار

• Artificial Intelligence
• Automated Planning
• Constraint-Based Search
• +۳ مورد دیگر

Jussi Rintanen is an Associate Professor at the Department of Computer Science , Aalto University . He is an internationally leading researcher in constraint-based planning and decision-making , with a focus on applying AI technologies to automating software production and synthesis of intelligent systems . Helsinki University of Technology (Doctoral Degree, 1997) Albert-Ludwigs-University Freiburg (Venia Legendi, 2005) National ICT Australia / Australian National University (Academic Positions) His research spans automated planning , SAT solving , temporal planning , and constraint-based search methods . Recent work highlights symmetry-breaking constraints , partial observability planning , and acyclicity encodings in SAT frameworks. The 15 most recent articles reflect trends in AI planning , graph algorithms , and formal verification , with applications in software synthesis , temporal reasoning , and uncertainty handling . His methodologies integrate integer programming , SMT encodings , and propositional logic .

• Constraint Programming
• Boolean Satisfiability
• Artificial Intelligence
• +۵ مورد دیگر

Steve Prestwich is a Lecturer at the School of Computer Science and Information Technology, University College Cork. He specializes in Artificial Intelligence, Data Analytics, and Algorithmics, with research interests spanning constraint programming, Boolean satisfiability, and hybrid search methods. Education: BA (Hons) Mathematics from University of Oxford, MSc and PhD in Computer Science from University of Manchester. Research Focus: His work integrates constraint programming, SAT solving, and metaheuristics for optimization under uncertainty, with applications in inventory control, protein design, and stochastic modeling. Awards: Runner-up, Constraint Modelling Challenge Bronze medal, SAT'05 Solver Competition

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.