Find Academic Supervisors

• Cyber-Physical Systems
• Runtime Verification
• Formal Methods
• +3 more

Dejan Nickovic is an Associate Professor in the Department of Cyber-Physical Systems at TU Wien. His primary affiliation is with the Research Area Cyber-Physical Systems (E191-01). Nickovic's research focuses on formal methods, runtime verification, and fault localization in cyber-physical systems (CPS). He has contributed to automated testing frameworks, specification mining, and formal validation techniques for embedded and reactive systems. His work emphasizes bridging the gap between theoretical formalisms and practical CPS applications. Notable research directions include mining specifications from data (e.g., timing diagrams), developing tools like TD-Magic and DeepSTL, and advancing hypernode automata for complex system modeling. He has also explored fault-injection methods (FIM) for Simulink models and mutation testing strategies for improving CPS reliability. Nickovic collaborates extensively with industry partners, as evidenced by his work on production-test coverage analysis in simulation environments. His research has been published in top-tier conferences and journals, focusing on topics like information-flow interfaces, hyperproperties, and adaptive testing strategies. He advises graduate students on CPS-related theses, including those on fault localization, analog-mixed signal verification, and failure explanation in CPS models. His contributions have advanced both academic and industrial applications of formal methods in CPS design and validation.

Nikolaj PopovView profile

Research Professor

• Program Verification
• Symbolic Computation
• Formal Methods
• +3 more

Nikolaj Popov is a Research Professor at the Research Institute for Symbolic Computation (RISC) of Johannes Kepler University, Linz, Austria. His work focuses on program verification, formal methods, and automated reasoning, particularly within the Theorema system. He specializes in verifying functional and recursive programs, combining symbolic computation with logical techniques to ensure correctness and termination. Education: PhD in Computer Science, RISC, Johannes Kepler University (2008) Research Interests: Popov’s research bridges theoretical computer science and practical applications, emphasizing automated theorem proving, program analysis, and formal verification. He develops methods for verifying complex program structures like mutual recursion and nested recursion, leveraging computer algebra systems. His work also explores the integration of formal methods into software engineering workflows. Key Contributions: Popov has co-authored foundational papers on verification condition generation, termination proofs, and automated debugging frameworks. His collaborations with Tudor Jebelean and others have advanced Theorema’s capabilities in handling functional programs and bridging logical and algebraic methodologies. Labs/Teams: Core member of RISC, contributing to its mission in symbolic computation and mathematical theory exploration.

• Artificial Intelligence
• Theoretical Computer Science
• Automated Reasoning
• +3 more

Martin Kronegger serves as a Senior Lecturer in the Department of Automation Systems at Vienna University of Technology (TU Wien), where he teaches courses including Fundamentals of Digital Systems, Computer Engineering Projects, and Scientific Projects in Computer Science for the 2025W and 2026S semesters. His academic profile demonstrates active engagement in both teaching and research within the Faculty of Electrical Engineering and Information Technology. Dr. Kronegger's research centers on theoretical foundations of artificial intelligence with emphasis on parameterized complexity, automated planning, and answer set programming. His work bridges theoretical computer science with practical applications in knowledge representation and reasoning, as evidenced by publications in premier venues like Artificial Intelligence journal and AAAI conferences. Key research themes include: Backdoor techniques for planning problems Parameterized complexity analysis of AI problems QBF solving for conformant planning SAT-based verification methods for software models His publication landscape reveals consistent contributions to parameterized complexity theory applied to planning and logic programming from 2011-2019, with significant work on multiparametric analysis of answer set programming and SAT-based approaches to planning problems. The research trajectory shows deepening theoretical contributions while maintaining connections to practical AI applications. Dr. Kronegger has supervised at least one diploma thesis on planning solvers and has participated in major research projects including FAIR (2013–2018), START (2014–2022), and X-TRACT (2014–2018). His project work demonstrates sustained collaboration with research groups at TU Wien focused on computational logic and automated reasoning. Based in the Automation Systems research group (E191-03) at TU Wien's Treitlstraße campus, he maintains active research collaborations through projects like the START program and contributes to the international answer set programming community as evidenced by involvement in the Fourth Answer Set Programming Competition.

• Fuzzy Logic
• Artificial Intelligence
• Automated Scheduling
• +2 more

Wolfgang Slany is Professor at Vienna University of Technology focusing on AI applications in scheduling systems. His research develops domain-specific languages and hybrid algorithms for workforce optimization in healthcare, call centers, and industrial settings. Key research areas: Fuzzy logic in AI systems Automated shift planning Break scheduling heuristics Test automation frameworks Publications demonstrate iterative development of the TEMPLE modeling language for staff scheduling. Recent work combines constraint programming with local search techniques to solve complex real-world scheduling problems across supervision systems and manufacturing environments.

• Formal Methods
• Program Analysis
• Verification
• +9 more

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

• Formal Verification
• SAT/SMT Solving
• Computer Algebra
• +4 more

Daniela Kaufmann is a PostDoc Researcher at the Department of Formal Methods in Systems Engineering , part of the School of Informatics at Vienna University of Technology. Her work focuses on combining SAT solving and computer algebra for formal verification of arithmetic circuits. Research Interests: Daniela specializes in Formal verification of arithmetic circuits Algebraic reasoning SAT/SMT solving Grammar inference Automated reasoning Finite field arithmetic verification Recent Article Trends: Her publications emphasize hybrid approaches merging SAT techniques with computer algebra for circuit verification, finite field arithmetic reasoning in SMT solvers, and fuzzing-based grammar inference. She has contributed to tools like AMulet2 and PolySAT, addressing scalability challenges in multiplier verification. Projects: Daniela is a key researcher in the CalgSAT (2024-2027) ARTIST (2021-2026) SFB SPyCoDe (2023-2026) projects funded by the Austrian Science Fund (FWF).

• Cybersecurity
• Data Protection
• Security Requirements Engineering
• +3 more

Nicola Zannone serves as Associate Professor and Chair of the Data Protection research group within the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). He holds a PhD in Computer Science from the University of Trento (2007), where his dissertation focused on security requirements engineering during a research visit to the Center for ... Research Focus: His work centers on cybersecurity with emphasis on data protection, phishing defense mechanisms, and access control systems. Recent investigations explore emerging threats like quishing and LLM-generated phishing attacks, autonomous navigation security, and industrial control system vulnerabilities. His research uniquely bridges technical security solutions with human behavioral factors in organizational contexts. Publication Trends: Between 2024-2025, Zannone's output demonstrates growing attention to AI-powered threats and automated vulnerability mitigation. His systematic reviews and empirical studies consistently address practical security challenges in critical infrastructure and software supply chains, reflecting industry relevance through collaborations with security practitioners. Leadership Roles: As Chief Editor for Computer Security (Frontiers in Computer Science) and Associate Editor for Cybersecurity and Privacy (Frontiers in Big Data), he shapes discourse in security research. His editorial work on topics like "Generative AI for Cybersecurity" highlights forward-looking engagement with evolving threat landscapes.