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

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

استاد

• Computer Science
• Formal Verification
• Probabilistic Systems
• +۵ مورد دیگر

Stefan Kiefer is a Professor of Computer Science at the University of Oxford and Tutorial Fellow in Computer Science at St John's College. He holds a Dr. rer. nat. from TU München (2009) and has held postdoctoral positions at Oxford since 2009. His research focuses on formal verification, probabilistic models, and automata theory, with applications in program analysis and infinite-state systems. Kiefer has been recognized with a Royal Society University Research Fellowship (2013–2021) and is a member of the EPSRC Peer Review College. Research Interests: Verification, probabilistic systems, infinite-state systems, automata theory, numerical analysis, and linear algebra. His work addresses challenges in analyzing probabilistic systems to ensure correctness in safety-critical systems. Teaching: Leads tutorials in Probability and Computing, Linear Algebra, and supervises DPhil students. Current advisee: Syyeda Zainab Fatmi. Past students include Ines Marusic, Cas Widdershoven, and Oscar Darwin. Grants & Awards: EPSRC grants, Royal Society funding, and active roles in professional service, including co-chairing FoSSaCS'21 and speaking at conferences like ICALP and Highlights. Publications: Over 50 papers on topics like Markov decision processes, automata minimization, and probabilistic verification, published in venues such as ICALP, CONCUR, and the Journal of the ACM.

• Program Verification
• Invariant Generation
• Interpolation in SMT
• +۳ مورد دیگر

Jochen Hoenicke is a researcher at the University of Freiburg's Department of Computer Science, focusing on program verification, invariant generation, and interpolation in SMT. His work spans sequential and concurrent programs, timed automata, and model-checking. He is affiliated with the university's software engineering and formal methods research groups. His research interests include Program Verification Invariant Generation Interpolation in SMT Timed Automata Duration Calculus Model-Checking He has contributed to projects like SmtInterpol, Ultimate, VerisoftXT, and AVACS, and has taught courses such as Cyber-Physical Systems Software Engineering Program Verification Automata Theory Decision Procedures His publications highlight trends in formal verification, SMT solvers, and real-time systems analysis. He has served on the program committee of Boogie 2012 and is involved in software model checking and requirements analysis.

Lila Kariمشاهده پروفایل

استاد

• Biodiversity informatics
• Data science
• Machine learning
• +۶ مورد دیگر

Lila Kari is a Professor and Cheriton Faculty Fellow at the School of Computer Science , part of the University of Waterloo in Ontario, Canada. Her research focuses on Biodiversity informatics , data science , and machine learning applications in comparative genomics and metagenomics , particularly for analyzing genomic signatures through Chaos Game Representation (CGR) and alignment-free methods. 2023 : Environment and taxonomy shape genomic signatures of extremophiles 2020 : Machine learning for rapid pathogen classification during pandemics 2019 : Ultrafast DNA sequence classification with ML-DSP 2016 : Additive genomic signatures for enhanced taxonomic differentiation 2015 : Mapping genomic signature spaces for molecular distance analysis 2009-2005 : Foundational work in DNA language theory and computational biology Her work has been instrumental in developing composite DNA signatures that combine nuclear and organellar genomic data for improved species differentiation, and assembled DNA signatures that enable analysis from fragmented sequencing data. She contributes to global initiatives like BIOSCAN for biodiversity surveillance and has created tools such as MLDSP-GUI for accessible DNA sequence analysis.

Neha Lodhaمشاهده پروفایل

پژوهشگر

• Algorithms and Complexity
• Graph Theory
• SAT/SMT Solving
• +۳ مورد دیگر

Neha Lodha is a researcher in the Institut für Logic and Computation at TU Wien. Her work focuses on algorithms, complexity theory, and SAT/SMT solving techniques. She has contributed to graph encodings for combinatorial optimization problems and parameterized complexity analysis. Key research areas include SAT-based approaches for graph decomposition (branchwidth, treewidth), SMT methods for fractional hypertree width, and algorithm engineering for constraint satisfaction problems. Her work bridges theoretical foundations with practical algorithmic implementations. Notably, she received the 2016 SAT Conference Best Student Paper Award for her work on SAT encodings of branchwidth. This research was later expanded into a 2019 ACM Transactions publication. Her publications span conferences like IJCAI, CP, and SAT, with a focus on advancing the theoretical and practical aspects of computational logic and algorithm design.

• Formal Methods
• Program Analysis
• Verification
• +۹ مورد دیگر

Florian Zuleger is an Associate Professor at TU Wien's Department of Formal Methods in Systems Engineering (E192-04). He has a 100% research focus and serves as Curriculum Coordinator for the Master’s program in Verification and Automated Reasoning. His work emphasizes automated methods for termination analysis, resource-bound estimation, verification of programs with dynamic data structures, parameterized systems, and automated feedback for introductory programming tasks. He has led projects funded by the European Commission (2024–2027), Austrian Science Fund (FWF), Amazon Research Awards, and Vienna Science and Technology Fund. Research Interests: Automated Program Verification Formal Methods for Concurrent Systems Separation Logic and Decision Procedures Resource and Complexity Analysis Parameterized Model Checking Inductive Logic in Verification Grants & Advising: Zuleger’s recent grants explore verification of safety-critical applications and automated cost analysis. He has advised numerous students on topics ranging from verified data structures to fault-tolerant algorithms. His projects include collaboration with Amazon, the European Commission, and FWF. Labs/Teams: Involved with the LogiCS Research Group, focusing on logical methods in computer science, and contributes to tool development (e.g., ATLAS, SpecBMC, SL-COMP competitions).

Luca Acetoمشاهده پروفایل

استاد

• Concurrency Theory
• Process Algebra
• Structural Operational Semantics
• +۳ مورد دیگر

Luca Aceto is a Full Professor at Reykjavik University's Department of Computer Science since 2004. He has held leadership roles, including President of the European Association for Theoretical Computer Science (2012–present) and Head of the Department of Computer Science at Reykjavik University (2007). His research focuses on concurrency theory, logic in computer science, and formal verification. Aceto has received notable awards, including the Reykjavik University Research Award (2012) and induction into the Icelandic Academy of Sciences (2012). Research Interests: Concurrency theory, process algebra, structural operational semantics, modal and temporal logics, and computational complexity of verification problems. Awards: Multiple teaching awards at Aalborg University, Distinguished Dissertation Award (1991), and leadership roles in prestigious academic organizations. Professional Activities: Over 60 program committee roles, co-chairing ICALP and CONCUR, and editorial board memberships. Aceto’s work bridges theoretical foundations with practical verification challenges, contributing to formal methods and concurrency theory. His publications span journals, conferences, and textbooks, including a widely adopted textbook on reactive systems.

• Distributed Algorithms
• Graph Algorithms
• Automata Theory
• +۳ مورد دیگر

Jan Studeny is a Visiting Professor at the Department of Computer Science, Aalto University. He holds a Doctor of Technology (Tekn. toht.) in Computer Science from Aalto University, awarded in November 2024. His research focuses on distributed algorithms, graph theory, automata theory, and parallel computing, with contributions to distributed systems and algorithm design. Recent work includes studies on localized problems in trees, MPC model optimizations, and automata-theoretic approaches to distributed graph problems. Education: Doctor of Technology (Tekn. toht.), Computer Science, Aalto University (2024) Research Interests: Jan's work emphasizes distributed computing challenges, graph algorithms, and automata theory. He explores efficient distributed algorithms for bounded-degree graphs, dynamic programming in trees, and locally checkable problems in rooted trees. His methodologies often integrate computational models and asymptotic analysis to solve complex algorithmic problems. Collaborations: Active in international conferences such as OPODIS and SPAA, with collaborations on distributed systems and theoretical computer science. Notable contributions include presentations at the Swedish Summer School in Computer Science (2022) and conference talks on locally checkable problems (2021). Labs & Teams: Engaged in collaborative research groups focused on distributed algorithms and graph theory, though specific lab affiliations are not detailed in the provided text.

Ricardo Almeidaمشاهده پروفایل

پژوهشگر ارشد

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

Ricardo Almeida is a Research Fellow at the School of Computing Science, University of Glasgow, working on the TransiT project. He applies Formal Methods to Digital Twinning for transport decarbonisation and previously worked on Formal Verification of the Morello hardware architecture at the University of Edinburgh. PhD in Tree Automata (University of Edinburgh) MSc in Kleene Algebra with Tests and Hoare Logic (University of Edinburgh) Industry experience at Keysight Technologies His research spans formal verification, bigraph theory, regular expressions, and formal languages. Recent work focuses on formalizing transport resilience, railway network modeling, and proof-theoretic security in hardware architectures. He supervises summer MSc CS+ students within the Formal Analysis, Theory & Algorithms research group.

Matiyasevich Yuriمشاهده پروفایل

استاد

• Diophantine equations
• Computability theory
• Algorithms
• +۱ مورد دیگر

Yuri Matiyasevich is a Russian mathematician and computer scientist affiliated with the Steklov Institute of Mathematics (Leningrad/St.Petersburg Branch) since 1980, where he serves as head of the Laboratory of Mathematical Logic. He also holds part-time professorships at Leningrad/St.Petersburg State University (since 2003) and previously at Polytechnical Institute (1980-1981). His research focuses on Diophantine equations, Computability theory, Algorithms, and Decidability problems. Full member, Russian Academy of Sciences (2008) Corresponding member, Bavarian Academy of Sciences (2007) Docteur Honoris Causa, Université Pierre et Marie Curie (2003) Humboldt Research Award (1997) Markov Prize, Academy of Sciences of the USSR (1980) His recent work involves computational approaches to Riemann's zeta function, probabilistic reformulations of graph theory problems, and algorithmic analysis of Diophantine representations. He has published extensively on connections between number theory and computational models, including studies on exponential Diophantine equations and their applications. Notable contributions include definitive solutions to Hilbert's Tenth Problem through Diophantine representations of recursively enumerable sets, and computational experiments supporting the Riemann Hypothesis. His publications span multiple languages and cover intersections between mathematical logic, number theory, and theoretical computer science.

Laura Sanitàمشاهده پروفایل

دانشیار

• Combinatorial Optimization
• Approximation Algorithms
• Network Design
• +۳ مورد دیگر

Laura Sanità is an Associate Professor in the Department of Computing Sciences at Bocconi University, Milan, Italy. Previously, she held positions at TU Eindhoven (2020–2022) and the University of Waterloo, Canada, where she was an Assistant Professor (2012–2017) and later Associate Professor (2017–2020). She earned a Bachelor’s and Master’s in Management Engineering from Università di Roma Tor Vergata (2003–2005), followed by a PhD in Operations Research from Università Sapienza di Roma (2009). Her postdoctoral work (2009–2011) was at EPFL’s Discrete Optimization Group. Her research focuses on Combinatorial Optimization , Approximation Algorithms , Network Design , and Algorithmic Game Theory . Key contributions include advancements in node connectivity augmentation, graph stabilization, and polytope diameter analysis. She has received prestigious awards such as the NWO-VIDI Award (Netherlands), NSERC Discovery Accelerator Supplements, and the Early Researcher Award (Ontario). Laura co-organizes the Bocconi Theory Day (May 2024) and serves on program committees for conferences like SODA, ESA, and IPCO. She is an Associate Editor for Mathematical Programming , Mathematics of Operations Research , and Operations Research Letters . Current advisees include PhD students Sean Kafer, Dylan Hyatt-Denesik, and Lucy Verbeck. Her work bridges theoretical foundations and practical applications, with notable publications in Mathematical Programming , SIAM Journal on Optimization , and Operations Research . Recent projects explore stabilization of capacitated matching games and iterative randomized rounding techniques for combinatorial problems.

• Decision Procedures
• Model Checking
• Formal Verification
• +۳ مورد دیگر

Marco Muñiz is a postdoctoral researcher at Aalborg University, specializing in formal verification, model checking, and automated theorem proving. His work focuses on the verification of software and real-time systems. Previously, he conducted research at the University of Freiburg, where he earned his Master's thesis in 2009. Muñiz's research interests include decision procedures, hybrid systems analysis, and formal methods for industrial standards compliance. He has contributed to the design of the Hybrid Model Checker SASET and collaborated with the Jahob Verification System for reasoning about tree and list data structures. Research Interests : Decision Procedures, Model Checking, Real-Time Systems, Automated Theorem Proving, Software Verification, Formal Verification of Industrial Systems. Teaching : Lectured on Model Checking at San Pablo University in Peru, and co-organized courses such as Model Checking SS11 and Algorithms Theory at the University of Freiburg. He has also conducted tutorials for software design and analysis in UML. Publications : His work spans formal verification of hybrid and timed automata, with notable contributions to quasi-dependent variables and clock reduction techniques. Recent publications emphasize applications in real-time systems and industrial compliance, showcasing his expertise in bridging theoretical formal methods with practical system validation. Awards : Microsoft Certified Solution Developer (Systems Engineer).

Graham Leighمشاهده پروفایل

استاد

• Mathematical Logic
• Proof Theory
• Modal Logic
• +۳ مورد دیگر

Graham Leigh is a Professor at the University of Gothenburg's Department of Philosophy and Logic. His primary research focuses on mathematical logic, proof theory, and modal logic, with significant contributions to cyclic proofs, theories of truth, and realisability semantics. He has collaborated extensively with researchers like Bahareh Afshari and Daichi Hayashi on foundational topics in logic and formal systems. Recent work emphasizes advancing proof systems for modal µ-calculus, exploring non-wellfounded proof structures, and analyzing truth theories within intuitionistic frameworks. His publications often bridge theoretical logic with applications in computer science, particularly in automated reasoning and program verification. Leigh's research also investigates the interplay between syntax and semantics in paradoxical contexts, contributing to the understanding of self-referential systems and their foundational limitations. He maintains an active publication record in top-tier journals and conferences such as the Journal of Symbolic Logic and Advances in Modal Logic .

• Artificial Intelligence
• Machine Learning
• Data Mining
• +۳ مورد دیگر

Jakub Neumann holds the following positions at the University of Gdańsk: Associate Professor, Division of Artificial Intelligence, Institute of Informatics, Faculty of Mathematics, Physics and Informatics Deputy Director of the Institute for Development and Promotion, Institute of Informatics Deputy Dean for Education, Faculty of Mathematics, Physics and Informatics His research interests include: Artificial Intelligence and Machine Learning (focus: imbalanced data classification using MapReduce) Autonomous Systems (path planning for autonomous surface vehicles) Educational Technology (XML-based tools for online course development) Theoretical Computer Science (tree automata and complexity) Publication trends: Neumann's work evolved from theoretical computer science (2002) to e-learning (2003-2007), autonomous systems (2012-2013), and recently big data and machine learning (2017-2018). His recent focus is on distributed computing solutions for imbalanced datasets, reflecting the growing importance of big data in AI applications.

• Algorithms on strings
• Small-space algorithms
• Data structures
• +۴ مورد دیگر

Tatiana Starikovskaya is an Assistant Professor in the Talgo team at the Computer Science Department of École normale supérieure (ENS Paris), France. Her work focuses on the design and analysis of algorithms for string processing, space-efficient computation, and complexity theory, with applications in bioinformatics and data security. Education : PhD in Mathematics (2013) and MSc in Mathematics (2009) from Lomonosov Moscow State University; MSc in Data Science (2009) from Moscow Institute of Physics and Technology and Yandex School of Data Analysis. Her research explores the intersection of algorithm theory and practical applications, particularly in streaming models , probabilistic text indexing , and clustering of sequence data . Key themes include handling wildcards , k-mismatch problems , and edit distance under space constraints. Current projects include PARSe (ANR-20-CE48-0001) , aiming to develop ultra-efficient algorithms for noisy string data, and AlgoriDAM (ANR-19-CE48-0016) , focusing on algorithmic theory for modern data models. She co-supervises PhD students Gabriel Bathie and T. El Ghazi, with collaborations spanning institutions like University of Wrocław and IRISA. She has served on program committees for major conferences (STACS, ESA, ICALP, CPM) and organized the CPM Summer School (2023) and New Horizons of Stringology (2024) workshop at Cirm. Teaching roles include courses at ENS Paris (Algorithmique, Programming for Non-CS Students) and Higher School of Economics (Moscow).

• Logic
• Well Quasi Orders
• Verification
• +۶ مورد دیگر

Sylvain Schmitz is a Professor of Computer Science at Université Paris Cité, affiliated with the IRIF institute. He leads the Automata and Applications team and contributes to modeling and verification research. Key Research Areas: Logic, Well Quasi Orders, Program Verification, Formal Languages, Database Theory Grants: ANR BraVAS (2017–2022), ANR PRODAQ (2015–2019), ANR ReacHard (2011–2014), ANR AVeriSS (2007–2009) His work focuses on the algorithmic complexity of well-quasi-orders, with applications to vector addition systems, Petri nets, and complexity hierarchies. He has delivered lectures on Algorithmic Aspects of WQO Theory (MPRI), Model-Checking Finite Structures (LMFI), and logic for the agrégation preparation. Recent publications analyze complexity bounds for vector addition systems and lossy counter machines, often leveraging ideal decompositions of well-quasi-orders. His 2024 ICALP paper with Lia Schütze addresses strongly monotone descending chains over ℕᵈ, while 2024 LICS work with Anand et al. explores unboundedness verification. Scientific Awards: IUF junior fellowship (2018–2023) He supervises PhD students Hector Buffière (2024–present), Aliaume Lopez (2019–2023), Anthony Lick (2016–2019), and Simon Halfon (2015–2018). He has served on steering committees for STACS (co-chair) and GT-Verif, and organized conferences like Highlights 2014.