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

• Automata Theory
• Formal Methods
• Tree Automata
• +۴ مورد دیگر

Christof Löding is an Adjunct Professor at the Department of Logic and Theory of Discrete Systems (Computer Science 7) at RWTH Aachen University. His research focuses on automata theory, formal verification, and logical foundations of computer science, with significant contributions to Büchi automata, tree automata, and stochastic games. Academic affiliation: RWTH Aachen University, Germany Research areas: Automata theory, Formal methods, Game theory, Logic in computer science Contact: loeding@informatik.rwth-aachen.de His recent work spans deterministic parity automata construction, finite-valued transducers, and algorithmic solutions for infinite games. Publications emphasize theoretical foundations and practical applications in program verification and XML processing. Articles analyze automata learning, uniformization problems, and lookahead degrees in infinite games, showing interconnections between automata theory and formal verification.

• Time Series Analysis
• Blockchain Technologies
• Business Process Management
• +۸ مورد دیگر

Roman Vaculín is a Researcher at IBM Research, focusing on interdisciplinary domains where artificial intelligence, blockchain technologies, and data-centric workflows converge. His work spans automated machine learning, time series analysis, and secure computation via cryptographic methods like homomorphic encryption. Affiliation: IBM Research Key research areas: Time Series Analysis, Blockchain, AI Explainability, Business Process Management Across his publications, Vaculín explores: Time Series Modeling: Developing robust frameworks like TsSHAP and end-to-end architectures for forecasting and imputation. Blockchain Applications: Designing trusted AI systems, secure multi-party computation, and verifiable simulations. Automated Machine Learning: Creating toolkits for industrial AI explainability and automation. Privacy-preserving Techniques: Optimizing encrypted inference and secure decision tree protocols. His methodology often integrates formal verification with practical implementations, emphasizing efficiency and interpretability in complex systems. While no formal awards or students are documented in the provided data, his collaborative publications with institutions like IBM Research and academic partners highlight his role in advancing applied AI research.

Martin Vechevمشاهده پروفایل

استاد

• Programming Languages
• Software Analysis
• Static Analysis
• +۴ مورد دیگر

Martin Vechev is a Professor in the Department of Computer Science at ETH Zurich, leading the Secure, Reliable, and Intelligent Systems (SRL) Lab. His research bridges programming languages, software analysis, and emerging domains like quantum computing, with significant contributions to static analysis, abstract interpretation, and machine learning for code. His primary research interests include programming languages, static analysis, abstract interpretation, and quantum computing. Vechev has pioneered scalable techniques for software verification, particularly in concurrency and security analysis, and has recently driven innovations at the intersection of programming languages and quantum software development. His work emphasizes practical applications while maintaining theoretical rigor. Analysis of Vechev's recent publications reveals a strategic evolution toward quantum programming languages and machine learning integration. His lab has shifted from traditional static analysis to developing foundational frameworks for quantum circuit synthesis (e.g., Silq, Unqomp) and robust neural network certification, addressing critical challenges in quantum resource management and AI safety. The SRL Lab under Vechev's direction focuses on building intelligent systems that are inherently secure and reliable through advanced program analysis techniques. The lab's research spans theoretical foundations to industrial-strength tools, with strong emphasis on quantum software engineering and the application of machine learning to code understanding and generation.

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

استاد

• Artificial Intelligence
• Knowledge Representation
• Logic in Computer Science
• +۳ مورد دیگر

Prof. Jean Christoph Jung holds the Chair of Knowledge-Based Systems at TU Dortmund University since November 2022. He is affiliated with the Department of Computer Science within the Faculty of Computer Science. His academic journey includes a BSc in Computer Science (2006, TU Dresden), MSc in Computational Logic (2008, TU Dresden & Universidade Nova de Lisboa), and a PhD in Natural Sciences (2014, University of Bremen). Before his current position, he served as a research assistant at the University of Bremen (2009-2020), a postdoc at KU Leuven (2017/18), and an adjunct professor for Theoretical Computer Science at the University of Hildesheim (2020-2022). His research focuses on theoretical foundations of AI, logic-based knowledge representation (especially ontologies), and applications in computer science logic. Key contributions include work on ontology-mediated query answering, temporal logics, and PAC learning of logical concepts. He has co-authored numerous articles in top venues such as ICDT, DL, and AI conferences, addressing topics like query processing, logical separability, and formal verification. Though no specific grants or awards are mentioned, his extensive publication record highlights sustained contributions to the intersection of logic, databases, and AI. His work bridges theoretical advancements with practical applications in complex operational domains requiring robust knowledge representation systems.

• Data Management
• Computational Logic
• Database Theory
• +۱۰ مورد دیگر

Michael Benedikt is Professor of Computer Science at the Department of Computer Science, University of Oxford, and a Fellow of University College, Oxford. His research lies at the intersection of computational logic, database theory, and theoretical computer science, with a focus on query answering, logic-based data management, and formal methods for data integration. Institution: University of Oxford, Department of Computer Science Position: Professor of Computer Science Email: michael.benedikt@cs.ox.ac.uk Office: 355 Wolfson Building, Parks Road, Oxford OX1 3QD, UK His primary research interests include data management, computational logic, model theory, query reformulation, integrity constraints, existential rules, and fixpoint logics. He investigates theoretical foundations of querying Web and social network data, ontology-based data integration, and finite model reasoning. His recent publications span top venues such as VLDB, PODS, LICS, ICALP, and IJCAI, covering topics like scalable querying of nested data, interpolation in fixpoint logics, finite open-world query answering, and rewriting recursive queries. A unifying theme across his work is the application of logical methods to ensure correctness, decidability, and efficiency in data access and transformation. Best Paper Award, ICALP 2017 (Track B) EPSRC Established Career Fellowship (2015–2020) He has supervised numerous PhD students and postdoctoral researchers, including Jaclyn Smith, Djordje Zivanovic, Antonia Kormpa, and Benjamin Spencer. His research group has been supported by grants from EPSRC and Microsoft Research. He actively contributes to the academic community through service on program committees (e.g., LICS, PODS, IJCAI, VLDB) and editorial boards (e.g., Journal of Computer and System Sciences). He co-authored a book on interpolation-based query reformulation published by Morgan Claypool.

Raghavan Komondoorمشاهده پروفایل

دانشیار

• Programming languages
• Program analysis
• Software engineering
• +۹ مورد دیگر

Raghavan Komondoor is an Associate Professor in the Department of Computer Science and Automation at the Indian Institute of Science (IISc), Bangalore. His research focuses on programming languages, program analysis, and software engineering, with a strong emphasis on developing automated tools that help programmers understand, verify, and transform programs quickly and reliably. His primary research interests include: Programming languages and program analysis Software verification and testing Static analysis techniques Null dereference verification Points-to analysis Web application analysis ORM-based controller verification Memory optimization in Java programs Code clone detection and elimination Dr. Komondoor has developed several influential research tools including NPEDetector for null dereference verification, Ross for verifying Java program safety, DFAS for static analysis of asynchronous systems, PageModeler for web application analysis, and ORMInfer for verification of ORM-based controllers. His research spans over a decade with publications in top-tier software engineering conferences including ASE, ICSE, ISSTA, and SPLASH. His recent publications demonstrate a consistent focus on formal methods and program verification, with significant contributions to symbolic fixpoint algorithms, ORM controller verification, and controller synthesis over infinite state spaces. These works build upon his earlier foundational research in points-to analysis, web application analysis, and null pointer verification. Dr. Komondoor's service contributions to the academic community include: Program Committee Co-Chair for ATVA 2025 Organizing co-chair for ISEC 2024 Chair of PhD Symposium committee for ISEC 2020 Program committee membership for ICSE (2018-2025), ASE (2019-2020), ISSTA (2022), and numerous other major conferences He has successfully mentored numerous PhD and M.Tech students, many of whom now work at leading organizations including Microsoft, Siemens Research, Goldman Sachs, and academic institutions. Currently, he advises multiple PhD students and M.Tech researchers in the Programming Languages Laboratory at IISc. He teaches courses on Program Analysis and Verification, Principles of Distributed Software, and Formal Methods in Software Engineering, and maintains active research projects with open positions for research staff.

• Static Analysis
• Abstract Interpretation
• Fixpoint Algorithms
• +۱ مورد دیگر

Sarah Tilscher, M.Sc., is a researcher at the Chair for Languages and Structures in Computer Science at the Technical University of Munich (TUM). She contributes to teaching tutorials for courses including Advanced Concepts of Programming Languages and Compiler Construction , and has supervised seminars on static analysis and programming paradigms. Her research focuses on: Incremental and interactive static analysis using abstract interpretation Verification of fixpoint algorithms in Isabelle theorem prover Development of the Goblint static analyzer for concurrent C programs Formal methods for program correctness and verification Her publications (11 recent works) predominantly explore static analysis techniques, abstract interpretation frameworks, and verification tools. Key themes include top-down solvers, weak relational domains, parser generators, correctness witnesses, and concurrency modeling, primarily applied to programming languages and compiler design. She actively supervises student theses on topics including incremental static analysis, visualization of analysis results, and verification of fixpoint algorithms. Current opportunities include master's projects on verified top-down solvers and bachelor's projects on solver code generation. As a core member of the Goblint project team, she develops static analysis tools for memory safety and termination verification, collaborating with TUM researchers and external partners.

Francesco Ranzatoمشاهده پروفایل

استاد

• Abstract Interpretation
• Static Analysis
• Program Verification
• +۳ مورد دیگر

Francesco Ranzato is a Professor at the University of Padova , affiliated with the Department of Mathematics. His research spans abstract interpretation, static analysis, program verification, and formal methods in machine learning and concurrency theory. University: University of Padova Department: Department of Mathematics Research Interests: Abstract Interpretation, Static Analysis, Program Verification, Machine Learning Robustness Research Trends Francesco's recent work bridges abstract interpretation with machine learning verification, focusing on robustness certification for classifiers like decision trees, k-NN, and SVMs. He also advances algorithms for simulation and bisimulation in concurrent systems. Scientific Awards Distinguished POPL Paper Award (2019) Distinguished LICS Paper Award (2021) Facebook/WhatsApp Privacy-Aware Program Analysis Award (2022) Amazon Research Award (2023) Francesco has mentored research groups through open-source projects like SAVer , Meta Silvae , and ERC , and contributed to ACM, IEEE, and Springer publications.

Barbara Königمشاهده پروفایل

استاد

• Automata Theory
• Formal Languages
• Software Security
• +۵ مورد دیگر

Barbara König is a Professor at the University of Duisburg-Essen, affiliated with the Department of General Computer Science within the Faculty of Computer Science. Her research focuses on theoretical computer science, with a strong emphasis on formal methods, graph transformation systems, coalgebraic semantics, and behavioral metrics. She leads a team of researchers including postdocs and PhD students like Rebecca Bernemann and Sebastian Gurke. Her work integrates mathematical rigor with practical applications in formal verification, probabilistic systems, and automated reasoning. König has organized and contributed to numerous international conferences such as CSL, CONCUR, and ICGT, highlighting her role in advancing the field’s research agenda. Key research themes include fixpoint theory, coalgebraic modal logics, and the development of tools like CoReS for graph analysis. Her current projects explore quantitative logics, behavioral distances, and abstraction-refinement techniques for complex systems analysis. König actively contributes to academic communities through editorial roles and serves as a mentor in the university’s theoretical computer science department. Her interdisciplinary approach bridges foundational theory with applied challenges in software engineering and system modeling.

Robert Beinertمشاهده پروفایل

مدرس ارشد

• Applied Mathematics
• Inverse Problems
• Optimal Transport
• +۳ مورد دیگر

Robert Beinert is a Senior Lecturer (Privatdozent) in Applied Mathematics at the Technische Universität Berlin, affiliated with the Department of Applied Mathematics within the Faculty of Mathematics and Natural Sciences. He holds a Dr. rer. nat. (Ph.D.) from Georg-August-Universität Göttingen (2015) and completed his Habilitation at Technische Universität Berlin in 2025. His research focuses on inverse problems, optimal transport, phase retrieval, and mathematical imaging, with applications in signal processing and data analysis. He has held academic positions including Research Associate roles at TU Berlin (2020–2025), Karl-Franzens-Universität Graz (2016–2020), and Georg-August-Universität Göttingen (2016). His work bridges theoretical foundations and practical applications, with contributions to regularization techniques, optimal transport theory, and algorithmic development. Key research interests include phase retrieval uniqueness analysis, Gromov-Wasserstein transport, and denoising methodologies for manifold-valued data. His recent publications emphasize advancements in optimal transport frameworks, regularization strategies, and applications in image processing and machine learning.

Florian Beierمشاهده پروفایل

پژوهشگر

• Optimal Transport
• Multi-Marginal Optimal Transport
• Gromov-Wasserstein Distance
• +۳ مورد دیگر

Florian Beier is a Researcher at the Institute of Mathematics, Technical University of Berlin, specializing in Applied Mathematics. Since October 2021, he has served as a research assistant pursuing his Dr. rer. nat. His academic journey includes a Master of Science (2021) and Bachelor of Science (2018), both in Mathematics from TU Berlin, with thesis topics focusing on Optimal Transport and Percolation Theory. Research interests revolve around Optimal Transport theory, particularly multi-marginal and Gromov-Wasserstein formulations, with applications to mathematical imaging and computational geometry. His work bridges theoretical advancements and practical implementations, addressing challenges in transportation barycenters, entropic regularization, and algorithmic design for complex data analysis. Notable achievements include the Best Poster Award at the 2022 International Conference on Curves and Surfaces and recognition for academic excellence at TU Berlin's Dies Mathematicus. He actively contributes to conferences and workshops, presenting groundbreaking research on transport operators and barycenter computations. Current projects involve developing fixpoint iteration methods for Gromov-Wasserstein barycenters and exploring transport kernels for unpaired data analysis. His collaborations span institutions like the University of Tübingen and KTH Royal Institute of Technology, emphasizing interdisciplinary approaches to transport problems.