Igor Walukiewicz is a Researcher at the Laboratoire Bordelais de Recherche en Informatique (LaBRI) , affiliated with Université de Bordeaux , France. His work focuses on Concurrency Theory , Model Checking , Timed Automata , Higher-Order Model Checking , and Automata Theory . His recent research explores parametric systems , timed automata , and higher-order concurrency . Articles highlight advancements in verification techniques , synthesis of distributed algorithms , and partial-order reduction methods . Key subfields include deadlock avoidance , active learning , and logical frameworks for timed systems . He has secured significant ANR grants such as FREDDA (FoRmal Methods for Distributed Algorithms) and Ticktac (Verification of Real-Time Systems). He contributes to tools like TChecker , a model-checking tool for real-timed systems developed at LaBRI. Walukiewicz participates in editorial and organizational roles, including the Fundamenta Informaticae editorial board and HIGHLIGHTS conference steering committee. He has presented at major venues like LICS , CONCUR , and ICALP .
Eva Marlene Hausteiner is Professor of Political Theory and History of Ideas at Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), serving as Chair Holder and Institute Spokesperson for the Institute of Political Science since 2024. She has held this professorship since October 2022, following substitute professorships at the Universities of Passau (2022) and Greifswald (2021/2022). Her educational background includes a habilitation in Political Science from the University of Bonn (2021), a PhD with distinction (summa cum laude) on British imperialism (2013), and a Magister Artium in Political Science, Russian Studies, and Economics from Humboldt University Berlin, University of Potsdam, and La Sapienza University of Rome. Her international experience includes fellowships at Harvard University (John F. Kennedy Memorial Fellow), Princeton University, Columbia University, and NYU. Professor Hausteiner's research focuses on International Political Theory, Federalism, Democracy Theory, Empires and Imperialism, and Political Iconography . Her recent work increasingly addresses contemporary issues like conspiracy theories in digital democracies and dystopian political futures. She has developed a distinctive approach examining federal systems through historical imperial frameworks, while her recent publications reveal growing engagement with current democratic challenges including digital misinformation and political polarization. Her scholarly output demonstrates consistent quality with numerous peer-reviewed articles in journals like Contemporary Political Theory , Journal of International Political Theory , and Politische Vierteljahresschrift . Her monograph Greater than Rome: Neubestimmungen britischer Imperialität, 1870-1914 (2015) established her expertise in imperial political thought, while her habilitation Challenging federalism. Centralism, expansion, and expulsion in federal political thought (2020) extended this to contemporary federal systems. John F. Kennedy Memorial Fellow at Harvard University Center for European Studies Editor for Political Theory and History of Ideas at Politische Vierteljahresschrift Board member of the section 'Political Theory and History of Ideas' of the German Association for Political Science (2010-2022) Professor Hausteiner has demonstrated significant leadership through her role as Institute Spokesperson and her editorial work. Her research has evolved from historical imperial studies to increasingly address contemporary democratic challenges, particularly regarding digital misinformation and political polarization. She has also contributed to public discourse through media appearances in Süddeutsche Zeitung , ZEIT , and Deutschlandfunk Kultur. Her recent work on conspiracy theories during the pandemic demonstrates her ability to connect theoretical frameworks with urgent contemporary issues.
Dr. Florian Kammueller is an Associate Professor in Software Engineering at Middlesex University , specializing in formal methods for cybersecurity and privacy. His research focuses on attack trees , GDPR compliance , insider threat modeling , and quantum cryptography using the Isabelle theorem prover. He has published extensively on formal verification of security protocols, privacy in IoT healthcare systems, and trust in AI. Recent publications emphasize federated learning , differential privacy , and distributed ledger security , often applying formal verification techniques to address regulatory and technical challenges. His work bridges theoretical computer science with practical applications in critical infrastructure security.
Ugo Dal Lago is a Professor of Computer Science at the University of Bologna since November 2015 and maintains a dual affiliation with INRIA Sophia Antipolis. His academic career demonstrates extensive involvement with top-tier conferences including POPL, ICFP, ESOP, and ETAPS where he has served both as author and committee member. His research focuses on theoretical computer science with particular emphasis on programming language theory and quantitative aspects of computation. Dal Lago's work explores computational models beyond classical paradigms, including randomized, Bayesian, and quantum computing approaches. His contributions span from foundational complexity analysis techniques for functional programs to cutting-edge research in quantum programming languages. Analysis of his publication record (2022-2025) reveals three dominant research trajectories: quantum computing (with focus on circuit analysis and resource estimation), probabilistic computation (particularly on program equivalence and termination properties), and advanced type systems (intersection types, effect systems, and coeffect systems). His work consistently bridges theoretical foundations with practical applications, especially in emerging computational paradigms. Quantum Computing: Multiple publications on quantum circuit analysis, resource estimation, and multiparty protocols Probabilistic Programming: Research on almost-sure termination, expected cost analysis, and program equivalence Type Theory: Development of intersection types and effect systems for program verification Formal Methods: Application of Floyd-Hoare logic to quantum program verification Cryptography: Work on computational indistinguishability and logical relations for security proofs Dal Lago serves on steering committees for major conferences including DICE-FOPARA and ETAPS, and has been a program committee member for POPL, ICFP, and ESOP. His research demonstrates increasing focus on quantum information processing, with quantum-related publications comprising over 40% of his output in the most recent two years.
Günter Hotz is a full Professor at the Department of Computer Science (Fachrichtung Informatik), Universität des Saarlandes , Germany. His academic career spans over five decades, including roles as Director of the Computer Center (1972-1974) Spokesperson for SFB 100 (1982-1984) and SFB 124 (1991-1992) . Research Interests include Theoretical Computer Science Circuit Design Computational Complexity Information Theory Geometric Motion Planning Formal Verification . His work focuses on analytic machines, hardware verification, and motion planning algorithms, with applications in linguistics and VLSI design. Publications emphasize formal methods for hardware, computational models over real numbers, and efficient parsing algorithms. Key trends involve integrating mathematical theory with practical circuit design and motion planning solutions. Scientific Awards include Leibniz Prize (1986) Konrad Zuse Medal (1999) Grand Cross of Merit (1998) . Students : Supervised 40 dissertations, with over a third of his advisees becoming professors in mathematics and computer science. Labs & Projects : Led major research initiatives like SFB 100 (COMSKEE system) and SFB 124 (VLSI design methods). Collaborative works with international institutions in France, the U.S., and Georgia.
Affiliations Christos Dimoulas is an Assistant Professor of Computer Science at Northwestern University , within the McCormick School of Engineering and Applied Sciences and the Computer Science Department . His office is located at Mudd 3513. Education Ph.D. in Computer Science, Northeastern University, Boston, MA Research Interests Dr. Dimoulas focuses on Programming Languages , including type systems, gradual typing, formal methods, software contracts, and security. His work often explores the intersection of theory and practice, addressing challenges like blame assignment in type mismatches, efficient runtime checks, and language-based security mechanisms. Publications His recent work includes advancements in gradually typed languages, effectful software contracts, and transient semantics for Racket. Key themes include improving type safety, optimizing performance through profiling, and enhancing error localization via blame analysis. Students & Advising Current advisees include Nathaniel Hejduk and Chenhao Zhang . Alumni such as Dr. Lukas Lazarek (now at Brown University) have contributed to projects like blame evaluation in gradual types. Teaching Recent courses include CS 324/424: Dynamics of Programming Languages (Spring 2025) and CS 321: Programming Languages (Fall 2024). He often incorporates practical language design and implementation topics into his curricula. Labs & Collaborations His research frequently collaborates with institutions like Northeastern University and Brown University, focusing on projects such as the Rational Programmer framework for evaluating language pragmatics.
Prof. Bernd Finkbeiner is a faculty member at CISPA Helmholtz Center for Information Security and holds a Professorship in Computer Science at Saarland University. He earned his Ph.D. in 2003 from Stanford University. Leading the Reactive Systems Group since 2003, now part of CISPA, his research focuses on ensuring safety and security in computer systems through formal methods like specification, program synthesis, and verification. Key projects include output-sensitive reactive synthesis (OSARES), hyperproperty logics (HYPER), and real-time monitoring (RTLOLA). Education : Ph.D. in Computer Science, Stanford University, 2003 His research interests span hyperproperties, formal verification, runtime monitoring of cyber-physical systems, and distributed synthesis. He has pioneered tools like StreamLAB and AutoHyper for hyperproperty analysis. His work on temporal causality and information-flow guided synthesis addresses challenges in distributed and secure systems. Key Achievements : Recipient of ERC Advanced Grant 2022–2027 for Project HYPER Best Paper Awards at ICALP 2009, FSEN 2007, and VMCAI 2012 Leader of the Reactive Systems Group at CISPA Grants & Funding : ERC Advanced Grant supporting research on hyperproperties His lab develops cutting-edge tools for formal methods, including BoSy for bounded synthesis and RTLola for runtime verification. Current research explores compositional synthesis, explainable reactive systems, and robust monitoring for medical and autonomous systems.
Andreas Krall is an Associate Professor in the Department of Software Technology at TU Wien's Faculty of Informatics. He holds roles as Curriculum Coordinator for the Bachelor Informatics and Bachelor Software and Information Engineering programs, and serves as a Substitute Member of the Curriculum Commission for Informatics. His research focuses on compiler design, architecture description languages (e.g., VADL), and formal methods for ensuring correctness in compiler-processor co-design. Key research areas include computer architecture, compiler verification, embedded systems, and the development of tools for processor simulation and optimization. Krall has led projects such as 'Correct Compilers for Correct Processors' (2010–2015) and contributed to the CACAO JVM project. He has published extensively on topics like instruction selection, abstract state machines (CASM), and SSA-based optimizations. Notable awards include the Heinz Zemanek Preis (1987). His work spans over 30 years, with contributions to both academic research and industry-relevant tools like the VADL architecture description framework. Krall has advised numerous students in topics ranging from compiler backends to garbage collection algorithms.
Dr. Charles Thevathayan is an Associate Professor in the School of Science at RMIT University, Australia. His academic focus spans Computer Science Education, Software Security, Trust Models, and Model Checking. He actively contributes to curriculum design and pedagogical innovation in computing education. His research explores areas such as algorithmic reasoning, constructivist learning tools, and service-oriented frameworks for social data analysis. Dr. Thevathayan is open to supervising PhD/Masters students in these domains. Research interests include Big Social Data Analysis, educational technology, and software engineering methodologies. His work emphasizes reducing cognitive load in programming education and enhancing industry-relevant skills through innovative pedagogical approaches. He collaborates with industry partners to bridge theoretical and practical aspects of computing education. Recent publications highlight his contributions to algorithmic reasoning tasks, UML sequence diagram learning tools, and adaptive remediation systems for novice programmers. His research has been presented at conferences like ACM SIGCSE, ITiCSE, and IEEE TrustCom. Dr. Thevathayan holds expertise in mentoring diverse student cohorts and evolving project-based learning frameworks. He is committed to advancing educational practices in computing disciplines through evidence-based approaches.
Petr Jancar is a Professor at the Department of Informatics, Faculty of Science, Palacký University in Olomouc. He has previously held academic positions at VŠB-Technical University of Ostrava and the University of Ostrava. His research is centered in theoretical computer science, with deep contributions to automata theory, Petri nets, system verification, and computational complexity. Education RNDr, Theoretical Cybernetics and Mathematical Informatics, Faculty of Mathematics and Physics, Charles University, Prague (1982) CSc. (PhD equivalent), Dissertation: "Questions of Decidability of Dynamic Properties of Petri Nets", Charles University (1989) Appointed Associate Professor in Informatics, Faculty of Informatics, Masaryk University (1996) Appointed Professor in Informatics, VŠB-TU Ostrava (2008) His primary research interests include theoretical computer science , focusing on language and automata theory, computability and complexity, algorithm theory, and mathematical logic. A significant portion of his work addresses system verification , particularly using Petri nets and infinite-state systems. He investigates fundamental questions of bisimilarity, equivalence checking, decidability, and complexity in models like pushdown and one-counter automata. Jancar's recent publications (2020–2025) show a strong trend in advancing the theory of Petri nets, especially structural liveness, reachability, and home-space problems, often establishing high complexity bounds (e.g., Ackermann-complete). His work combines deep theoretical insight with formal rigor, frequently published in top venues like LICS, CONCUR, and LogMethCS. He has long-standing collaborations with researchers such as Jérôme Leroux, Zdeněk Sawa, and Antonín Kučera. Scientific Service and Recognition Member, Editorial Board, Information and Computation (since 2015) Member, Scientific Councils at Masaryk University, VŠB-TU Ostrava, Palacký University, and Brno University of Technology Chairman, GAČR Panel P202 Informatics (2015–2017) Member, Program Committees of major international conferences He has been a co-investigator and researcher on multiple GAČR projects, including those on algorithms for infinite-state systems, computational complexity of verification, and modeling of parallel systems. He has also participated in the Center for Applied Cybernetics. He has held research stays supported by grants in Germany, France, Sweden, and the UK. Laboratories and Research Groups His work is closely associated with formal methods and verification research groups at Palacký University and former affiliations. He has contributed to collaborative projects involving MPI verification and infinite-state system analysis.
Andy Schürr is a Full Professor at the Institute for Data Technology within the Department of Electrical Engineering and Communication Technology at Technische Universität Darmstadt. He holds a Dr. rer. nat. in Computer Science from RWTH Aachen and has held academic positions at institutions including the University of the German Armed Forces Munich and Queen’s University (Canada). His research focuses on model-based software engineering, embedded systems, graph transformation systems, and P2P technologies. Professional Activities: Co-organizer of >20 conferences/workshops Programme Committee Member for >130 conferences Editorial board member of Software & System Modeling (since 2004) Member of steering committees for GI Conference on Modeling, ICGT, and FASE Research Interests: Model-driven development of embedded systems Visual model transformation and specification languages Integration of system engineering tools Graph transformation applications in networking and real-time systems Awards & Recognition: Listed among the most cited computer scientists globally. Grants & Funding: Active in securing research funding for model-based engineering tools, graph transformation applications, and real-time systems development. Labs/Teams: Leads TU Darmstadt’s Real-Time Systems Group , focusing on model-driven prototyping and adaptive communication systems.
Dr. Andrew Butterfield is a faculty member at the School of Computer Science and Statistics, Trinity College Dublin. He serves as Head of the Foundations and Methods Group and actively contributes to Lero: the Irish Software Research Centre. His research focuses on Formal Methods and Functional Programming, particularly the Unifying Theories of Programming (UTP) paradigm, with applications in clinical pathways, medical device software, and spacecraft operating systems. Current research includes developing UTP theories for shared-variable concurrency, rely/guarantee reasoning, and separation logic in collaboration with Jim Woodcock. He also explores Process Modelling Language (PML) semantics with John Noll and Anila Mjeda. His contributions feature proof-assistance tools like UTP2 Theorem Prover, UTP Calculator, and ReasonEq implemented in Haskell. Andrew leads funded projects such as ESA's RTEMS-SMP (2019) and SFI's FMHIDA (2016-2020). Past projects encompass formal verification of separation kernels, Handel-C language semantics, and NAND flash memory models. He has taught courses in Formal Methods, Functional Programming, and Concurrency, while serving on editorial and program committees including Formal Aspects of Computing.
Amit V. Deokar serves as Associate Dean of Undergraduate Programs & Accreditation and Professor in the Department of Operations and Information Systems at UMass Lowell's Manning School of Business. He holds a Ph.D. in Management Information Systems from the University of Arizona and brings expertise from industrial and mechanical engineering backgrounds. His educational credentials include: Ph.D. in Management Information Systems, University of Arizona (2006) M.S. in Industrial Engineering, University of Arizona (2002) B.S. in Mechanical Engineering, V.J. Technological Institute, University of Mumbai (2000) Dr. Deokar's research centers on business analytics, machine learning applications, and business process management, with significant contributions to data mining, text mining, and artificial intelligence. His work bridges theoretical frameworks with practical implementations across healthcare, e-commerce, and transportation sectors, emphasizing real-world impact through industry collaborations and consulting engagements. His publication portfolio reveals a strategic focus on extracting actionable insights from complex data sources, particularly through process mining and text analytics. Recent work demonstrates increasing integration of generative AI techniques while maintaining strong methodological rigor in empirical validation. Key recognitions include: AIS Distinguished (cum laude) Member (2020) Association for Information Systems Teaching Excellence Award (2020) UMass Lowell IBM Faculty Award (2014) IBM Merill D. Hunter Award for Excellence in Research (2010) Dakota State University recognition As Associate Vice President of Technology for the Association for Information Systems, Editor-in-Chief of e-Service Journal, and leader of major conferences like AMCIS 2024, Dr. Deokar shapes academic discourse while securing research funding such as the 2017 Internal Seed Grant for urban transportation analytics. His industry consulting and keynote presentations on generative AI adoption further demonstrate applied scholarship.
Geoff Sutcliffe is a Professor in the Department of Computer Science within the College of Arts and Sciences at the University of Miami. His research focuses on automated reasoning systems, theorem proving, and logic languages, with significant contributions to the Thousands of Problems for Theorem Provers (TPTP) infrastructure. He serves as an active researcher in formal methods and artificial intelligence, with recent work integrating cloud computing infrastructure for theorem proving systems. Sutcliffe's research interests center on automated reasoning, where he has developed foundational infrastructure for theorem proving competitions and benchmarking. His work spans classical first-order logic through higher-order logic and non-classical logics, with particular emphasis on translation methods between logical systems. He investigates how automated theorem provers can solve complex logical problems, including quantified modal logic and higher-order logical inference. His research also explores the integration of machine learning techniques, particularly reinforcement learning, to enhance theorem proving systems' performance and efficiency. Sutcliffe has received notable recognition including the 2023 Amazon Research Award for his work on Automated Theorem Proving Community Infrastructure in the AWS Cloud . This award highlights his contributions to building scalable infrastructure for the automated reasoning community using cloud technologies. His publication record shows consistent contributions to the field of automated theorem proving, with recent work focusing on system competitions (CASC), logic language frameworks, and the empirical assessment of progress in automated reasoning. Sutcliffe has been instrumental in organizing and evaluating automated theorem proving systems through annual competitions that serve as the de facto world championship for ATP systems.
Graham Hutton is a Professor of Computer Science at the University of Nottingham , where he leads the Functional Programming Lab and serves as Director of the Midlands Graduate School . He co-founded the Quotient Haskell project and maintains key roles in Journal of Functional Programming editorial work and Haskell Foundation governance. Co-leader, Functional Programming Lab (2008–date) Director, Midlands Graduate School (2023–date) ACM Distinguished Scientist Principal investigator for £912k EPSRC project (2024–2027) His research focuses on mathematical approaches to program construction , particularly through functional languages like Haskell and Agda . He develops techniques for compiler correctness , type system design , and program optimization , with recent work on quotient polymorphism and denotational cost models . Key article themes include: Compiler derivation from formal semantics Effect handling in functional languages Graph-based code generation over traditional tree structures Quotient type systems with SMT solver integration Concurrency semantics using choice trees Operational improvement with parametric polymorphism Scientific awards include: ACM Distinguished Scientist (2013) Best Paper & Best Student Paper (2018) EPSRC funding for compiler correctness projects He advises current PhD students in compiler calculation and memory safety , while maintaining extensive educational contributions through his widely-used textbook Programming in Haskell and open course materials.
