Find Academic Supervisors

Daniel RehsmannView profile

Researcher

• Game Theory
• Mechanism Design
• Auction Design
• +8 more

Daniel Rehsmann is a researcher in the Department of Business Decisions and Analytics at the Faculty of Business, Economics and Statistics, University of Vienna. His work centers on economic theory with a focus on game theory and mechanism design, particularly under conditions of asymmetric information, contests, and auction design. His research interests span game theory , mechanism design , industrial organization , and computational economics . These are supported by interdisciplinary methods drawing from economics and computer science, especially in combinatorial auctions and computational experiments. His work often addresses practical applications in carrier collaboration, public goods provision, and strategic information environments. The recent publications reflect a strong trend in applying theoretical economic models to operational and strategic decision-making problems, combining formal analysis with computational validation. Topics include optimal allocation, discriminatory power in markets, and consistency checks in valuation systems. Scientific Awards: No awards mentioned in the provided text. Daniel Rehsmann is actively involved in academic and public discourse, presenting at talks on topics such as Contesting Fake News and Auctions and Land Purchase . While no formal advisees or grants are listed, his collaborative work with researchers like Rudolf Vetschera and Paul Schweinzer suggests active research engagement. There is no mention of leadership in labs or research teams in the current data.

Christel BaierView profile

Professor

• Probabilistic systems
• Modeling and specification formalisms
• Semantics of coordination languages
• +4 more

Christel Baier is a Full Professor for Algebraic and Logical Foundations of Computer Science at the Faculty of Computer Science, Technical University Dresden. She has held this position since 2006, following her role as Professor for Theoretical Computer Science at Rheinische-Friedrich-Wilhelms Universität Bonn (1999-2006). Her research focuses on probabilistic systems, modeling and specification formalisms, semantics of coordination languages, probabilistic model checking, quantitative analysis, temporal and modal logics, and automata theory. Her work bridges theoretical computer science with practical applications in system verification and analysis, particularly in developing formal methods for probabilistic and timed systems. Professor Baier's publications demonstrate consistent contributions to theoretical computer science with a clear trajectory from foundational work in automata theory to applied model checking techniques. Her research shows particular strength in probabilistic verification methods and their application to complex system analysis. Award for visiting professor (1 month in both years), CNRS/ENS Cachan, France (2005 and 2006) ETAPS Best Theory Paper Award (2008) Professor Baier has advised numerous PhD students throughout her career, including Alexander Asteroth, Nathalie Bertrand, Marcus Groesser, Verena Wolf, and Frank Ciesinski. She currently supervises 4 PhD students at TU Dresden. She has served as Chair of the examination board for bachelor, master and diploma programs in Computer Science at TU Dresden and has been Principal Investigator for 4 national projects funded by the German Research Foundation (DFG). Her research group at TU Dresden focuses on advancing formal verification methods for probabilistic systems. She maintains active involvement in the academic community through editorial board membership of the Journal of Universal Computer Science, steering committee participation for major conferences, and extensive program committee service for top-tier theoretical computer science venues.

• Formal Methods
• Parallel and Distributed Computing
• Symbolic Computation
• +3 more

Wolfgang Schreiner is an A.Univ.-Prof. (Associate University Professor) at the Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. His research focuses on formal methods, parallel and distributed computing, and symbolic computation. He leads projects in automated reasoning, programming language semantics, and educational software tools. His work emphasizes practical applications of formal methods, including the development of tools like RISCAL for model checking and the RISC ProgramExplorer for program reasoning. He collaborates on interdisciplinary projects, such as analyzing queueing systems using probabilistic model checking and designing grid computing frameworks for medical applications. Key research interests include semantics-based language design, theorem proving, and educational technology. He has authored textbooks like *Concrete Abstractions* and *Thinking Programs*, emphasizing foundational concepts in computer science. His contributions span theoretical advancements and practical implementations, with notable work in distributed systems, formal verification, and computational logic.

• Algorithmics
• Computational Complexity
• Graph Theory
• +3 more

Jan Niclas Dreier is a PostDoc Researcher at TU Wien's Department of Algorithms and Complexity. His research focuses on theoretical computer science, particularly algorithmic meta-theorems, structural graph theory, and computational complexity. He is affiliated with projects such as REVEAL-AI and SLIM. His work addresses topics like monadic stability, SAT solving, and model checking on sparse graph classes. Research Interests : Dreier's primary areas include algorithm design, parameterized complexity, and logic in computer science. His contributions span model checking for graph classes, backdoor analysis in SAT solving, and combinatorial properties of monadic dependence. Recent work explores the interplay between structural graph theory and algorithmic efficiency, with applications to finite model theory and pseudorandom models. Teaching : He teaches courses such as Algorithmic Meta-Theorems , Algorithmics , and Bachelor Thesis in Computer Science . His courses emphasize theoretical foundations and practical algorithmic techniques. Projects : Active involvement in the REVEAL-AI project (2020–2024) and SLIM (2019–2024), focusing on algorithmic advancements in AI and structural graph analysis.

• Databases
• Artificial Intelligence
• Text Mining
• +2 more

Ingo Feinerer serves as an Associate Professor at Vienna University of Technology's Faculty of Informatics, specifically within the Institute of Information Systems Engineering (E192-02). His research bridges theoretical computer science and practical applications in database systems, artificial intelligence, and text mining, with significant contributions to configuration management and formal methods. His educational background includes: PhD Dissertation (2007): A formal treatment of UML class diagrams as an efficient method for configuration management Diploma Thesis (2005): Formal program verification: a comparison of selected tools and their theoretical foundations Feinerer's research focuses on database theory (particularly schema mapping and dependencies), AI-driven configuration systems using integer linear programming, and text mining infrastructure development in R. His work combines theoretical rigor with practical tool development, notably through the textcat and tm packages. The integration of formal methods in software engineering remains a consistent thread throughout his publications. Analysis of his 15 most recent publications reveals strong specialization in database constraints (40%), text mining applications (30%), and software configuration systems (30%), with increasing interdisciplinary work connecting computer science to digital humanities. His notable recognition includes: INiTS Award (2007) for technology commercialization potential Feinerer has supervised doctoral research including F. I. Chertes' work on schema mapping languages and diploma theses on UML semantics and probabilistic databases. He led major research projects HINT (2012-2017) and SEE (2012-2016) focusing on database technologies and information systems. His work demonstrates consistent funding through Austrian national research programs. As a core member of the Databases and Artificial Intelligence research group, he collaborates extensively on R package development for text analysis and contributes to international workshops on theoretical aspects of software engineering.

Robert Jan van GlabbeekView profile

Professor

• Concurrency theory
• Formal methods
• Verification of distributed systems
• +1 more

Robert Jan van Glabbeek is a Professor at the University of Edinburgh, Royal Society Wolfson Fellow since 2022, and holds unpaid adjunct/research affiliations at Stanford University (since 2002) and the University of New South Wales (since 2004). Previously, he served as Chief Research Scientist at CSIRO (2016-2021) and Principal Researcher at NICTA (2004-2016). His research spans concurrency theory, formal methods, and verification of distributed systems. He pioneered branching bisimulation and contributed to unifying semantic equivalences in process algebra. His work bridges process algebra with Petri nets, advances probabilistic process verification, and addresses fairness assumptions in distributed systems. Key publications include foundational papers on branching time semantics, probabilistic processes, and AODV routing protocol verification. His work underpins formal verification tools like mCRL2 and CADP, influencing both theoretical concurrency and practical protocol analysis. Foreign Member of the Royal Holland Society of Sciences and Humanities CONCUR test-of-time award Royal Society Wolfson Fellowship

• Cyber-Physical Systems
• Formal Verification
• Probabilistic Systems
• +3 more

Francesco Pontiggia is a PreDoc Researcher at the Institute of Computer Engineering, Faculty of Informatics at TU Wien. His research focuses on formal verification of probabilistic systems, cyber-physical systems, and automated controller synthesis. He contributes to the ProbInG project (2020–2025), developing model checkers for probabilistic operator precedence languages and related formalisms. Key research interests include probabilistic hyperproperties, formal methods for probabilistic programming, and verification techniques for recursive stochastic systems. His work bridges theoretical foundations with practical tools such as POPACheck and POMC, targeting applications in automated planning and program analysis. Recent publications (2019–2025) emphasize advancements in model checking algorithms for probabilistic systems, operator precedence languages, and exception handling mechanisms. These works address challenges in verifying complex systems with stochastic behaviors and conditional probabilities. He collaborates on projects integrating formal methods with compiler design, runtime verification, and cyber-physical system design. His research has led to tool implementations and theoretical frameworks published in top-tier venues like QEST and ACM Transactions on Programming Languages and Systems.

• 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 Methods
• Temporal Logic
• Automata Theory
• +5 more

Michele Chiari is a PostDoc Researcher at TU Wien's TrustCPS Group led by Prof. Ezio Bartocci. Previously, he was a PhD candidate and PostDoc at Politecnico di Milano's DEIB in the DeepSE group. His primary affiliations include TU Wien and the TrustCPS group, with a focus on formal verification and cyber-physical systems. Education: PhD candidate and PostDoc at Politecnico di Milano's Department of Electronics, Information, and Bioengineering (DEIB). Research interests include formal methods for safety-critical systems, temporal logic, automata theory, model checking for recursive probabilistic programs, infrastructure-as-code modeling (DOML), floating-point computation verification, and approximate computing. Research highlights: Development of POTL (Probabilistic Operator Temporal Logic), model checkers for operator precedence languages (POMC), and contributions to the PIACERE and CORPORA projects. His work bridges theoretical formal methods with practical applications in software engineering and embedded systems. Key projects include leadership of the EU-funded MSCA PF CORPORA project (2023–present) and contributions to the PIACERE H2020 initiative. Collaborations include tools like TAFFO (floating-point precision tuner) and DOML (Infrastructure-as-Code modeling framework). Labs/Teams: Core member of TU Wien's TrustCPS Group and former contributor to Politecnico di Milano's DeepSE Group. Active in conferences like CAV, RV, and CAiSE, with recent service roles on OOPSLA and RV program committees.

Marta KwiatkowskaView profile

Professor

• Automated Verification
• Probabilistic Model Checking
• Temporal Logics
• +4 more

Marta Kwiatkowska is a Professor of Computing Systems and Fellow of Trinity College at the University of Oxford . She has held academic positions at the University of Birmingham (School of Computer Science), University of Leicester, and Jagiellonian University in Poland. Her expertise lies in probabilistic and quantitative verification methods, with contributions to the PRISM model checker and applications in systems biology, communication protocols, and nanotechnology. Education: BSc/MSc in Computer Science, Jagiellonian University MA from Oxford PhD in Computer Science from the University of Leicester Research Interests: Probabilistic model checking, formal verification of complex systems, temporal logics, and interdisciplinary applications in biology and ubiquitous computing. Her work emphasizes bridging theoretical foundations with practical tools like PRISM, widely used in academia and industry. Awards: Fellowships from Royal Society, ACM, EATCS, BCS, and Polish Society of Arts & Sciences. ERC Advanced Grant (VERIWARE, £3.7m funding). Top Cited Article Award (2010) and Best Paper Award (QEST 2006). Grants & Leadership: Leads £3.7m grant-funded research on system verification. Serves on editorial boards of IEEE Transactions on Software Engineering and Royal Society's Philosophical Transactions A. Organized conferences such as QEST and the Royal Society Discussion Meeting on ubiquitous computing. Labs/Teams: Principal contributor to the PRISM model checker project, a cornerstone of probabilistic verification research.