جستجوی استاد راهنمای دانشگاهی

Cyrille Artho is an Associate Professor in the Division of Theoretical Computer Science at KTH Royal Institute of Technology, actively contributing to research in formal methods, software testing, and cybersecurity. His work spans model checking, smart contract security, and concurrent systems verification, with significant contributions to tools like Java Pathfinder and Modbat. PhD from ETH Zurich (2005) with dissertation on multi-threading fault detection Teaches Software Safety and Security, Software Engineering Fundamentals, and supervises degree projects His research focuses on developing formal techniques for safety-critical systems, particularly in blockchain security and distributed applications. Recent work emphasizes smart contract verification, anomaly detection in microservices, and trusted execution environments for secure cloud analytics. The 15 most recent publications reveal a strong trend toward blockchain security (6 articles), formal verification of distributed systems (5), and novel testing methodologies (4), with increasing integration of machine learning for vulnerability detection. As chair of the FTSCS workshop series and contributor to major conferences like ASE and ICST, Artho has significantly shaped the formal methods community. His leadership in organizing workshops demonstrates commitment to advancing safety-critical systems research. Principal investigator for C3.ai DTI Cyber Safety Cage for Networks project Develops Modbat framework for model-based API testing Active in Digital Futures research initiative at KTH

• Software Engineering
• Formal Methods
• Cybersecurity
• +۵ مورد دیگر

Pierre Flener is a Professor at the Department of Information Technology, Division of Computing Science at Uppsala University. He leads the Optimisation Group and is a member of the Centre for Interdisciplinary Mathematics. His work focuses on constraint programming and discrete optimization, addressing complex scheduling, routing, and resource allocation challenges. Flener is an Officer of the Order of Merit of Luxembourg and co-founder of NordConsNet, the Nordic Network for Constraint Programming researchers. Research Interests: Flener’s research spans constraint programming, combinatorial optimization, and algorithm design. He develops models and tools for automated decision-making in domains like air traffic management, sensor networks, and industrial robotics. His work emphasizes practical applications, leveraging constraint satisfaction techniques to solve real-world puzzles such as vehicle routing and personnel allocation. Key Contributions: Flener has authored over 100 publications on constraint solving, symmetry breaking, and CP-based approaches to industrial problems. Notable projects include airspace sectorization optimization, energy-efficient sensor networks, and financial portfolio design. He has led initiatives like Auto-Tabling for MiniZinc and collaborated on CP applications in bioinformatics and image processing. Labs & Teams: He heads the Optimisation Group at Uppsala, fostering research in CP and its applications. NordConsNet, co-founded by Flener, connects Nordic researchers and practitioners in constraint technology.

• Artificial Intelligence
• Constraint Programming
• Discrete Optimization
• +۵ مورد دیگر

Nir Piterman is a Professor in Computer Science at the University of Gothenburg's Department of Computer Science and Engineering. Previously, he was a Lecturer and later Reader (Associate Professor) at the University of Leicester (2010-2019), following postdoctoral research at EPFL (2005-2007) and a Research Fellowship at Imperial College London (2007-2010). PhD from Weizmann Institute of Science (2005), supervised by Amir Pnueli Postdoc at EPFL with Tom Henzinger (2005-2007) Research Fellow at Imperial College London (2007-2010) Lecturer at University of Leicester (2010-2019), promoted to Reader in 2012 Universitets Lektor (Associate Professor) at University of Gothenburg (2019-2021), promoted to Professor in 2021 His research focuses on formal verification, automata theory, and synthesis from temporal specifications. Current work under the ERC Consolidator Project dSynMA extends reactive synthesis to multi-agent systems, exploring frameworks combining message passing and variable sharing, algorithmic analysis of games with partial information, and logic extensions for agent interaction. He has supervised eight PhD students, including Prabhat Kumar Jha (path planning in game solving), David Lidell (automata constructions for LTL with past), and Claudia Cauli (cloud infrastructure security reasoning, 2022), with theses covering program verification, temporal logic, and game algorithms. ERC Consolidator Grant (2021-?, dSynMA) Editor-in-Chief, Formal Methods in System Design Editor, Acta Informatica Nir has taught courses such as Principles of Concurrent Programming (Chalmers, 2019-2025), Advanced C++ Programming (University of Leicester, 2012-2017), and Synthesis from Temporal Specifications (University of Buenos Aires, 2010). He actively recruits PhD candidates and has hosted postdoctoral researchers at multiple institutions.

• formal verification
• automata theory
• model checking
• +۴ مورد دیگر

Mads Dam is a Professor in Teleinformatics at the School of Computer Science and Communication at Kungliga Tekniska Högskolan (KTH), where he heads the Department of Theoretical Computer Science. His research focuses on computer security, formal methods, and program logics, with particular emphasis on the formal modeling and verification of low-level hardware and software execution platforms for security and application isolation. His educational background includes: PhD in Computer Science from the University of Edinburgh (1990) MSc in Computer Engineering from Aalborg University, Denmark BSc in Information Technology from Aalborg University, Denmark Mads Dam's research interests center on computer security, formal methods, and program logics. His current work focuses on the formal modeling and verification of low-level hardware and software execution platforms such as hypervisors and OS kernels and their underlying hardware. He has made significant contributions to information flow security, verification of microarchitectural systems, and network programming language security. His research bridges theoretical foundations with practical security applications. His recent publications show a strong trend toward verifying low-level systems, with a focus on information flow security for processors, network programming languages (particularly P4), and microarchitectural vulnerabilities. His work combines formal methods with practical security concerns, developing verification techniques that address real-world security challenges in hardware and software systems. The research spans theoretical foundations in temporal and epistemic logics to practical applications in network security and processor verification. His scientific awards and recognition include: Two framework grants from the Swedish Foundation for Strategic Research A junior individual grant from the Swedish Foundation for Strategic Research Project grants and a five-year research fellowship from the Swedish Research Council (VR) Project grants from Ericsson, Microsoft Research, US Air Force, and Vinnova (the Swedish Innovation Agency) Mads Dam has been a principal investigator on numerous research projects and has supervised many graduate students. He has been a partner in several European projects including HATS, S3MS, VerifiCard, LOMAPS, and UaESMC. His research has been supported by substantial grants from major funding bodies, reflecting the significance and impact of his work in computer security and formal methods. He is a founding member of several research centers at KTH, including Access, the CASTOR software research center, and the CDIS center for cyber defense and information security. These centers bring together researchers from multiple disciplines to address complex challenges in cybersecurity and software engineering.

• computer security
• formal methods
• program logics
• +۳ مورد دیگر

Christian Smith is an Associate Professor and Lecturer at the Department of Robotics, Perception and Learning at Kungliga Tekniska Högskolan (KTH Royal Institute of Technology). His research focuses on robotics and applications in human-centered environments like home environments, small workshops, and healthcare facilities, including the development of new robotic systems for research. Teaching Roles: Course Coordinator/Teacher/Examiner for courses such as Introduction to Robotics (DD2410), Research Project in Robotics (DD2411), and Java Programming for Python Programmers (DD1380) Research Themes: Human-Robot Interaction, Behavior Trees, Exoskeletons, Intent Recognition, and Multimodal Perception Awards: No specific scientific awards mentioned in the provided text His KTH profile highlights work on adaptive robotics systems and formalized control strategies. The research portfolio spans from theoretical studies on behavior tree programming to applied work in assistive technologies and teleoperation systems.

• Robotics
• Human-Robot Interaction
• Machine Learning
• +۷ مورد دیگر

Anna Gautier is an Assistant Professor in the Department of Computer Science at Chalmers University of Technology, affiliated with the Division of Data Science and AI. Previously, she was a Digital Futures Postdoctoral Fellow at KTH Royal Institute of Technology (2023–2025), focusing on mechanism design for multi-robot systems. Her research emphasizes planning under uncertainty, multi-agent systems, and human-robot interaction. She holds a PhD from the University of Oxford (2023), an MSc from the London School of Economics, and dual undergraduate degrees from Washington University in St. Louis. Education Background: PhD in Computer Science, University of Oxford (2023) MSc in Applied Mathematics, London School of Economics BA in Mathematics and BS in Computer Science, Washington University in St. Louis Research Interests: Dr. Gautier explores planning algorithms for multi-agent systems, particularly in uncertain environments. She designs mechanisms to coordinate robots and humans, leveraging game theory and formal methods. Her work addresses challenges like resource allocation, risk-aware decision-making, and trust in autonomous systems. Recent projects include contingency planning for autonomous vehicles and auction-based resource distribution. Professional Activities: She co-chairs the ECAI 2025 Demonstration Track and teaches the course Safe Robot Planning and Control at KTH. Her projects include collaborations with WASP-Nest (PerCorSo) and TECoSA on trustworthy autonomy. She actively publishes in top venues like AAMAS and AAAI. Labs and Teams: Affiliated with Chalmers' Data Science and AI division, she leads research in multi-agent systems and human-AI collaboration.

• Multi-Agent Systems
• Robotics
• Artificial Intelligence
• +۳ مورد دیگر

Andreas Abel is a Senior Lecturer in the Division of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology and the University of Gothenburg. He has previously served as an Assistant Professor at Ludwig-Maximilians-Universität (LMU) Munich and has been a visiting researcher at INRIA in Paris. His primary affiliations are with Chalmers and the University of Gothenburg, where he conducts research and teaches in programming languages and type theory. Chalmers University of Technology, Department of Computer Science and Engineering, Senior Lecturer University of Gothenburg, Division of Computing Science LMU Munich, Assistant Professor (former) INRIA Paris, Visiting Researcher Abel’s research lies at the intersection of type theory, functional programming, and formal verification. He is particularly known for his work on dependent types, normalization by evaluation, and the development of the Agda proof assistant. His interests include constructive logic, logical frameworks, modal and linear typing, program verification, and compiler construction. He leads the Modal Dependent Type Theory project funded by the Swedish Research Council (Vetenskapsrådet) and has contributed to several other major research initiatives in programming language theory. His recent publications reflect a strong focus on foundational aspects of type systems, including cubical type theory, decidability of conversion, and formalization of algebraic completeness. These works appear in top-tier venues such as ICFP, LICS, POPL, and TYPES, showcasing both theoretical depth and practical implementation in Agda. Distinguished Paper Award, ICFP 2019 Editor, Theoretical Pearls column, Journal of Functional Programming Member, IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students and contributes to the research community through program committee memberships for major conferences including LICS, ICFP, and CPP. He is a senior developer of Agda and the maintainer of the BNFC (Backus-Naur Form Compiler) tool. His work bridges theoretical computer science with practical software development for formal methods. He is involved in several research groups and projects, including the Programming Logic Group at Chalmers and the international EUTYPES network. His role as principal investigator and core contributor in multiple funded projects highlights his leadership in the field of programming language foundations.

• Type Theory
• Dependent Types
• Functional Programming
• +۱۱ مورد دیگر

Dilian Gurov is a Professor in Computer Science at KTH Royal Institute of Technology, associated with the Digital Futures Faculty and the Division of Theoretical Computer Science. He also coordinates the Doctoral Programme in Computer Science at the CSC school. Before joining KTH in 2002, he earned a Ph.D. from the University of Victoria, Canada (1998), and worked at the Swedish Institute of Computer Science (1997-2002). His research focuses on software specification and verification, including contracts, program models, logics, and tools, as well as multi-agent strategic planning involving knowledge-based strategies in imperfect information settings. Key contributions include the CAV Distinguished Paper Award 2023 for 'Automatic Program Instrumentation for Automatic Verification' and an EASST award for 'Checking Absence of Illicit Applet Interactions: A Case Study' (2004). He leads projects funded by VR (SEFROS, ContraST) and Vinnova (AVerT2) and collaborates with industries like Scania on formal verification of C programs. His service roles span over 30 conference committees and organization roles, including PC memberships for iFM, TAP, and ISoLA. Teaching responsibilities include courses such as 'Formal Methods,' 'Program Semantics and Analysis,' and 'Knowledge in Games with Imperfect Information.' His work emphasizes practical applications of formal methods, bridging academic research with industry needs through collaborations and tool development (e.g., CVPP, ProMoVer, TriCo).

• Software Specification and Verification
• Multi-Agent Strategic Planning
• Formal Methods
• +۳ مورد دیگر

Gerardo Schneider is a Full Professor in Computer Science at the University of Gothenburg, Sweden, and holds a joint appointment at Chalmers University of Technology. He serves as Head of the Data Science and Artificial Intelligence (DSAI) Division and has previously led the Formal Methods Division and acted as Director of Graduate Studies. University of Gothenburg: 2009–present Chalmers University of Technology: 2009–present Uppsala University: 2002–2003 University of Oslo: 2005–2009 His research focuses on formal methods for software engineering, including contract specification and analysis , privacy policy formalization , model checking , and runtime verification . He works on verification of real-time systems, embedded systems (e.g., smart Java cards), and blockchain-based smart contracts. Key projects include: X-LEGAL (2020–2023): Smart Legal Contracts (Swedish Research Council) PolUser (2016–2019): User-Controlled Privacy Policies (Swedish Research Council) ARVI (2014–2018): Runtime Verification Beyond Monitoring (ICT COST Action) ReMU (2013–2017): Reliable Multilingual Digital Communication (Swedish Research Council) He has supervised numerous PhD and Master’s students in formal methods, blockchain security, and privacy compliance. His tools include SPeeDI (Polygonal Hybrid Systems Verification), CLAN (Contract Normative Conflict Detection), and AnaCon (Controlled Natural Language Analysis).

• Formal Specification and Analysis of Contracts
• Formalization of Privacy Policies
• Model Checking
• +۵ مورد دیگر

Hamed Nemati is an Assistant Professor at the Division of Network and Systems Engineering under the School of Electrical Engineering and Computer Science at KTH Royal Institute of Technology in Stockholm, Sweden. He was previously a Visiting Assistant Professor at Stanford University and a Research Group Leader at the Helmholtz Center for Information Security (CISPA) , where he also worked as a PostDoc and Research Fellow. Education : PhD in Computer Science from KTH Royal Institute of Technology Research Interests : Security of systems software, formal methods and program logics, interactive theorem proving, machine code analysis, applied machine learning Current Projects : Systematic verification of multi-language security protocols, hardware-software co-design for Spectre mitigation, capability-based access control models Scientific Awards : WASP (Wallenberg AI, Autonomous Systems and Software Program) faculty member Teaching Activities : Formal Methods in Security (Fall 2020-2023) at CISPA/Saarland University Digital Forensics and Incident Response (EP2780) (Fall 2024) at KTH

• Security of systems software
• Formal methods and program logics
• Interactive theorem proving
• +۲ مورد دیگر

Karl Palmskog is a Lecturer at KTH Royal Institute of Technology in the Division of Theoretical Computer Science and the STEP research group. His work focuses on program verification and proof engineering, with particular emphasis on developing techniques and tools based on proof assistants for constructing functionally correct and secure software systems. Palmskog received his Ph.D. in Computer Science in 2014 from KTH, advised by Mads Dam, and his M.Sc. in Computer Science and Engineering from KTH in 2007. Prior to his current position, he was a postdoc at The University of Texas at Austin and University of Illinois at Urbana-Champaign. His research interests span programming languages, software engineering, and formal verification, with a particular focus on developing techniques and tools based on proof assistants. He is an avid user of the Coq proof assistant for both proving and programming, often complemented by OCaml, and also utilizes HOL4 and other ML family dialects. His work bridges theoretical foundations with practical applications, particularly in the domains of blockchain systems, distributed systems, and automotive software verification. Analysis of his recent publications reveals a strong focus on Coq-based verification, with significant contributions to proof engineering tools and methodologies. His work includes developing tools for regression proving, change impact analysis, mutation testing for Coq projects, and lemma name suggestion using deep learning. There's also a growing trend toward applying formal methods to real-world systems like blockchain protocols and automotive software. Palmskog has been involved in several research projects, including Coq-community Proof Engineering and Distributed Components. His past projects include Trustfull (SSF), Model-based Event Driven Scalable Programming for the Mobile Cloud (NSF), Highly Adaptable and Trustworthy Software (EU FP7), and 4WARD Future Internet (EU FP7). As an educator, Palmskog has served as examiner, course responsible, teacher, and assistant for various courses including Algorithms, Data Structures and Complexity; Degree Projects; Game Theory; Parallel and Distributed Computing; and Programming Paradigms. His work on Chip, a Coq formalization of change impact analysis, demonstrates his commitment to creating practical, certified tools that bridge formal methods with software engineering practice.

• Program Verification
• Proof Engineering
• Formal Methods
• +۴ مورد دیگر

Peter Dybjer is a Professor of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology in Sweden. He is a leading researcher in the field of type theory, with a focus on intuitionistic type theory, categorical semantics, and proof assistants. His work bridges foundational aspects of mathematics and computer science, emphasizing constructive methods and formal verification. Research Interests: Intuitionistic Type Theory and its categorical semantics Proof assistants and formal verification Inductive and inductive-recursive definitions Game semantics and normalization techniques Dependent type systems and their applications Homotopy Type Theory and univalent foundations Activities & Contributions: Editor of the Bulletin of Symbolic Logic Member of program committees for conferences like TYPES, FSCD, and MFPS Keynote speaker at events including the European Congress of Mathematics and the Hausdorff Research Institute's Summer School on Types, Sets, and Constructions Initiated and directed the Master's Program in Computer Science – Algorithms, Languages, and Logic at Chalmers Teaching & Outreach: Professor Dybjer has taught advanced courses at international summer schools, including: Inductive Definitions in Constructive Type Theory (TYPES Summer School, 2005) Dependent Types at Work (LerNet Summer School, Uruguay, 2008) Normalization by Evaluation (Midlands Graduate School, 2009 and 2015)

• Intuitionistic Type Theory
• Categorical Type Theory
• Proof Assistants
• +۹ مورد دیگر

Dr. Muhammad Humayoun is a Senior Lecturer at Karlstad University, Sweden, specializing in informatics education and computational linguistics research. He holds a Ph.D. from University of Grenoble Alpes (2012) and M.Sc. from Chalmers University (2006). His academic career spans over 15 years across Pakistan and Sweden, including teaching roles at COMSATS University, University of Central Punjab, and Higher Colleges of Technology. Research Focus: His work centers on NLP applications for under-resourced languages like Urdu/Punjabi, including text summarization, abusive language detection, and formalization of mathematical texts. He has developed linguistic resources (corpora, lexicons) and contributed to plagiarism detection systems in programming courses. Teaching Contributions: Designed and taught over 15 courses across multiple universities, including advanced programming, AI, and cloud computing modules. Currently teaches graduate-level courses like 'Legal Tech, AI and Rules-as-Code' and undergraduate software engineering courses at Karlstad University. Awards: Recognized for Urdu threat detection system (3rd place, 2021) and top rankings in Urdu fake news competitions. His work on Urdu summarization corpora has been widely cited in computational linguistics research.

• Machine Learning
• Computational Linguistics
• Natural Language Processing
• +۵ مورد دیگر

Didrik Lundberg is a Researcher at the Department of Theoretical Computer Science within the School of Electrical Engineering and Computer Science at Royal Institute of Technology . His work focuses on system security and formal methods , particularly in mechanized reasoning for the P4 programming language. Key research areas include formal verification , network security , and program logic , as evidenced by his publications on HOL4P4 , symbolic execution , and unstructured program logics . He has presented at international conferences such as SEFM 2020 , OOPSLA 2024 , and VSTTE 2024 . His peer-reviewed articles and conference contributions span topics like P4 semantics, data plane verification, and Hoare-style logic for unstructured programs. He also authored a master's thesis titled Provably Sound and Secure Automatic Proving and Generation of Verification Conditions (2018).

• System Security
• Formal Methods
• P4 Programming Language
• +۳ مورد دیگر

Lars-Henrik Eriksson is a Senior Lecturer in the Department of Computer Science at Uppsala University, part of the Department of Information Technology. He holds a PhD and is recognized as an Excellent Teacher and educational mentor. He currently serves as the program director for the Master's program in Computer Science and has previously held leadership roles, including Head of the Department of Computer Science from 2004 to 2018. PhD in Computer Science Excellent Teacher Award Pedagogical Mentor at Uppsala University His research focuses on the applications of logic in computer science, particularly formal methods for software development. His work spans formal specification, verification, and synthesis, with strong emphasis on logic programming, interactive theorem proving, and logical frameworks. He has made significant contributions to the use of formal methods in safety-critical domains such as railway signaling. His current research includes modeling application domains within formal methods and formalizing concurrency theory using the Isabelle proof assistant. The recent publications reflect a sustained focus on modal logics for nominal transition systems, formal verification tools (e.g., GTO), and domain-specific applications of formal methods. These works demonstrate deep integration of theoretical logic and practical software engineering, especially in distributed and safety-critical systems. The recurring themes include concurrency, verification, and the use of domain models to enhance formal reasoning. Scientific Awards and Recognitions: Excellent Teacher Pedagogical Mentor Lars-Henrik Eriksson has advised numerous students through project supervision, thesis reviews, and course mentorship, though no formal list of advisees is provided. He has been involved in significant research management, including leading the department and directing a master’s program. He has also collaborated with industry, particularly in railway signaling, contributing to safety analysis and formal verification projects with Trafikverket and through companies he co-founded. He is a board member of Formal Methods Europe and served as program committee chair for the FME Symposium 2002 (part of FLoC’02). His work bridges academia and industry, especially in the application of formal methods to real-world engineering challenges.

• Formal Methods
• Logic in Computer Science
• Programming Language Theory
• +۷ مورد دیگر